Tue 8/26 | 1: NP Completeness I (slides/h/n) |
Thu 8/28 | 2: NP Completeness II (slides/h/n) |
Tue 9/2 | 3: NP Completeness III (slides/h/n) |
Thu 9/4 | 4: See above class notes. (slides/h/n) |
Tue 9/9 | 5: Dynamic Programming (slides/h/n) |
Thu 9/11 | 6: Even MORE Dynamic Programming (slides/h/n) |
Tue 9/16 | 7: Approximation algorithms: Part I, Part II (slides/h/n) |
Thu 9/18 | 8: Approximation algorithms: Part III (slides/h/n) |
Tue 9/23 | 9: Randomized Algorithms I (slides/h/n) |
Thu 9/25 | 10: Randomized Algorithms II (slides/h/n) |
Tue 9/30 | 11: Network Flow I (slides/h/n) |
Thu 10/2 | 12: Network Flow II (slides/h/n) |
Tue 10/7 | Midterm - 7:00pm - 9:20pm SC 216 |
Thu 10/9 | 13: Network Flow III (slides/ h/ n) |
Tue 10/14 | 14: Network Flow IV (slides/ h/ n) |
Thu 10/16 | 15: Rand Alg III - Min Cut (slides/ h/ n) |
Friday 10/17 | Maybe Drop deadline [To be verified.] |
Tue 10/21 | 16: Linear programming (slides/ h/ n) |
Thu 10/23 | 17: LP II (slides/ h/ n) |
Tue 10/28 | 18: LP III (slides/ h/ n) |
Thu 10/30 | 19: Fast Fourier Transform (slides/ h/ n) |
Tue 11/4 | 20: Sorting Network (slides/ h/ n) |
Thu 11/6 | 21: Union find (slides/ h/ n) |
Tue 11/11 | 22: Entropy (slides/ h/ n) |
Thu 11/13 | 23: Entropy II (slides/ h/ n) |
Tue 11/18 | 24: Entropy III, Shannon's theorem (slides/ h/ n) |
Thu 11/20 | 25: Max cut (slides/ h/ n) |
Tue 11/25 | Thanksgiving Vacation |
Thu 11/27 | Thanksgiving Vacation |
Tue 12/2 | 26: Lower bounds (slides/ h/ n) |
Thu 12/4 | 27: Backward analysis (slides/ h/ n) |
Tue 12/10 | 28: More on backward analysis (slides/ h/ n) |
Tuesday 12/16 | Final: 7-10pm, Location:
SC 0216. Proof. |