The approximate weighting of the work done is
|
| 45% |
|
| 17% |
|
| 38% |
| Date | Lecture Topic | Reading | Comments |
| Jan 4 | introduction | 1 | |
| Jan 6 | algorithm analysis | 2.1-2 | |
| Jan 8 | asymptotic notation | 3.1 | |
| Jan 11 | common functions and notation | 3.2 | last day to drop without W |
| Jan 13 | recurrence relations | 4.3-4.5 | last day to add a class |
| Jan 15 | stacks and queues | 10.1-2 | |
| Jan 18 | no class (MLK Day) | ||
| Jan 20 | uses of stacks & linked lists | (10.1) | |
| Jan 22 | binary trees | appendix B.5, 10.4 | |
| Jan 25 | BSTs | 12.1-3 | |
| Jan 27 | path lengths and random BSTs | 12.4 | |
| Jan 29 | AVL trees | ||
| Feb 1 | rotations | (13.2) | |
| Feb 3 | (2,4) trees | (18.1) | |
| Feb 5 | RB trees | 13.1 | |
| Feb 8 | RB insertion | 13.2-3 | |
| Feb 10 | RB deletion | 13.4 | |
| Feb 12 | B-trees | 18.1-3 | |
| Feb 15 | midterm | ||
| Feb 17 | priority queues and heaps | 6.1, 6.5 | |
| Feb 19 | heap operations | 6.2-3 | last day to drop with W (Feb 21) |
| Feb 22 | heapsort | 6.4 | |
| Feb 24 | binomial and fibonacci heaps | 19.1 | |
| Feb 26 | fibonacci heap operations | 19.2-3 | |
| Mar 1 | quicksort | 7.1-3 | |
| Mar 3 | quicksort is quick | 7.4 | |
| Mar 5 | lower bounds | 8.1 (8.2-4) | |
| Mar 8 | order statistics | 9.1-2 | |
| Mar 10 | order statistics | 9.3 | |
| Mar 12 | final review | ||
| Mar 17 | final exam, Wednesday, 10:15-12:15 |