NOTE: This web site is
out of date.
This is the course web site from a past quarter,
Autumn 2018.
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 http://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.
Sections
-
Are you looking for the list of section leader names and section times?
That information can be found on the Staff/SLs page instead.
-
Week1 Wed 8:00 AM
Week2 Sun 11:59 PM
(do this before at 5pm!)
Section
(Week Wed - Week Fri):
Loading ...
If you want to work on this week's section problems in , here are direct links to each problem:
-
,
,
(sorting)
- (inheritance)
- (linked lists)
- (binary trees)
- (graphs)
Reference Sheet (shows graph terms, methods, and path algorithm pseudocode)
If you want to work on this week's section problems in , here are direct links to each problem:
-
,
,
,
,
,
- DFS (missing)
- BFS (missing)
- Min weight paths (missing)
- Dijkstra and A* (missing)
- Kruskal (missing)
- (a.k.a. isCyclic)
If you want to work on this week's section problems in , here are direct links to each problem:
(Note: CodeStepByStep refers to our TreeNode
structure as "BinaryTreeNode
".
Otherwise the code is the same, but make sure to write BinaryTreeNode
in your solutions if you type them into CodeStepByStep.)
-
,
,
- BST insertion (missing)
Section this week is a midterm review.
There is no section handout; instead we will go over problems from the various practice exams.
If you want to work on this week's section problems in , here are direct links to each problem:
- list nodes before after:
-
-
-
If you want to work on this week's section problems in , here are direct links to each problem:
If you want to work on this week's section problems in , here are direct links to each problem:
If you want to work on this week's section problems in , here are direct links to each problem:
- (strings)
- (Grid)
- (Vector)
- (stacks/queues)
- (stacks/queues)
- (maps; compound collections)
Our sections are 50-minute discussions led by section leaders each week in which the SL and students work together to solve problems.
The complete list of section leaders, their contact information, and the time/place/room of each section can be found on the Staff page of this web site.
Thanks to our TA Kate Rydberg for creating and editing these section handouts,
as well as contributions from past 106 TAs including Ashley Taylor, Amy Xu, Danielle Kain, Reid Watson, Elmer Le, and Megan Faulk.
This document and its content are copyright © Marty Stepp, 2018.
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.