Overview
The complete set of lectures slides for the term are here. Please bring the pages listed under each week to lecture. We will try to stick to the following schedule:
| Week | Topic | Pages | Comments |
|---|---|---|---|
| 1 | Dictionaries, 2-3-4 Trees | 1-39 Notes | |
| 2 | 2-3-4 Trees, Augmented Data Structures | 18-39 | |
| 3 | Introduction to Graph Theory | 33-47 | |
| 4 | Graph Search Algorithms | 46-57 | Please download the latest on DFS -- the pages have been updated. |
| 5 | Priority Queues and Prims Algorithm | 57-70 | |
| 6 | Heaps for implementing Priority Queues | 68-78 | |
| 7 | Disjoint Sets and Kruskal's Algorithm | 78-96 | |
| 8 | Amortized Analysis | 97-111 | |
| 9 | Average Case Analysis | 112-132 | |
| 10 | Direct Addresing (Hashing) | ||
| 11 | Hashing -- Open Addressing | 133-143 | |
| 12 | Extensible and Incremental Hashing | See assignment handout | |
| 13 | Exam Review | Exam Details |