ComputingYears 7–9Computer Science

Algorithms, flowcharts and pseudocode

Learn Algorithms, flowcharts and pseudocode for Years 7–9 pupils (ages 11–14). Free practice questions, lessons and worked examples — aligned to the UK National Curriculum.

What you'll learn

  1. 1

    An algorithm is a precise sequence of steps that solves a problem. It must be unambiguous and must finish.

  2. 2

    Flowcharts use shapes with fixed meanings: oval for start/stop, rectangle for a process, diamond for a decision, parallelogram for input or output.

  3. 3

    Which flowchart shape represents a decision?

  4. 4

    Computers do exactly what you write, not what you meant. An ambiguous step is a bug waiting to happen.

  5. 5

    Algorithm to find the largest of three numbers: set largest to the first; if the second is bigger, replace it; if the third is bigger, replace it; output largest.

  6. 6

    What must every algorithm do?

  7. 7

    What does decomposition mean?

Practise Algorithms, flowcharts and pseudocode with Whizlo

Free AI-tutored lessons, unlimited practice questions, and progress tracking for ages 11–14. Aligned to the UK National Curriculum.