Computer Science 226 |
Date | Lecture | Chapter(s) |
9/11 | Introduction | 1-5 |
9/16 | Elementary sorts | 6 |
9/18 | Mergesort | 8 |
9/23 | Quicksort | 7 |
9/25 | Priority queues | 9 |
9/30 | Priority queues | 9 |
10/2 | Symbol Table | 12 |
10/7 | Balanced Trees | 13 |
10/9 | Hashing | 14 |
10/14 | Hashing | 14 |
10/16 | Miscellaneous | 15 |
10/21 | Midterm | * |
10/23 | Miscellaneous | * |
11/4 | Digital Search Trees | 15 |
11/6 | Pattern Matching | 20, 21 |
11/11 | Computational Geometry | 26 |
11/13 | Computational Geometry | 27 |
11/18 | Graph Algorithms | 17,18 |
11/20 | Graph Algorithms | 17,18 |
11/25 | Misc: Median Finding | * |
12/2 | Graph Algorithms | 20 |
12/4 | Optimization | 22 |