| Dates | Topics | Chapters in text |
Homeworks and midterm |
| Week 1
Sept 9-13 |
- Review of time complexity of algorithms and asymptotic
notation; upper and lower bounds on algorithm complexity.
- Abstract data types, Priority queues: heaps |
1,2,3 | 1 out |
| Week 2
Sept 16-20 |
- Priority queues: heaps (cont'd) - Dictionaries: Binary search trees. |
6, Binomial Heaps Notes 12 |
|
| Week 3
Sept 23-28 |
- Dictionaries: Balanced search trees
|
12, 13 |
|
| Week 4
Sept 30-Oct 4 |
- Augmenting Data Structures
|
14 |
1 due, 2 out |
| Week 5
Oct 7-11 |
- Hashing: Basic definitions.
- Hashing: Universal hashing, Cuckoo hashing . |
11 |
|
| Week 6
Oct 14-18 |
- Hashing (cont'd)
|
||
| Week 7
Oct 21-25 |
- Amortized Analysis.
|
17 | 2 due, 3 out |
| Week 8
Oct 28- Nov 1 |
- Disjoint Sets | 21 | Midterm |
| Week 9
Nov 4-8 |
- Graphs | 22-23 | |
| Week 10
Nov 11-15 |
- Graphs | 22-23, 35.2 | 3 due, 4 out |
| Week 11 Nov 18-22 |
- Randomized Algorithms, Quicksort |
5,7 |
|
| Week 12 Nov 25-29 |
- Lower Bounds | 8.1, 9.1 | 4 due |