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: Maximum of (Assignments with weight 30% and written exam with weight 70%, Written exam with weight 100%). Weights can vary ±10% depending on the difficulty of the assignments each year.