![]() |
Tentative Schedule
|
| Week | Period | Topics | Reading | Lab |
|---|---|---|---|---|
| 1 9/6-9/10 |
Lecture 1 | Course Introduction | Searching | |
| Lecture 2 | Algorithm Analysis | 3-50 | ||
| Lecture 3 | Mathematical Toolbox | 51-61, 1058-1069 | ||
| 2 9/13-9/17 |
Lecture 1 | Examples | ||
| Lecture 2 | Recursion and Induction Execution time |
62-75 | ||
| Lecture 3 | Examples | |||
| 3 9/20-9/24 |
Lecture 1 | Sorting -- Heapsort | 123-144 | Sorting |
| Lecture 2 | Sorting -- Quicksort | 145-164 | ||
| Lecture 3 | Sorting -- Misc. | ?165-182? | ||
| 4 9/27-10/1 |
Lecture 1 | Examples | ||
| Lecture 2 | Order Statistics | 183-195 | ||
| Lecture 3 | Review | |||
| 5 10/4-10/8 |
Lecture 1 | Midterm Exam | ||
| Lecture 2 | Graphs, BFS, DFS | 525-560 | ||
| Lecture 3 | Kruskal, Prim, Dijkstra | 561-606 | ||
| 6 10/11-10/15 |
Lecture 1 | Examples | Routing | |
| Lecture 2 | Graph Applications | |||
| Lecture 3 | Dynamic Programming | 323-354 | ||
| 7 10/18-10/22 |
Lecture 1 | Dynamic Programming applications | ||
| Lecture 2 | Work on Routing lab | |||
| Lecture 3 | Work on Routing lab | |||
| 8 10/25-10/29 |
Lecture 1 | Greedy Algorithms | 370-392 | |
| Lecture 2 | Examples | |||
| Lecture 3 | Work on Compressing lab | |||
| 9 11/1-11/5 |
Lecture 1 | Routing Presentations | Compressing | |
| Lecture 2 | NP Complete | 966-983 | ||
| Lecture 3 | NP Complete cont... | 984-994 | ||
| 10 11/8-11/12 |
Lecture 1 | Examples | 1003-1018 | |
| Lecture 2 | Work on Compressing lab | |||
| Lecture 3 | Review | |||
| 11 11/15-11/19 |
TBA |
| © 2001-2006 Dr. Christopher C. Taylor | Office: CC-36C | Phone: 277-7339 |