AS / A Level Computer Science

Candidates should be able to:

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:

Draw a flowchart from:

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

Notes and guidance

N/A