Fall 2007
Primary Text:
|
|
|
|
| 1 | Algorithm Analysis |
3.1, 3.4
|
| 2 | Asymptotic Notation and Analysis |
3.5, 3.6
|
| 3 | ``Linear'' Data Structures |
4.1-4.4
|
| 4 | Trees |
6
|
| 5 | Trees |
6
|
| 6 | Heaps |
7.3
|
| 7 | Hash Tables |
8.2
|
| 8 | Hash Tables, Midterm |
8.2
|
| 9 | Search Trees: Binary Search Trees |
9.1
|
| 10 | AVL trees |
9.2
|
| 11 | (2,4) trees, Red-black trees |
9.4, 9.5
|
| 12 | (a,b) trees, B-trees |
9.7.1, 9.7.2
|
| 13 | B-trees |
12
|
| 14 | Graphs |
12
|
| 15 | Graphs |
9.7.2
|
| 16 | Sorting |
10
|
| Final Exam: Wed, Dec 19, 4-6 PM |
|