ClassS04CS141/Syllabus

Syllabus (reverse chronological order)

• week of 05/31 - /Review

• week of 05/24 - /MinimumSpanningTreeExercises

• 05/21 - /MinimumSpanningTreeExercises
• 05/19 - MinimumSpanningTreesByKruskals
• 05/17 - ShortestPathsByDijkstras, ShortestPathsByDP

• 05/14 - ShortestPathsByDijkstras
• 05/12 - DynamicProgramming (overview)
• 05/10 - MinWtTriangulationByDP

• 05/07 - /MidTerm
• 05/05 - review of /Topics
• 05/03 - SubsetSumByDP

• 04/30 - FibonacciByDP, NChooseKByDP
• 04/28 - CountingPathsByDP (careful proof). adjacency lists and adjacency matrices
• 04/26 - TopologicalSortByDFS, CountingPathsByDP

• 04/23 - Debugging
• 04/21 - DiGraphs, DFSInDiGraphs, CyclesByDFS
• 04/19 - CutVerticesByDFS

• 04/16 - CutVerticesByDFS
• 04/14 - BreadthFirstSearch, CutVerticesByDFS
• 04/12 - Graphs, DepthFirstSearch, BreadthFirstSearch

• 04/09 - RecurrenceRelations
• 04/07 - RecurrenceRelations
• 04/05 - CPlusPlusDocs

• 04/02 - UnionFind
• 03/31 - GeometricSums, GrowableArray
• 03/29 - review of worst-case analysis of algorthms [slides]