Course information
B4 · HL · Higher Level

Abstract data types

Implement richer structures and reason about their operations.

DP2 · Autumn 2027 · provisional

Learning goals

  • Model linked structures and tree operations.
  • Explain hashing and suitable applications.
  • Compare structures by access pattern and operational cost.

In practice

  1. Trace changes to a linked structure.
  2. Implement and test a binary search tree.
  3. Compare a hash-based lookup with a sequential search.

Show understanding

Tested implementations, operation traces and an efficiency argument.

Predict first. Implement second. Test deliberately. Explain what the evidence shows.

Textbook: Baumgarten, Ganea & Turland. Topic codes follow the course; the book’s teaching order is not strictly numerical. Exact reading and submission requirements are set with each assignment.