Lecture 9 | Programming Abstractions (Stanford)
- Title:
- Lecture 9 | Programming Abstractions (Stanford)
- Description:
-
more » « less
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:
http://www.youtube.com/view_play_list?p=FE6E58F856038C69CS 106B Course Website:
http://cs106b.stanford.eduStanford Center for Professional Development:
http://scpd.stanford.edu/Stanford University:
http://www.stanford.edu/Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/ - Video Language:
- English
- Duration:
- 48:04
N. Ueda edited English subtitles for Lecture 9 | Programming Abstractions (Stanford) | ||
Eunjeong_Kim added a translation | ||
Eunjeong_Kim added a video: Lecture 9 | Programming Abstractions (Stanford) |