W Aug 30 | Introduction, skim [CLRS] Chap 2, read Appendix A |
F Sep 01 | Asymptotic Notations, read lecture notes |
M Sep 04 | Asymptotic Notations, Lower Bounds, read [CLRS] Chapter 8.1 |
W Sep 06 | Lower Bounds, read [CLRS] Chapter 9.1, slides |
F Sep 08 | Lower Bounds, Divide and Conquer |
M Sep 11 | Divide and Conquer, Strassen Matrix Multiplication |
W Sep 13 | Divide and Conquer, FFT |
F Sep 15 | Divide and Conquer, FFT |
F Sep 15 | Optional Review: Fast Fourier Transform, Part I |
F Sep 15 | Optional Review: Fast Fourier Transform, Part II |
M Sep 18 | Greedy Algorithms |
W Sep 20 | Greedy Algorithms |
F Sep 22 | Greedy Algorithms |
M Sep 25 | Dynamic Programming |
W Sep 27 | Dynamic Programming |
F Sep 29 | Dynamic Programming, Quiz on Greedy Algorithms and Matroids |
M Oct 02 | Amortized Analysis |
W Oct 04 | Amortized Analysis |
F Oct 06 | Amortized Analysis, Quiz on Dynamic Programming |
M Oct 09 | Review |
W Oct 11 | Midterm Exam |
F Oct 13 | Graph Algorithms |
M Oct 16 | Midterm Exam Review, Graph Algorithms |
W Oct 18 | Graph Algorithms |
F Oct 20 | Graph Algorithms, Quiz on Graph Algorithms |
M Oct 23 | Randomized Algorithms |
W Oct 25 | Randomized Algorithms |
F Oct 27 | Randomized Algorithms |
M Oct | Randomized Algorithms |
W Nov 01 | Randomized Algorithms |
F Nov 03 | Computational Complexity |
M Nov 06 | Computational Complexity |
W Nov 08 | Computational Complexity |
F Nov 10 | Computational Complexity |
M Nov 13 | Computational Complexity |
W Nov 15 | Computational Complexity |
F Nov 17 | Approximation Algorithms |
M Nov 20 | Approximation Algorithms, Undecidability |
W Nov 22 | No class - University closed |
F Nov 24 | No class - University closed |
M Nov 27 | Undecidability, Quiz on Computational Complexity |
W Nov 29 | Algorithmic Problems |
F Dec 01 | Algorithmic Problems |
M Dec 04 | Algorithmic Problems |
W Dec 06 | Review |