| Previous Month | Back to 6.046 Homepage | Next Month |
| April 2001 | ||||||
|---|---|---|---|---|---|---|
| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
1 |
2 |
3L13 Dynamic programming: optimal binary search trees, longest common subsequence.Reading: Chapter 16. |
4 |
5L14 Greedy algorithms: minimum-spanning trees, Prim's and Kruskal's algorithms.Reading: Chapters 22 and 24. PS5 out. |
6R7 Examples of greedy algorithms and dynamic programming.Reading: Chapters 16, 22, and 24. |
7 |
8 |
9 |
10L15 Graph algorithms: depth-first search, topological sort, strongly-connected components.Reading: Sections 23.3-5. |
11 |
12L16 Graph algorithms: single-source shortest paths, Dijkstra's algorithm, Bellman-Ford algorithm.Reading: Sections 25.1-3. PS5 due. |
13R8 Graph algorithms.Reading: Chapters 23-26 |
14 |
15 |
16 |
17Patriots Day Holiday |
18 |
19L17 Network flow: max-flow min-cut, Ford-Fulkerson algorithm, augmenting paths.Reading: Sections 27.1-3. |
20R9 Bipartite matchingReading: Section 27.3. |
21 |
22 |
23Quiz 2 (Take Home) Out |
24No lecture! |
25 |
26L18 Randomized Algorithms.Quiz 2 Due |
27No recitation. |
28 |
29 |
30 |
|||||