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