Practice Flashcards
Flip to reveal answersWhat does an abstract data type define?
Track your progress — Sign up free to save your progress and get smart review reminders based on spaced repetition.
All 5 Flashcards — What ADTs are for
Sign up free to track progress and get spaced-repetition review schedules.
Question
What does an abstract data type define?
Answer
The **operations** available and what they mean — not how the data is stored.
Question
ADT or data structure: a stack?
Answer
**ADT.** It promises push, pop, peek and last-in-first-out order. An array or a linked list is how you build one.
Question
Why hide an ADT's implementation?
Answer
So it can be **replaced** without changing any calling code, because callers only ever depended on the operations.
Question
Which ADT enforces uniqueness?
Answer
A **set** — duplicates cannot be stored, so the structure guarantees it rather than the programmer remembering to check.
Question
How should an ADT choice be justified in an exam?
Answer
By the operation the program performs **most**, with its complexity — and what the alternative would cost.
Read the notes
Full study notes for What ADTs are for
Topic 8.1 hub
Fundamentals of ADTs
More from Topic 8.1
All flashcards in this topic
Computer Science exam skills
Paper structures & tips
Track your progress with spaced repetition
Sign up free — Aimnova tells you exactly which cards to review and when, so you remember everything before your IB exam.
Start Free