Writing exam answers about Boolean logic
A full-mark answer uses capital gate names, labelled inputs A, B, C and output X, correct brackets and a complete truth table with every row filled.
Understanding Writing exam answers about Boolean logic in IGCSE Computer Science Paper 2
What it does: The output is named X, the inputs are A and B, and the brackets show NOT applies to the whole of A OR B. Three inputs give 2 x 2 x 2 = 8 input combinations, so a full-mark table lists all 8 rows from 000 to 111. Marks are given for labelling every input and the output, so none should be left out. Working columns let you check each gate and can earn method marks even if the final column has a slip. Choose the route that matches the question: statement to expression to circuit keeps each gate matched to the words.
Common mistakes: The brackets are missing. A full-mark expression must show the grouping, so line 1 should be X = (A AND B) OR C. Gate names must be written in capital letters. The expression should be X = NOT (A OR B).
Free printable worksheet with full answer key — or add this module to a class and your students practise it interactively.
This module's key terms are also in a printable crossword (Modules 562–580) and word search (Modules 539–580).
Take this worksheet further — free with Cloodit
Each concept is reinforced from every angle — learned, then applied, then tested.
Cloodit turns curriculum-aligned coding content into journeys students work through one biome at a time.
Over 100 of them, across seven natural biomes.
Turns their work into revision material ready for Flash Cards and Exam study.
Live, competitive practice for the start of the lesson or a teacher-led lesson finisher.
Honour your top performers, or encourage a student who's trying hard — ready to print in seconds.
Quick Questions
Match the Pairs
Key Term
X = (A AND B) OR CFill in the Blanks
Spot the Error
Student with a class code? Join your class →