All chapters refer to the course textbook.
Some of the linked web pages use a JavaScript library to give a menued presentation format to the information. This library does not work at all with Microsoft Internet Explorer. It works without limitation in Firefox, Chrome, Chromium, and Safari.
| Date | Readings and Topics | Due | |
|---|---|---|---|
| Wed | Sep 7 | Course introduction, Ch. 1, 7.1, Quicksort | |
| Th(L) | Sep 8 | Start PA1 | |
| Fri | Sep 9 | 7.2, Classification of Abstract Data Types, Program Conditions | |
| Mon | Sep 12 | 22.1, 22.2, Graph searches and Graph Algorithms, Tracing Graph Searches | |
| Wed | Sep 14 | 22.3 | |
| Th(L) | Sep 15 | Start PA2, HW1 | PA1 |
| Fri | Sep 16 | 23.1, 23.2 (minimum spanning trees) | |
| Mon | Sep 19 | 24.1, 24.2 (single-source shortest paths) | |
| Wed | Sep 21 | 24.3, The Visitor Design Pattern | |
| Th(L) | Sep 22 | Start HW2, work on PA2 | HW1 |
| Fri | Sep 23 | Graph Search Invariants | |
| Mon | Sep 26 | 25.1, 25.2, The All-Pairs Shortest Paths Problem | |
| Wed | Sep 28 | 26.1, The Maximum Flow Problem | |
| Th(L) | Sep 29 | Start PA3, HW3 | PA2, HW2 |
| Fri | Sep 30 | 26.1, 26.2 | |
| Mon | Oct 3 | 26.2, 26.3 | |
| Wed | Oct 5 | 26.3 | |
| Th(L) | Oct 6 | Work on PA3, discussion | HW3 |
| Fri | Oct 7 | Review | |
| Mon | Oct 10 | Midterm exam | |
| Wed | Oct 12 | 2.1, 2.2 (algorithm design), Run Times | |
| Th(L) | Oct 13 | Start HW4 | PA3 |
| Fri | Oct 14 | 2.3 | |
| Mon | Oct 17 | 3.1, 3.2 (run time analysis) | |
| Wed | Oct 19 | 17.1-17.3 (amortized run times) | |
| Th(L) | Oct 20 | Start HW5, PA4 | HW4 |
| Fri | Oct 21 | 12.1-12.3 (binary search trees) | |
| Mon | Oct 24 | 13.1, 13.2 (red-black trees) | |
| Wed | Oct 26 | 13.3 | |
| Th(L) | Oct 27 | Start PA5, HW6 | PA4, HW5 |
| Fri | Oct 28 | 13.4 | |
| Mon | Oct 31 | 14.1, 14.2 (augmenting data structures) | |
| Wed | Nov 2 | 6.1-6.3 (priority queues) | |
| Th(L) | Nov 3 | Work on PA5 | HW6 |
| Fri | Nov 4 | 19.1, 19.2 (Fibonacci heaps) | |
| Mon | Nov 7 | 19.3 | |
| Wed | Nov 9 | Binomial heaps | |
| Th(L) | Nov 10 | Start PA6, HW7, discussion | PA5 |
| Fri | Nov 11 | Review | |
| Mon | Nov 14 | Midterm exam | |
| Wed | Nov 16 | 15.1 (dynamic programming) | |
| Th(L) | Nov 17 | Start PA7, HW 8 | PA6, HW7 |
| Fri | Nov 18 | 15.2, 15.3 | |
| Mon | Nov 21 | 15.4, 15.5 | |
| Wed | Nov 23 | 16.1, 16.2 (greedy algorithms) | |
| Th(L) | Nov 24 | Holiday | |
| Fri | Nov 25 | Holiday | |
| Mon | Nov 28 | 16.3 | |
| Wed | Nov 31 | 32.1, 32.2, A Knuth-Morris-Pratt String Matcher | |
| Th(L) | Dec 1 | Start PA8, HW 9 | PA7, HW 8 |
| Fri | Dec 2 | 33.1, 33.2 (computational geometry) | |
| Mon | Dec 5 | 33.3, 33.4 | |
| Wed | Dec 7 | 34.1, 34.2 (NP-completeness) | |
| Th(L) | Dec 8 | Start HW10, work on PA8 | HW 9 |
| Fri | Dec 9 | 34.3, 34.5 | |
| Mon | Dec 12 | 35.1, 35.2 (approximation algorithms) | |
| Wed | Dec 14 | 35.3 | |
| Th(L) | Dec 15 | PA8, HW10 | |
| Fri | Dec 16 | Review, Final Exam Review Questions | |
| Tue | Dec 20 | Final Exam, 1200-1355 | |