Algorithms

19.1

What the syllabus asks of you

Show understanding of linear and binary searching methods
Show understanding of insertion sort and bubble sort methods
Show understanding of and use Abstract Data Types (ADT)
Show how it is possible for ADTs to be implemented from another ADT
Show understanding that different algorithms which perform the same task can be compared by using criteria (e.g. time taken to complete the task and memory used)

Read the notes first

Chapter 19: Algorithms

Open the notes →

Drill this topic

All 15 questions on Algorithms, 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 →

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