| # | Chapter | Contents | Estimated time |
|---|---|---|---|
| 1, 2, 3 | Introduction : linked lists, pointers, recursion, complexity, trees | 3 hours | |
| 4 | Abstract data types | 5 hours | |
| 2, 7 | Stacks and queues | 2 hours | |
| 7 | Linear, generalised lists | 2 hours | |
| 8 | memory recuperation | 5 hours | |
| 9 | Trees | 6 hours | |
| 9 | AVL Trees | 4 hours | |
| Midterm exam | 2 hours | ||
| 9 | Tries | 1 hour | |
| 10 | Graphs | 3 hours | |
| 11 | Hashing | 4 hours | |
| Summary | 1 hour |
Course description