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:
http://www.youtube.com/view_play_list?p=FE6E58F856038C69

CS 106B Course Website:
http://cs106b.stanford.edu

Stanford Center for Professional Development:
http://scpd.stanford.edu/

Stanford University:
http://www.stanford.edu/

Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/

Category:

Education

Tags:

• computer
• science
• technology
• software
• engineering
• c++
• programming
• language
• lecture
• recursion
• recursive
• call
• procedural
• fractal
• mandarin
• tower
• permutations

[awathmoon]

Thank you for making these lectures available they are a gold mine for people teaching themselves programming. Excellent!

[dimipeli]

Reminds me of SICP

[henrycao0828]

much better than Eric Robert's 106B lecture

[agapitoflores001]

Cool.. I like it so much.. Excellent job uploader.

[tfityo]

tower code is amazing

[pagola]

what a wonderful blessing

[itsRAWRtime007]

11:26 she uses blackboard woohoo