| Date | Material | Comments and References |
|---|---|---|
| Mar 19 | Trees Applications: Set Representations | lecture; see also Horowitz & Sahni "Fundamentals of Data Structures" |
| Mar 21 | Find-Union | lecture |
| Mar 23 | Dictionaries | chap 8.1 |
| Mar 26 | Hash Tables | chap 8.3 |
| Mar 28 | Hash table Analysis | see also Aho, Hopcroft, Ullman, "Data Structures and Algorithms" |
| March 30 | Binary Search Trees | chap 9.1; Project 4 posed |
| . | ||
| April 2 | Binary Search Trees | chap 9.1 |
| April 4 | Binary Search Trees -Insertion/Deletions | chap 9.1; Optional homework posed |
| Apr 6 | Binary Search -- Average Case Analysis | lecture; see also Aho, Hopcroft, Ullman, "Data Structures and Algorithms" |
| Apr 9 | Prof. Atallah's lecture | AVL trees |
| Apr 11 | 2-3 Trees | lecture see also Aho, Hopcroft, Ullman, "Data Structures and Algorithms" |
| Apr 13 | Skip List | chap 8.6 |
| Apr 16 | Skip List and Multi-way Search Trees | Chap 8.6 and Chap 9.3 |
| Apr 18 | Graphs Definitions | chap 12.1 |
| Apr 20 | Prof. Marinescu's lecture | routing vs shortest path in networks. |
| Apr 22 | Project due by midnight; no late submissions | |
| Apr 23 | Spanning Tree | chap12.7 |
| Apr 25 | Shortest Paths in Grpahs | chap 12.6 |
| Apr 27 | Shortest Paths in Grpahs | chap 12.6 |