Note AcademyNote Academy

Data structures

B2.2

What the syllabus asks of you

  • B2.2.1 Compare static and dynamic data structures.
  • B2.2.2 Construct programs that apply arrays and Lists.
  • B2.2.3 Explain the concept of a stack as a “last in, first out” (LIFO) data structure.
  • B2.2.4 Explain the concept of a queue as a “first in, first out” (FIFO) data structure.

I'm studying

Drill this topic

Every question on Data structures that your level can use, 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 →

50129129 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.