NOTE: This web site is
out of date.
This is the course web site from a past quarter,
Autumn 2015.
If you are a current student taking the course, this is not your class web site, and you should visit the current class web site instead at
http://cs106b.stanford.edu/.
If you are already at cs106b.stanford.edu, the web page may not be updated yet for the new quarter.
Please be advised that courses change with each new quarter and instructor.
Any information on this out-of-date page may not apply to you this quarter.
Lecture Videos
Julie Zelenski's 2008 offering of CS 106B was recorded by SCPD and put on Youtube.
Though the course has changed somewhat since then, the videos are still useful, so we post them here for you to view.
Please note that the Stanford C++ library has changed somewhat since 2008, so when Julie talks about various library classes or their functions, some of the names or behavior may be different now. We're sorry for the inconvenience. In general the concepts are the same even if a function's name may have changed slightly over the years.
-
-
-
-
- collections start at
-
-
-
-
recursion starts at
-
(pow, isPalindrome, binarySearch, subsets)
-
(fractals, sierpinski, mondrian, towers of Hanoi, permutations)
-
(permutations, subsets, isAnagram, 8 queens)
-
(sudoku, cryptarithmetic)
-
pointers start at
-
-
(done recursively)
-
-
sorting starts at
-
(incl. merge sort, start of quick sort)
-
-
templates start at
-
-
objects start at
-
-
-
-
-
implementing Map starts at
-
-
-
-
-
(not much material here)
-
(guest lecturer: Keith Schwarz)
This document and its content are copyright © Marty Stepp, 2015.
All rights reserved.
Any redistribution, reproduction, transmission, or storage of part or all of the contents in any form is prohibited without the authors' expressed written permission.