![[MSOE Logo]](../graphics/nlogo.png) |
Tentative Schedule Spring 2000 |
| Week | Period | Topics | Reading Assignment | Lab |
|---|---|---|---|---|
| 1 3/6-3/10 |
Lecture 1 | Course introduction | Electronic submission Prerequisite assessment |
|
| Lecture 2 | Algorithm Analysis | Pages 1-32. | ||
| 2 3/13-3/17 |
Lecture 1 | Mathematical Toolbox | Pages 32-52. | Intro to CSP |
| Lecture 2 | Recursion and Induction Execution time |
Pages 53-64. | ||
| 3 3/20-3/24 |
Lecture 1 | Sorting | Pages 137-139. | Sorting Algorithms |
| Lecture 2 | Sorting -- Heapsort | Pages 140-149. | ||
| 4 3/27-3/31 |
Lecture 1 | Sorting -- Quicksort | Pages 153-171. | |
| Lecture 2 | Order Statistics | Pages 185-194. | ||
| 5 4/3-4/7 |
Lecture 1 | Greedy Algorithms | Pages 329-343 | Huffman Compression |
| Lecture 2 | Midterm Exam | |||
| 6 4/10-4/14 |
Lecture 1 | Midterm exam recovery | ||
| Lecture 2 | Graphs | Pages 86-90. | ||
| 7 4/17-4/21 |
Lecture 1 | Breadth- and Depth-First Search | Pages 463-483. | |
| Lecture 2 | Single-Source Shortest Paths -- Dijkstra's Algorithm | Pages 514-531. | ||
| 8 4/24-4/28 |
Lecture 1 | Minimum Spanning Trees -- Kruskal, Prim | Pages 498-510. | Graphs |
| Lecture 2 | More on Graphs | Pages ?. | ||
| 9 5/1-5/5 |
Lecture 1 | Red-Black Trees | Pages 91-97, 244-277. | |
| Lecture 2 | Lab make-up | |||
| 10 5/8-5/12 |
Lecture 1 | Dynamic Programming | Pages 299-319. | |
| Lecture 2 | Catch-up/Review | |||
| 11 5/15-5/19 |
Exam week | Final exam |
