Revise Computing
Revision notesQuestionsFor schools
Log inStart revising free
Revision notesQuestionsFor schoolsLog in
GCSE Computer Science/Paper 2/Designing, creating and refining algorithms

Pseudocode

Create, interpret, correct, complete, and refine algorithms using: Pseudocode

2.1.2 Designing, creating and refining algorithms

Practise exam questions

Designing, creating and refining algorithms — Note 3 of 7

Complete, write or refine an algorithm

What you need to know

Pseudocode is a simplified, informal way of describing an algorithm that is closer to human language than programming code, but structured like code. OCR uses its own Exam Reference Language as pseudocode in exams. You need to be able to write, read, complete, correct, and refine algorithms written in pseudocode, including using sequence, selection, and iteration.

What to know

  • Pseudocode is not a real programming language but follows a structured format similar to code.
  • OCR exams use the OCR Exam Reference Language as their pseudocode standard.
  • You should be able to write new algorithms and complete partially written ones in pseudocode.
  • You should be able to identify and correct errors in pseudocode algorithms.
  • Pseudocode uses keywords like if/then/else/endif, for/next, while/endwhile, do/until.
  • Nesting means placing one construct inside another, e.g. an if statement inside a loop.

Code examples

OCR Pseudocode: Selection and iteration
text
// Ask user for a number between 1 and 10
valid = false
while valid == false
    num = input("Enter a number 1-10: ")
    num = int(num)
    if num >= 1 AND num <= 10 then
        valid = true
    else
        print("Invalid, try again.")
    endif
endwhile
print("You entered: " + str(num))

Ready to test yourself?

Practise 2.1.2 questions
← Previous noteStructure diagrams2.1.2 Designing, creating and refining algorithmsNext note →Flowcharts2.1.2 Designing, creating and refining algorithms

Back to Designing, creating and refining algorithms

Revise another OCR GCSE topic: Searching and sorting algorithms, Computational Thinking

Designing, creating and refining algorithms

Note 3 of 7

  1. 1The inputs, processes, and outputs for a problem
  2. 2Structure diagrams
  3. 3Pseudocode
  4. 4Flowcharts
  5. 5Reference language/high-level programming language
  6. 6Common errors
  7. 7Trace tables
Topic overview

© 2026 Revise Computing · revisecomputing.co.uk

Privacy noticeTermsContact

Revise Computing is an independent revision resource. It is not affiliated with, or endorsed by, OCR (Oxford Cambridge and RSA Examinations).