Note AcademyNote Academy
Start

Introduction to Abstract Data Types (ADT)

10.4

What the syllabus asks of you

  • Show understanding that an ADT is a collection of data and a set of operations on those data
  • Show understanding that a stack, queue and linked list are examples of ADTs
  • Use a stack, queue and linked list to store data
  • Describe how a queue, stack and linked list can be implemented using arrays

Read the notes first

Chapter 10: Abstract data types (ADT)

Open the notes →

Drill this topic

All 46 questions on Introduction to Abstract Data Types (ADT), untimed — answer on paper, then mark yourself against the mark scheme.

Start drill →

Make a worksheet

Choose the years and how many questions, then print it with the answers on separate pages.

Make a worksheet →

46 questions

These are structured questions, answered in working rather than by picking an option, so they are not listed here one by one. The drill above puts each in front of you with its mark scheme to check against.