605.202 Data Structures
Fall 1999
| Lecture | Topics | Reading† | Assigned | Due |
|---|---|---|---|---|
| 1 (9/9) | Java Fundamentals | 1.1-1.4, Notes | Ex 1, Files | |
| 2 (9/16) | Analysis of Algorithms | 2.1-2.7 | Ex 2 | |
| 3 (9/23) | Recursion, Linked Lists | Notes, 3.3 | Project 1 Ex 3 |
Ex 1 Ex 2 |
| 4 (9/30) | Stacks, Queues, Dequeues | 3.1, 3.2, 3.4 | Ex 3 | |
| 5 (10/7) | Sequences, Bubble Sort, Enumerations | 4.1-4.5 | Project 2 Ex 4 |
Project 1 |
| 6 (10/14) | Trees | 5.1-5.4 | Ex 5 | Ex 4 |
| 7 (10/21) | Priority Queue, Sequence, Dictionaries | 6.1, 6.2 | Project 3 |
Ex 5 |
| 8 (10/28) | Binary Search Trees; Midterm | 7.1-7.3 | Project 2 | |
| 9 (11/4) | Heaps, Heap Sort, Huffman Coding | 6.3, 12.4.3 | Ex 6 | |
| 10 (11/11) | AVL Trees | 7.4, 7.6 | Ex 6 | |
| 11 (11/18) | Merge Sort, Quick Sort, Selection | 8.1, 8.3 | Project 4 Ex 7 |
Project 3 |
| 12 (12/2) | Hash Tables, Bucket Sort, Radix Sort | 8.5, 8.6 | Ex 8 | Ex 7 |
| 13 (12/9) | Graphs, Pattern Matching, Collection Framework | 9.1-9.3, 11.2 | Ex 8 Project 4 |
|
| 14 (12/16) | Final Exam |
†Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in Java, Wiley (1998).