This study notes covers GCSE Pseudocode Syntax within Trace Tables for GCSE Computer Science. Revise Trace Tables in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 8 flashcards. This topic shows up very often in GCSE exams, so students should be able to explain it clearly, not just recognise the term. It is section 4 of 8 in this topic. Use this study notes to connect the idea to the wider topic before moving on to questions and flashcards.
GCSE Pseudocode Syntax
| Operation | Pseudocode | Example |
|---|---|---|
| Assignment | variable = value | score = 0 |
| Input | variable = input("prompt") | name = input("Enter name") |
| Output | print(value) | print("Hello") |
| IF statement | if...then...elseif...else...endif | if age>=18 then print("Adult") endif |
| FOR loop | for i = start to end...next i | for i = 1 to 10...next i |
| WHILE loop | while condition...endwhile | while x < 10...endwhile |
Practice questions for Trace Tables
What is the main purpose of a trace table?
Explain how a programmer uses a trace table to test an algorithm. Your answer should refer to variables and errors.
Quick recall flashcards
What is pseudocode?
Language-independent algorithm description using English-like syntax
What does != mean?
Not equal to