Lecture 11 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie continues with recursive backtracking and introduces pointers and recursive data. Following, she focuses on solving the problems rather than the exact code and later uses the example of a program that will solve a Sudoku puzzle. She explains that recognizing and looking for patterns between all of the different recursive examples is an important component to learning recursion. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com
Posts Tagged ‘ science ’
vista windows
Speed up Windows XP (Disk defragmenter & error check)
An Overview of High Performance Computing and Challenges for the Future
Google Tech Talks January, 25 2008 ABSTRACT In this talk we examine how high performance computing has changed over the last 10-year and look toward the future in terms of trends. These changes have had and will continue to have a major impact on our software. A new generation of software libraries and algorithms are needed for the effective and reliable use of (wide area) dynamic, distributed and parallel environments. Some of the software and algorithm challenges have already been encountered, such as management of communication and memory hierarchies through a combination of compile–time and run–time techniques, but the increased scale of computation, depth of memory hierarchies, range of latencies, and increased run–time environment variability will make these problems much harder. We will focus on the redesign of software to fit multicore architectures. Speaker: Jack Dongarra University of Tennessee Oak Ridge National Laboratory University of Manchester Jack Dongarra received a Bachelor of Science in Mathematics from Chicago State University in 1972 and a Master of Science in Computer Science from the Illinois Institute of Technology in 1973. He received his Ph.D. in Applied Mathematics from the University of New Mexico in 1980. He worked at the Argonne National Laboratory until 1989, becoming a senior scientist. He now holds an appointment as University Distinguished Professor of Computer Science in the Electrical Engineering and Computer Science Department at …
Kerry Decker TV Show: The Adam Computer (1986)
More highlights from my “NightLife Show” which ran on local cable TV in FL from 1980-1986. This is one of my final NightLife TV Shows that made it to air. This program shows the revolutionary Adam Computer in it’s final days. This program is not complete as the original videotape loses it’s tracking before the end. However, since it’s one of the few programs devoted to the departed Adam, I wanted to show it anyway. I had to read off the specs as I didn’t know what any of this was back then. The Coleco Adam was an attempt in the early 1980s by American toy manufacturer Coleco to follow on the success of its ColecoVision game console. The Adam was not very successful, partly because of early production problems. In its favor, the Adam had a large software library from the start. It was derived from and compatible with the ColecoVision’s software and accessories, and, in addition, the popular CP/M operating system was available as an option. Its price gave a complete system: a 64 KB RAM computer, tape drive, letter-quality printer, and software including the Buck Rogers: Planet of Zoom video game. The IBM PCjr sold for $669 but included no peripherals, and although the popular Commodore 64 sold for around $200, its price was not much lower after the purchase of a printer, tape or disk drive, and software. Like many home computers of its day, it used a television set for its monitor. The SmartWriter electronic typewriter loads when the system is turned on. In this mode, the …
Lecture 9 | Programming Abstractions (Stanford)
Lecture 9 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie goes over recursion and the proper ways to solve problems recursively. She continues with the example of a program that draws a fractal image and explains a Mandarin code to illustrate the different possibilities of drawing different pictures. She then discusses the problem of moving a stack of disks from one peg to the other peg. Later, she demonstrates the basic principle necessary to solve the problem with a child’s toy and goes through how to solve the problem with a program. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com