The reading assignments reference the online textbook at http://www.cs.berkeley.edu/~vazirani/algorithms.html, and may differ from the printed textbook.
| Section 02 Date | Section 03 Date | Topic | Reading Assignment |
|---|---|---|---|
| 1/8 | 1/9 | Getting Started | Chapter 0 and Section 5.3 |
| 1/15 | 1/16 | Sorting Algorithms and Recurrence Formulas | Sections 2.1, 2.2, 2.3, 2.4 |
| 1/22 | 1/23 | Depth-First Search in Graph Structures | Sections 3.1, 3.2, 3.3 |
| 1/29 | 1/30 | Breadth-First Search and Strongly-Connected Components | Sections 3.4, 4.1, 4.2, 4.3 |
| 2/5 | 2/6 | Shortest Paths in Weighted Graphs | Sections 4.4, 4.5, 4.6, 4.7 |
| 2/12 | 2/13 | Greedy Algorithms, Mimimum Spanning Trees, Review for Mid-Term Exam | Section 5.1 |
| 2/19 | 2/20 | Mid-Term Exam on Sorting, Searching, Graph Algorithms and Recurrences | Chapters 0, 2, 3 and 4 |
| Huffman Encoding | Section 5.2 | ||
| 2/26 | 2/27 | Dynamic Programming | Sections 6.1, 6.3, 6.6 |
| 3/12 | 3/13 | Linear Programming | Section 7.1 |
| 3/19 | 3/20 | Network Flows, Simplex Method | Sections 7.2, 7.6 |
| 3/26 | 3/27 | Monte Carlo Methods | The Monte Carlo method |
| 4/2 | 4/3 | Hard Problems | Section 8.1 |
| 4/9 | 4/10 | NP-Completeness | Section 8.2; Handout |
| 4/16 | 4/17 | Coping with NP-Complete and Undecidable Problems, Phase Transitions, Review for Final Exam | Section 9.1; Handout |
| 4/23 | 4/24 | Final Exam | Chapters 5, 6, 7 and 8 |