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