| Date | Lecture Topic | Reading | Due | Assigned |
|---|---|---|---|---|
| Tue Oct 12 |
Review search trees, introduce skip lists | Sections 13.1-13.3 | ||
| Thur Oct 14 |
Skip lists | handout | Homework 3 | Homework 4 Lab 3 |
| Tue Oct 19 |
Skip list analysis | |||
| Thur Oct 21 |
B-trees | Sections 19.1-19.3 | ||
| Tue Oct 26 |
B-trees (cont) | handout | Homework 4 | B-tree Practice Problems |
| Thur Oct 28 |
Priority Queue ADT, binary heaps | Sections 7.1-7.2 | ||
| Tue Nov 2 |
EXAM 2 | |||
| Thur Nov 4 |
Graph problems, representing graphs | Section 23.1 | ||
| Tue Nov 9 |
Breadth-first search (bfs), introduce MST | Section 23.2 | Lab 3 | Lab 4 |
| Thur Nov 11 |
Prim's Minimum Spanning Tree (MST) Alg | Sections 24.1-24.2 | ||
| Tue Nov 16 |
Analysis of Prim's algorithm | |||
| Thur Nov 18 |
Dijkstra's shortest path algorithm | Sections 25.1-25.2 | ||
| Tue Nov 23 |
DFS and topological sort | Sections 23.3-23.4 | Lab 4 suggested | Homework 5 |
| Thur Nov 25 |
Thanksgiving Break | |||
| Tues Nov 30 |
Garbage collection algorithms | handout | Lab 4 | |
| Thurs Dec 2 |
Garbage collection algorithms | |||
| Tue Dec 7 |
Overview and review for the final | Homework 5 | ||
| Tue Dec 14 |
Final Exam 1:00pm-3:00pm (location TBA) |