DP Computer Science · HL · B4 Abstract data types (HL only)

B4.1 Fundamentals of ADTs

Get started
Notes Quiz

What is an Abstract Data Type (ADT)?

Abstract Data Type (ADT): A mathematical model for a data type, defined by its behaviour (the operations it supports and their semantics) rather than by its implementation. An ADT specifies what can be done with data, not how it is done internally.

Think of an ADT as a contract or blueprint. When you use a Stack ADT, you agree that you can push items on, pop items off, and peek at the top , but you don't care whether the underlying code uses an array or a linked list to make that happen.

This separation is one of the most powerful ideas in computer science: it lets you think at a higher level when designing software, and swap implementations later without breaking anything that depends on the ADT.

Analogy

An ADT is like a vending machine interface. You press a button and get a snack , you don't need to know the internal mechanism that delivers it. The buttons (operations) are defined; the machinery (implementation) is hidden.

Free preview

9 more sections in this topic

Koncepts

Learn it properly. Then practise like it's the real paper.

Start free

Features

  • Lessons
  • Past papers
  • Library
  • Homework Help
  • Duels

More

  • For parents
  • Compare
  • Plans & pricing
  • DP for students

Legal

  • Privacy
  • Terms
  • Account deletion

© 2026 Koncepts (product of PrepAiro, Inc). All rights reserved.
DP, IB, EE and TOK are terms of the International Baccalaureate Organization.

Made for IB DP students.