Control Flow in Imperative Languages

46 Computer Science Topics

We’ve created 46 modules covering every Computer Science topic needed for GCSE level. These are transferable across AQA, CIE, Edexcel, CIE & Internationally. Suitable for teachers or home educators alike.

Whether you’re a brand new Computer Science teacher, or you’ve been teaching ICT for years, our resources will save you hours and hours of lesson preparation every single week.

View the resources →

Candidates should be able to:

understand and use sequence in an algorithm
understand and use selection in an algorithm (IF and CASE statements)
understand and use iteration in an algorithm (FOR, WHILE and REPEAT loops).

What is sequence in an algorithm?

Sequence is a control structure where the computer executes the instructions in the order they are written. Each instruction cannot be executed until the previous instruction is completed.

Example: This pseudocode algorithm uses the sequential instructions INPUT and OUTPUT and will simply execute the instructions in sequence, starting at the top . . .

This content is restricted to subscribers