T Jan 15 | Introduction, review Chapter 3 and Appendix A |
R Jan 17 | Lower Bounds, Chapter 8.1 and slides |
T Jan 22 | Lower Bounds, Chapter 8.1 and slides |
R Jan 24 | Divide and Conquer, Chapter 4 |
T Jan 29 | Divide and Conquer, Chapter 30 |
R Jan 31 | Divide and Conquer, Quiz |
T Feb 05 | Greedy Algorithms, Chapter 16 |
R Feb 07 | Greedy Algorithms, Chapter 16 |
T Feb 12 | Dynamic Programming, Review, Chapter 15 |
R Feb 14 | Midterm 1 |
T Feb 19 | Midterm 1 solution, Dynamic Programming |
R Feb 21 | Amortized Analysis |
T Feb 26 | Amortized Analysis |
R Feb 28 | Graph Algorithms, BFS |
T Mar 05 | Graph Algorithms, DFS, Topological Sorting |
R Mar 07 | Strongly Connected Components |
T Mar 12 | Spring Break |
R Mar 14 | Spring Break |
T Mar 19 | Graph Algorithms, Randomized Algorithms |
R Mar 21 | Randomized Algorithms, Quiz on Graph Algorithms |
T Mar 26 | Randomized Algorithms, Review |
R Mar 28 | Midterm exam 2 |
T Apr 02 | Randomized Algorithms |
R Apr 04 | Randomized Algorithms |
T Apr 09 | Complexity Theory, Quiz on Randomized Algorithms |
R Apr 11 | Complexity Theory |
T Apr 16 | Complexity Theory |
R Apr 18 | Complexity Theory, Quiz |
T Apr 23 | Computability |
R Apr 25 | Review |