Control Flow in Imperative Languages

GCSE Computer Science Resources
14-16 Years Old

48 modules covering every Computer Science topic needed for GCSE level, and each module contains:

  • An editable PowerPoint lesson presentation
  • Editable revision handouts
  • A glossary which covers the key terminologies of the module
  • Topic mindmaps for visualising the key concepts
  • Printable flashcards to help students engage active recall and confidence-based repetition
  • A quiz with accompanying answer key to test knowledge and understanding of the module
View the GCSE Resources →

KS3 Computing Resources
11-14 Years Old

We’ve created 45 modules covering every Computer Science topic needed for KS3 level, and each module contains:

  • An editable PowerPoint lesson presentation
  • Editable revision handouts
  • A glossary which covers the key terminologies of the module
  • Topic mindmaps for visualising the key concepts
  • Printable flashcards to help students engage active recall and confidence-based repetition
  • A quiz with accompanying answer key to test knowledge and understanding of the module
View the KS3 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