| Lec. |
Date |
Day |
Topic |
Notes |
| 1 |
Sep 1 |
T |
Introduction, Karatsuba/Strassen |
HW1 out |
| 2 |
Sep 3 |
Th |
Asymptotic analysis, recurrences
|
|
| 3 |
Sep 8 |
T |
Probabilistic analysis, randomized quicksort |
|
| 4 |
Sep 10 |
Th |
Linear time selection/median |
HW1 due, HW2 out |
| 5 |
Sep 15 |
T |
Sorting: O(n) algorithms and Ω(n log n) lower bound |
|
| 6 |
Sep 17 |
Th |
Balanced Search Trees |
|
| 7 |
Sep 22 |
T |
Amortized Analysis |
HW2 due, HW3 out |
| 8 |
Sep 24 |
Th |
Heaps |
|
| 9 |
Sep 29 |
T |
Union-Find |
|
| 10 |
Oct 1 |
Th |
Universal and Perfect Hashing |
HW3 due, HW4 out |
| 11 |
Oct 6 |
T |
Dynamic Programming I |
|
| 12 |
Oct 8 |
Th |
Dynamic Programming II |
|
| 13 |
Oct 13 |
T |
BFS, DFS, topological sort, strongly-connected components |
HW4 due, HW5 out |
| 14 |
Oct 15 |
Th |
Single-Source Shortest Paths |
|
| 15 |
Oct 20 |
T |
All-Pairs Shortest Paths |
HW5 due, HW6 out |
|
Oct 22 |
Th |
No Class: Fall Break
|
|
| 16 |
Oct 27 |
T |
Minimum Spanning Trees |
|
| 17 |
Oct 29 |
Th |
Matroids and Greedy Algorithms |
HW6 due, HW7 out |
| 18 |
Nov 3 |
T |
Max-Flow Min-Cut |
|
| 19 |
Nov 5 |
Th |
Max-Flow: Edmonds-Karp |
|
| 20 |
Nov 10 |
T |
Linear Programming |
HW7 due, HW8 out |
| 21 |
Nov 12 |
Th |
NP-Completeness I |
|
| 22 |
Nov 17 |
T |
NP-Completeness II |
|
| 23 |
Nov 19 |
Th |
Approximation Algorithms |
HW8 due, HW9 out |
|
Nov 24 |
T |
No Class: Thanksgiving break |
|
|
Nov 26 |
Th |
No Class: Thanksgiving break |
|
| 24 |
Dec 1 |
T |
Online Algorithms |
|
| 25 |
Dec 3 |
Th |
Machine Learning Theory |
|
| 26 |
Dec 8 |
T |
Algorithmic Game Theory |
HW9 due |
|
Dec 14 |
M |
Final Exam
|
|