| Module Num | Module Name | Slides | CLRS Chapters |
|---|---|---|---|
| 0 | Course Introduction | Course Introduction | - |
| 0 | Review | Review | - |
| 1 | 01 - Graphs Introduction | Graphs Intro and BFS | |
| DFS, Topological Sort, SCCs | |||
| Dijkstra and Prim | |||
| Kruskal’s | |||
| 2 | 02 - Divide and Conquer | Div. Con. Intro | |
| Recurrence Relations | |||
| Kartsuba Multiplication | |||
| Closest Pair of Points | |||
| Quickselect | |||
| 3 | 03 - Greedy | Greedy Intro, Change | |
| Activity Selection | |||
| Bridge Crossing | |||
| Knapsack Problems | |||
| Dividing Resources | |||
| 4 | 04 - Dynamic Programming | Intro, log cutting | |
| Activity Selection | |||
| Coint Change | |||
| DPKnapsack | |||
| Sequences | |||
| Seam Carving |