| Week | Date | Due | Topic | Book Sections | |
| 1 | Tu | Oct 29 | Introduction
Algorithms - Design and Analysis | 1 2 | |
| Th | Oct 31 | ||||
| Fr | Nov 01 | ||||
| 2 | Mo | Nov 04 | Growth of Functions | 3 | |
| Tu | Nov 05 | HW1 | |||
| Th | Nov 07 | ||||
| Fr | Nov 08 | ||||
| 3 | Mo | Nov 11 | Divide and Conquer | 4.1-4.5 | |
| Tu | Nov 12 | HW2
HW2 Solutions | |||
| Th | Nov 14 | ||||
| Fr | Nov 15 |
** EXAM 1 **
Solutions EXAM 1 | |||
| 4 | Mo | Nov 18 | Sorting | 6 7 | |
| Tu | Nov 19 | ||||
| Th | Nov 21 | ||||
| Fr | Nov 22 | HW3
HW3 Solutions | |||
| 5 | Mo | Nov 25 | Dynamic Programming | 15 | |
| Tu | Nov 26 | ||||
| 6 | Mo | Dec 02 |
Dynamic Programming (cont.)
Graph Algorithms | 15 22 | |
| Tu | Dec 03 |
** EXAM 2 **
Solutions EXAM 2 | |||
| Th | Dec 05 | ||||
| Fr | Dec 06 | HW4
HW4 Solutions | |||
| 7 | Mo | Dec 09 | Greedy Algorithms | 16.1-16.3 24.1-24.3 | |
| Tu | Dec 10 | ||||
| Th | Dec 12 | ||||
| Fr | Dec 13 | HW5
HW5 Solutions | |||
| 8 | Mo | Dec 16 | Catch up, Review, and Final Exam | ||
| Tu | Dec 17 |
** EXAM 3 **
Solutions EXAM 3 | |||
| Th | Dec 19 | ||||