Mon Apr 1 | Intro | hw1 and sorts out | |
Wed Apr 3 | Analysis | ||
Fri Apr 5 | Analysis and Sorting | ||
Mon Apr 8 | More Sorting | hw1 due in class | |
Wed Apr 10 | More Sorting (part 2) | hw2 out | |
Fri Apr 12 | More Sorting. | sorts due at 5:30PM | |
Mon Apr 15 | BSTs | ||
Wed Apr 17 | AVL Trees | avl and hw3 out | |
Fri Apr 19 | More AVL fun. | hw2 due | |
Mon Apr 22 | 2-3 and B Trees | ||
Wed Apr 24 | Splay Trees | ||
Fri Apr 26 | Sorting Lower Bound | hw3 due | |
Mon Apr 29 | Hashing I |
Wed May 1 | More Hashing | freq out | |
Fri May 3 | Hashing Yet Again | avl due | |
Mon May 6 | Finished with hashing? Never! | ||
Wed May 8 | Priority Queues: Heaps | ||
Fri May 10 | Midterm (in class) | ||
Mon May 13 | Finish Priority Queues | ||
Wed May 15 | Disjoint Set | ||
Fri May 17 | Graphs | ||
Mon May 20 | More Graphs; Dijkstra's Algorithm | freq due | |
Wed May 22 | Shortest Paths and MSTs | ||
Fri May 24 | MSTs, DFS and Biconnectivity | hw4 due in class | |
Mon May 27 | Memorial Day--no class | ||
Wed May 29 | |||
Fri May 31 | Slides from the DiGraph Lecture |
Mon June 3 | String Compression | ||
Wed June 5 | |||
Fri June 7 | graph due | ||
Mon June 10 | |||
Wed June 12 | Final Exam (8:30-10:20 a.m in classroom) |