![[MSOE Logo]](../graphics/nlogo.png) |
Tentative Schedule Spring 2002 |
| Week | Period | Topics | Reading Assignment | Lab |
|---|---|---|---|---|
| 1 3/4-3/8 |
Lecture 1 | Course introduction | Searching | |
| Lecture 2 | Algorithm Analysis | Pages 3-50. | ||
| 2 3/11-3/15 |
Lecture 1 | Mathematical Toolbox | Pages 51-61, 1058-1069. | |
| Lecture 2 | Recursion and Induction Execution time |
Pages 62-75. | ||
| 3 3/18-3/22 |
Lecture 1 | Sorting -- Heapsort | Pages 123-144. | HW problems Sorting |
| Lecture 2 | Sorting -- Quicksort | Pages 145-164. | ||
| 4 3/25-3/29 |
Lecture 1 | Order Statistics | Pages 183-195. | Good Friday (no lab) |
| Lecture 2 | Lab make-up (Sorting) | |||
| 5 4/1-4/5 |
Lecture 1 | Lab make-up (Sorting) | Delivering | |
| Lecture 2 | Homework/Review | |||
| 6 4/8-4/12 |
Lecture 1 | Midterm Exam | ||
| Lecture 2 | Lab make-up (Delivering) | |||
| 7 4/15-4/19 |
Lecture 1 | Graphs, BFS, DFS | Pages 525-560. | |
| Lecture 2 | More Graphs, Kruskal, Prim, Dijkstra | Pages 561-606. | ||
| 8 4/22-4/26 |
Lecture 1 | Greedy Algorithms | Pages 370-392 | Compressing |
| Lecture 2 | Lab make-up (Compressing) | |||
| 9 4/29-5/3 |
Lecture 1 | Red-Black Trees | Pages 273-301. | |
| Lecture 2 | Spring Fling (no class) | |||
| 10 5/6-5/10 |
Lecture 1 | Dynamic Programming | Pages 323-354. | |
| Lecture 2 | Homework/Review | |||
| 11 5/13-5/17 |
Exam week | Final exam |
