Cambridge AS & A Level Computer Science
10.4Introduction to abstract data types (ADT)
Introduction to abstract data types (ADT) in Cambridge AS & A Level Computer Science: what the syllabus expects you to know, the learning objectives and how to practise.
Subtopic24 practice questions1 lesson
Learning objectives
What the syllabus expects you to be able to do.
- 10.4.1Explain that an ADT is a collection of data with a set of operations on it, with stack, queue and linked list as examples.
- 10.4.2Describe the key features of each, justify one for a situation, and add, edit and delete data.
- 10.4.3Describe how a queue, stack and linked list can be implemented using arrays.
Lessons
- Full access
Abstract data types: stack, queue and linked list
60 min
Join to read every lesson, or see what Full access includes.
Sample question
A sample question on this topic. Answer it, check it, then read the worked answer.
Turn Introduction to abstract data types (ADT) into a strength.
Practise with instant marking, see your mastery grow and get a study plan built around your exam date.