| Dates | Required | Recommended |
| Week 14 (12/8-12/12) |
Sections 7.5, 7.12 - Bipartite matching problem, Baseball elimination problem | Anything in 7.8-7.10 that looks interesting. |
| Week 12 (11/24-11/26) |
Sections 7.0-7.2 - Network Flow (for Wednesday) | Cormen, Leiserson, Rivest (QA76.6.C662 in Science Lib): Section 16.1 - Matrix chain multiplication (for Monday) |
| Week 11 (11/17-11/21) |
Section 6.4 - Knapsack problem (for Friday) | Cormen, Leiserson, Rivest (QA76.6.C662 in Science Lib): Section 16.3 - Longest common subsequence (for Monday) |
| Week 10 (11/10-11/14) |
Sections 6.0-6.2 - Dynamic programming | Section 4.8 - Huffman Encoding - a greedy lossless compression algorithm |
| Week 9 (11/3-11/7) |
Section 4.5 - Min spanning tree problem | |
| Week 8 (10/27-10/31) |
Chapter 4 (Intro through 4.2) - Greedy algorithms | |
| Week 7 (10/3-10/17) |
Chapter 5 (Introductory paragraphs) Section 5.4 - Closest Pair of Points problem |
Any other section in Chapter 5 that looks interesting! |
| Week 6 (10/6-10/10) |
Section 3.6 - Topological sort | eReserve: Dasgupta, et al - Graph decomposition (including
DFS) |
| Week 5 (9/29-10/3) |
Section 3.1 (Kleinberg & Tardos) - Graph representations |
|
| Week 4 (9/22-9/26) |
eReserve: Azmoodeh - B-Trees | |
| Week 3 (9/15-9/19) |
eReserve: Levitin (section 11.2) - Lower Bound on
Sorting eReserve: Weiss - AVL Trees |
Section 11.1 of Levitin chapter - (An introduction to lower-bound arguments.) |
| Week 2 (9/8-9/12) |
eReserve:
Cormen, et. al - Quicksort see link above for access to eReserve | |
| Week 1 (Sept 1-5) |
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.) |