AQA GCSE Computer Science (8525)Specification point 3.1.1

AQA 8525 3.1.1: Representing algorithms

The free BugBot lessons that teach this point, a robot to try it on, and the past-paper questions that test it.

Lessons that teach it

  1. F4.4 Decomposition and abstraction Functions and structured code
    Structure diagrams, and hiding the details of a job behind a function.
  2. F5.1 What an algorithm is Algorithms
    Inputs, processes and outputs; what makes an algorithm precise; programs implement algorithms.
  3. F5.2 Flowcharts Algorithms
    The standard symbols, and turning a flowchart into code.
  4. F5.3 Pseudocode and the exam reference language Algorithms
    Reading and writing your board's pseudocode, and translating it into Python.
  5. F5.4 Trace tables Algorithms
    Following an algorithm line by line, and tracing to find a logic error.

Try it on a robot

The task from F4.4 Decomposition and abstraction, running here. Change the program and press Run.

Past paper questions on this

Real exam questions that test this, each worked through with a program you can run.

The specification is AQA's own document; this page says which of our lessons teach point 3.1.1 and is not endorsed by the board.