Data Structures
DIT961 VT-2018
You will find the times and room at TimeEdit. Note that the content and slides of lectures are preliminary and updated during the course. The material is based on slides and code developed by Nick Smallbone.
| Week | Date | Topic | Material |
|---|---|---|---|
| 1 (12) | 20/3 | Introduction | Copy.zip |
| 21/3 | Complexity | ||
| 2 (13) | 28/3 | More complexity | |
| 4 (15) | 11/4 | Searching and sorting | Some sorting algs in Haskell |
| 13/4 | More sorting | Real-world sorting | |
| 5 (16) | 18/4 | Stacks and queues | |
| 20/4 | Priority queues, binary heaps | ||
| 6 (17) | 25/4 | Heapsort, leftist and skew heaps | |
| 27/4 | Binary search trees, AVL trees | ||
| 7 (18) | 2/5 | 2-3 trees, AA trees, B-trees | |
| 8 (19) | 4/5 | Linked lists, iterators, and tail recursion | |
| 9 (20) | 16/5 | Hash tables | |
| 18/5 | Graphs, depth-first search | ||
| 10 (21) | 23/5 | Graphs, Dijkstra’s and Prim’s algorithms | |
| 25/5 | Summary and exam preparation |
