33:29Lecture 11 | Programming Abstractions (Stanford)
From the creator
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: 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/
Published 2008-07-17 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.
Keep exploring Learning
33:29
29:29'must have', 'might have', 'should have' & 'can't have' to talk about the past: Live English Class
BBC Learning English
06:07
47:40
26:06From the PhD Lab: How do biofilms help keep bacteria alive? - with Josh Horton
The Royal Institution
07:47
07:28