| Week | Date | Due | Topic | Book Sections | |
| 1 | Tu | Mar 11 | Introduction
Representative Problems | 1.1-1.2 | |
| Th | Mar 13 | ||||
| Fr | Mar 14 | ||||
| 2 | Mo | Mar 17 | Algorithm Analysis
Computational Tractability Asymptotic Order of Growth | 2.1-2.5 | |
| Tu | Mar 18 | HW1 | |||
| Th | Mar 20 | ||||
| Fr | Mar 21 | ||||
| 3 | Mo | Mar 24 | Graph Algorithms | 3.1-3.6 | |
| Tu | Mar 25 | HW2
Solutions | |||
| Th | Mar 27 | ||||
| Fr | Mar 28 | Exam 1
Solutions | |||
| 4 | Mo | Mar 31 | Greedy Algorithms | 4.1-4.8 | |
| Tu | Apr 01 | HW3
Solutions | |||
| Th | Apr 03 | ||||
| Fr | Apr 04 | ||||
| 5 | Mo | Apr 07 | Divide and Conquer | 5.1-5.6 | |
| Tu | Apr 08 | HW4
Solutions | |||
| Th | Apr 10 | ||||
| Fr | Apr 11 | Exam 2
Solutions | |||
| 6 | Mo | Apr 14 | Dynamic Programming | 6.1-6.9 | |
| Tu | Apr 15 |
NO CLASS | |||
| Th | Apr 17 | ||||
| Fr | Apr 18 | HW5
Solutions | |||
| 7 | Mo | Apr 21 |
Catch up
Heuristic Algorithms | ||
| Tu | Apr 22 | HW6
Solutions | |||
| Th | Apr 24 | ||||
| Fr | Apr 25 | ||||
| 8 | Mo | Apr 28 | Exam 3
Solutions | Exam Solutions | |
| Tu | Apr 29 | ||||