Syllabus
This page lists the topics and the relevant readings for each week of the course. The references are to the text by Collins, "Data Structures and the Java Collections Framework".
The list of topics is tentative. The syllabus might be a bit out of order right now, but will be updated as we cover the material.
| Week | Reading | Topics |
|---|---|---|
| 1 | 1.2, 1.3, 6.2, 8.1 | Abstract data types, lists, stacks |
| 2 | 8.2 | Queues |
| 3 | 5, 1.4, 1.5, 1.6 | The memory model, inheritance, recursion. |
| 4 | 3.1 | Recursion, Analysis of algorithms |
| 5 | 7 | Analysys of algorithms, Linked lists |
| 6 | 4.2.3 | Iterator, Test1 |
| 7 | 2.2 | Exceptions |
| 8 | 9 | Binary trees |
| 9 | 10 | Binary search trees |
| 10 | 11 | Test2, Sorting |
| 11 | 11 | Sorting continued |
| 12 | 13 | Priority queues |
| 13 | Review |