This schedule is tentative and may change.
| Date | Topic | Materials |
|---|---|---|
| October 14 | Course Introduction, Algorithms, Growth Functions, and Computational Complexity | |
| October 16 | Divide and Conquer Algorithms | |
| October 21 | Master Theorem and Heapsort | |
| October 28 | Quicksort, Sorting in Linear Time, Order Statistics | |
| October 30 | Hash Maps and Binary Trees, Quiz 2 | |
| November 4 | Red-Black Trees, AVL Trees, Dynamic Programming | |
| November 6 | Dynamic Programming | |
| November 11 | Exam 1 |
|
| November 13 | Greedy Algorithms, Intro. to Graphs | |
| November 18 | DFS, Topological Sort, Minimum Spanning Trees | |
| November 20 | Shortest Paths, Quiz 3 | |
| November 25 | Maximum Flow | |
| December 2 | Intractability, NP-Completeness | |
| December 4 | Parallel Algorithms, Machine Learning, Quiz 4 | |
| December 9 | Final Exam |
|