| Mon Jan 7 | Course Overview | ppt | ||
| Wed Jan 9 | Analysis of Algorithms, part I | ppt | ||
| Fri Jan 11 | Analysis of Algorithms, part II | ppt | Homework 1 Distributed | |
| Mon Jan 14 | Analysis of Algorithms, part III | ppt | ||
| Wed Jan 16 | Analysis of Algorithms, part III (cont) | |||
| Fri Jan 18 | Trees | ppt | Homework 2 and 3 distributed | |
| Mon Jan 21 | No Class | |||
| Wed Jan 23 | Binary Search Trees | ppt | ||
| Fri Jan 25 | AVL Trees | ppt | ||
| Mon Jan 28 | Splay Trees | ppt | ||
| Wed Jan 30 | B-Trees | ppt | ||
| Fri Feb 1 | Hash Tables | ppt | Homework 4 Distributed | |
| Mon Feb 4 | Hash Tables II | ppt | ||
| Wed Feb 6 | Priority Queues & Binary Heaps | ppt | ||
| Fri Feb 8 | MIDTERM! | |||
| Mon Feb 11 | Sorting | ppt | Homework 5 distributed | |
| Wed Feb 13 | Sorting | ppt | ||
| Thurs Feb 14 | Quiz Section Discussion | doc | Midterm Solutions distributed | |
| Fri Feb 15 | Disjoint Union Find | ppt | Homework 6 Distributed | |
| Mon Feb 18 | Holiday | |||
| Wed Feb 20 | Graphs and DFS/BFS Search | ppt | ||
| Wed Feb 20 | Lecture Cancelled | |||
| Mon Feb 25 | Graph Heuristic Search Methods | ppt | Homework 7 Distributed | |
| Wed Feb 27 | More Fun with Graphs | ppt | ||
|
Graph Search Demos: Dijkstra's Algorithm BFS/DFS Another DFS demo |
||||
| Thurs Feb 28 | Maze Running Examples: | |||
| DFS: | ppt | htm | ||
| BFS: | ppt | htm | ||
| IDFS: | ppt | htm | ||
| BestFirst: | ppt | htm | ||
| A* : | ppt | htm | ||
| Fri Mar 1 | More Fun with Graphs -- continued | |||
| Mon Mar 4 | NP-Completeness | ppt | ||
| Wed Mar 6 | Quad Trees | ppt | ||
| Fri Mar 8 | Binomial Queues | ppt | Homework 8 Distributed | |
| Mon Mar 11 | Randomized Data Structures | ppt | ||
| Wed Mar 13 | Odds 'n' Ends | ppt | ||
| Fri Mar 15 | PARTY! | |||
| Mon Mar 18 | FINAL EXAM: EE1 037 2:30-4:20 Bring a calculator, pencils, and up to one sheet of notes (two-sided). |
|||