| Date |
Recitation |
Topics |
| F 9/1 |
R01 |
Prerequisites |
| F 9/8 |
R02 |
Divide and Conquer |
| F 9/15 |
R03 |
Divide & Conquer and Parallel Algorithms |
| F 9/22 |
R04 |
Parallel Algorithms and Dynamic Programming |
| F 9/29 |
R05 |
Dynamic Programming and Graph Traversal |
| F 10/6 |
R06 |
Graph Traversal II: Breadth-First Search and Shortest Paths I: Dijkstra's Algorithm |
| F 10/13 |
R07 |
Shortest Paths II: A*, Bellman-Ford, Floyd Warshall |
| F 10/20 |
R08 |
Exam Review |
| F 10/27 |
R09 |
Greedy Algorithms |
| F 11/3 |
R10 |
Cuts and Flows |
| F 11/10 |
R11 |
Hardness |
| F 11/17 |
R12 |
Hardness and Approximation |
| F 12/1 |
R13 |
Big Data |
