OCR GCSE Computer Science (J277)Specification point 2.1.2

OCR J277 2.1.2: Designing, creating and refining algorithms

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

What it covers

Before anyone writes a program, someone has to work out the steps. A set of steps that solves a problem is an algorithm. Algorithms are older than computers: a recipe is one, and so is the method you learned for long division. This module is about designing, describing, checking and comparing them, starting with what makes a good one.

  • An algorithm is not a program
  • Inputs, processes and outputs
  • What makes a good algorithm
  • Many algorithms, one problem
Read the free lesson (12 min)

Or do it in the simulator, with tasks that mark themselves

Lessons that teach it

  1. F5.1 What an algorithm is Algorithms
    Inputs, processes and outputs; what makes an algorithm precise; programs implement algorithms.
  2. F5.2 Flowcharts Algorithms
    The standard symbols, and turning a flowchart into code.
  3. F5.3 Pseudocode and the exam reference language Algorithms
    Reading and writing your board's pseudocode, and translating it into Python.
  4. 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 F5.1 What an algorithm is, 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 OCR's own document; this page says which of our lessons teach point 2.1.2 and is not endorsed by the board.