CS141 BB: ClassS04CS141/PreviousWeeks

Week 1:
- 03/29 - review of worst-case analysis of algorthms [slides]
- 03/31 - /Notes 03 31, GeometricSums, GrowableArray
- 04/02 - UnionFind
- Read Chapter 1 (sections 1.3.4 and 1.5 may be new, don't worry), scan chapters 2-4.
Week 2:
- 04/05 - /Notes 04 05 (C++: copy constructors, assignment=, const. AssocList? class.)
- 04/07 - RecurrenceRelations, introduction.
- 04/09 - Solving RecurrenceRelations .
Week 3:
- 04/12 - Graphs, DepthFirstSearch and BreadthFirstSearch .
- 04/14 - BreadthFirstSearch, CutVerticesByDFS .
- 04/16 - Discussed /Prog1 . Continued with CutVerticesByDFS .

Week 4:
- 04/19 - Finished CutVerticesByDFS .
- 04/21 - DiGraphs, DFSinDiGraphs?, CyclesByDFS .
- 04/23 - Tutorial on Debugging.

Week 5:
- 04/26 - TopologicalSortByDFS, CountingPathsByDP
- 04/28 - CountingPathsByDP, careful proof, adjacency lists and adjacency matrices
- 04/30 - FibonacciByDP, NChooseKByDP