| WEEK | Monday | Tuesday | Wednesday | Thursday | Friday | |
|---|---|---|---|---|---|---|
| January 5-9 | Intro, Stacks, Queues; ink; 3.1-3.7 | --- | Proofs by Induction; ink; HW01; 1.1-1.6 | --- | Math Review, Analysis; ink; 2.1-2.4 | January 12-16 | Asymptotic Analysis; ink; Still Ch 2 | Help Session | Dictionary ADT's; Binary Trees; ink; 4.1-4.3 | --- | Binary Search Trees; ink; 4.3 |
| January 19-23 | NO CLASS: Martin Luther King Day | --- | AVL Trees; ink; 4.4 | Worksheet | AVL Trees; Priority Queues; HW03; 4.4; 6.1-6.3 | |
| January 25-29 | Finished Lecture 8; ink | --- | Priority Queues & Binary Heaps; 6.3 | --- | Disjoint Sets & Union Find; ink; 8.1-8.3, 8.7 | |
| February 2-6 | Implementing Union Find; 8.3-8.4 | TA Session; Solutions; Corrected Problem 1 | Amortized Analysis; Lecture only; Ch 11 is overkill | --- | Hashing; ink; 5.1-5.2 | |
| February 9-13 | Hash Collisions; ink; 5-3-5-6 | Hashing Worksheet | Review List; ink | More Review | Midterm Exam | |
| February 16-20 | President's Day: NO CLASS | NO HELP SESSION | B+-Trees; ink; 4.7; Midclass Evaluation Summary | B-Trees | Intro to Graphs; ink; 9.1; HW05 | |
| February 23-27 | Topological Sort and Traversals; ink; 9.2; | Graphs/HW5 Questions; Handout | continued; 9.3 | Graphs/HW5 Questions | Shortest Paths; ink; 9.3 | |
| March 2-6 | Spanning Trees; ink; Dijkstra Negative Weights | Spanning Trees/HW6 | Minimal Spanning Trees; ink; 9.5 | Minimal Spanning/HW6 | Comparative Sorting; ink; 7.1-7.6 | |
| March 9-13 | More Sorting; ink; 7.7, 7.11 | Sorting; sorting handout; solutions | Applications; ink | Review | Review; Review List; HW06 |