10.4 Introduction to Abstract Data Types (ADT)

4 of 4 objectives have lessons · 0 studied · 0 secure

Lessons

Introduction to Abstract Data Types (ADT) — stack, queue, linked listUnderstand what an ADT is; recognise stack, queue, and linked list as ADTs; use them to store data; describe array implementations. 10 min, not started

4 objectives

What Cambridge says you should be able to do, in our words. Codes are the topic number plus the objective’s position.

10.4.1

Understand that an ADT is a collection of data and a set of operations on those data.

Taught in: Introduction to Abstract Data Types (ADT) — stack, queue, linked list · 1 question

10.4.2

Understand that a stack, a queue and a linked list are examples of ADTs.

Describe the key features of a stack, queue and linked list, and justify their use for a given situation.

Taught in: Introduction to Abstract Data Types (ADT) — stack, queue, linked list · 3 questions

10.4.3

Use a stack, a queue and a linked list to store data.

Candidates will not be required to write pseudocode for these structures, but should be able to add, edit and delete data in them.

Taught in: Introduction to Abstract Data Types (ADT) — stack, queue, linked list

10.4.4

Describe how a queue, a stack and a linked list can be implemented using arrays.

Taught in: Introduction to Abstract Data Types (ADT) — stack, queue, linked list · 1 question