Course contents: Introduction. Lists. Tables. Queues. Trees. Tree traversals. Priority queues. Binary search trees. AVL trees. Hashing. Sorting. Graphs. Skip lists. Union-find structures.

Assessment: Assignments, weight = 30% and written exam, weight = 70% (can vary ± 10% per year).