![[MSOE Logo]](../graphics/nlogo.png) |
Tentative Schedule Spring 2003 |
| Week | Period | Topics | Reading Assignment | Lab |
|---|---|---|---|---|
| 1 3/10-3/14 |
Lecture 1 | Course introduction | Searching | |
| Lecture 2 | Algorithm Analysis | Pages 3-50. | ||
| 2 3/17-3/21 |
Lecture 1 | Mathematical Toolbox | Pages 51-61, 1058-1069. | |
| Lecture 2 | Recursion and Induction Execution time |
Pages 62-75. | ||
| 3 3/24-3/28 |
Lecture 1 | Review/Catch-up | Homework | |
| Lecture 2 | Sorting -- Heapsort | Pages 123-144. | ||
| 4 3/31-4/4 |
Lecture 1 | Sorting -- Quicksort | Pages 145-164. | Sorting |
| Lecture 2 | Order Statistics | Pages 183-195. | ||
| 5 4/7-4/11 |
Lecture 1 | Homework/Review | ||
| Lecture 2 | Midterm Exam | |||
| 6 4/14-4/18 |
Lecture 1 | Graphs, BFS, DFS | Pages 525-560. | Delivering (optional) |
| Lecture 2 | More Graphs, Kruskal, Prim, Dijkstra | Pages 561-606. | ||
| 7 4/21-4/25 |
Lecture 1 | Homework | ||
| Lecture 2 | Graph applications | |||
| 8 4/28-5/2 |
Lecture 1 | Greedy Algorithms | Pages 370-392 | |
| Lecture 2 | Dynamic Programming | Pages 323-354. | ||
| 9 5/5-5/9 |
Lecture 1 | Homework | Compression | |
| Lecture 2 | Dynamic Programming applications | |||
| 10 5/12-5/16 |
Lecture 1 | Red-Black Trees | Pages 273-301. | |
| Lecture 2 | Homework/Review | |||
| 11 5/19-5/23 |
Exam week | Final exam |
