This schedule is tentative and may change.
| Date | Topic | Materials |
|---|---|---|
| March 18 | Course Introduction, Algorithms, Growth Functions, and Computational Complexity | |
| March 20 | Divide and Conquer Algorithms | |
| March 25 | Master Theorem and Heapsort | |
| March 27 | Quicksort, Sorting in Linear Time, Quiz 1 | |
| April 1 | Medians and Order Statistics, Hash Tables | |
| April 3 | Binary Search Trees and Red-Black Trees, Checkpoint 1 | |
| April 8 | Dynamic Programming | |
| April 10 | Greedy Algorithms, Quiz 2 | |
| April 15 | Greedy Algorithms, Exam 1 | |
| April 17 | BFS, DFS, and Topological Sort | |
| April 22 | Minimum Spanning Trees, Shortest Path Algorithms | |
| April 24 | All-Pairs Shortest Path, Quiz 3 | |
| April 29 | Maximum Flow, Parallel Algorithms | |
| May 1 | Parallel Algorithms, Intractability, Quiz 4 | |
| May 6 | Machine Learning Algorithms, Exam 2 |
|