Algorithms

9.2

What the syllabus asks of you

Show understanding that an algorithm is a solution to a problem expressed as a sequence of defined steps
Use suitable identifier names for the representation of data used by a problem and represent these using an identifier table
Write pseudocode that contains input, process and output
Write pseudocode using the three basic constructs of sequence, selection and iteration (repetition)
Document a simple algorithm using a structured English description, a flowchart or pseudocode
Write pseudocode from:
a structured English description • a flowchart
Draw a flowchart from:
a structured English description • pseudocode
Describe and use the process of stepwise refinement to express an algorithm to a level of detail from which the task may be programmed
Use logic statements to define parts of an algorithm solution

Read the notes first

Chapter 9: Algorithms

Open the notes →

Drill this topic

All 28 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 →

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