| Dates | Required | Recommended |
| Week 13 (12/3-12/7) | Sections 7.5, 7.12 - Bipartite matching, Baseball elimination | Anything in 7.8-7.10 that looks interesting. |
| Week 12 (11/26-11/30) | Sections 7.0-7.2 - Network Flow | |
| Week 10 (11/12-11/16) | Section 6.4 - Knapsack problem | Cormen, Leiserson, Rivest (QA76.6.C662 in Science Lib): Section 16.3 - Longest common subsequence Section 16.1 - Matrix chain multiplication |
| Week 9 (11/5-11/9) | Section 5.4 - MSTs Sections 6.0 - 6.2 - Dynamic programming |
|
| Week 7 (10/15-10/19) | Chapter 4 (Intro through 4.2) - Greedy algorithms | |
| Week 6 (10/8-10/12) | Section 3.6 - Topological sort eReserve: Dasgupta, et al - Graph decomposition |
|
| Week 5 (10/1-10/5) | Section 3.1 - Graph representations This is again a somewhat leisurely presentation, and we are not likely to get to this material before Friday. |
|
| Week 4 (9/24-9/28) | Chapter 5 (Introductory paragraphs) Section 5.4 - Closest Pair of Points problem |
Any other section in Chapter 5 that looks interesting! |
| Week 3 (9/17-9/21) | eReserve: Weiss - AVL Trees eReserve: Azmoodeh - B-Trees |
|
| Week 2 (9/10-9/14) | eReserve:
Cormen, et. al - Quicksort eReserve: Levitin (section 11.2) - Lower Bound on Sorting |
Section 11.1 of Levitin chapter - (An introduction to
lower-bound arguments.) **Be sure to keep your Levitin article. We will read more from it later. |
| Week 1 (8/31-9/7) | Chapter 1 (A nice intro to the study of
algorithms.) Section 2.2 - Asymptotic Analysis |
Sections 2.1 & 2.4 (A leisurely description of some concepts
underlying asymptotic analysis.) Section 2.5 (If you would like a refresher on heaps.) |