Practice Questions
O Level Computer Science: Boolean logic — Practice Questions (Cambridge 2210)
Original practice questions with worked answers for Cambridge O Level Computer Science 2210: NAND, NOR and XOR gates, logic expressions and eight-row outputs.
- Subject
- Computer Science
- Level
- O LEVELS
- Topic
- Boolean logic
- Author
- Marlbridge Academic Team
- Updated
- Reviewed by
- Harris Khan (what this means)
Aligned to Cambridge O Level Computer Science (2210), 2026-2028. Official specification .
Syllabus page (what it covers and how it is assessed): Cambridge O Level Computer Science.
Syllabus topics and points this page is mapped to
2210
- 10 Boolean logic (topic-level mapping)
"Topic-level mapping" means this page belongs to that topic; it does not claim to cover every point in it.
Found an error? Report a correction.
Need help with this topic? Request a free trial class for O Level Computer Science (2210).
These are original questions written for Marlbridge, for revision and practice on this content. They are not reproduced past-paper questions, and they do not replicate the exam’s exact structure, question count or mark tariffs — Cambridge International holds copyright in its own papers. Use these alongside the official past papers available from your board.
Each question practises a skill tested in the June 2025 Paper 22. After each answer there is a mark-scheme insight or a tip and, where one matches, the real question to try next.
Questions
1. For each logic gate, give the output X for each of the four input combinations A = 0, B = 0; A = 0, B = 1; A = 1, B = 0; and A = 1, B = 1.
(a) A NAND gate.
(b) An XOR gate. [4]
2. A greenhouse sprinkler is controlled by a logic circuit with three inputs. Input A comes from a soil sensor: A = 0 means the soil is dry and A = 1 means the soil is wet. Input B = 1 means the air temperature is above 30 °C, and B = 0 means it is not. Input C = 1 means the manual override switch is on, and C = 0 means it is off. The sprinkler switches on (X = 1) only if the soil is dry and either the temperature is above 30 °C or the override switch is on.
(a) Write the logic expression for X.
(b) Work out the value of X for each of the eight combinations of A, B and C, from A = 0, B = 0, C = 0 up to A = 1, B = 1, C = 1. [6]
3. Work out the output X of the logic expression X = (A OR B) AND NOT (B AND C) for all eight combinations of the inputs A, B and C. [4]
4. A logic circuit is built like this: inputs A and B go into an AND gate; input C goes into a NOT gate; the outputs of the AND gate and the NOT gate go into an OR gate, whose output is X.
(a) Write the logic expression for this circuit.
(b) State the value of X when A = 1, B = 0 and C = 0. [3]
5. A two-input logic gate gives the output X = 1 only when both of its inputs A and B are 0. For every other input combination, X = 0.
(a) Name this logic gate.
(b) Write a logic expression for X that uses only the operators NOT and OR. [2]
Answers
1. (a) NAND: A=0, B=0 → X=1; A=0, B=1 → X=1; A=1, B=0 → X=1; A=1, B=1 → X=0 [2] (all four correct for 2 marks; two or three correct for 1 mark). (b) XOR: A=0, B=0 → X=0; A=0, B=1 → X=1; A=1, B=0 → X=1; A=1, B=1 → X=0 [2] (all four correct for 2 marks; two or three correct for 1 mark).
Mark-scheme insight (Cambridge 2210 June 2025 mark scheme, Paper 22, Question 8(a)): The XOR outputs credited were 1 only when the two inputs are different (0 and 1, or 1 and 0), and 0 when they are the same. Check the row where both inputs are 1 carefully: XOR gives 0 there, whereas OR gives 1.
Source for the mark-scheme insights on this page: Cambridge O Level Computer Science 2210 June 2025 mark scheme for Paper 22 (2210/22), paraphrased. This mark scheme is not published on Cambridge’s 2210 past papers page (checked September 2026).
Try the real question next: Cambridge O Level Computer Science 2210, June 2025, Paper 22, Question 8.
2. (a) X = NOT A AND (B OR C): NOT A, because the soil is dry when A = 0 [1]; AND (B OR C) [1]. (b) A=0, B=0, C=0 → X=0; A=0, B=0, C=1 → X=1; A=0, B=1, C=0 → X=1; A=0, B=1, C=1 → X=1; A=1, B=0, C=0 → X=0; A=1, B=0, C=1 → X=0; A=1, B=1, C=0 → X=0; A=1, B=1, C=1 → X=0. Eight correct [4]; six or seven correct [3]; four or five correct [2]; two or three correct [1].
Mark-scheme insight (Cambridge 2210 June 2025 mark scheme, Paper 22, Question 8(b)(i)): In the crane question, two inputs were 0 when the condition was met (the key present, the code correct), so the credited expressions used NOT on those inputs. Several equivalent forms were listed, for example writing the bracket as a single NOT of an AND, or expanding it into two AND terms joined by OR.
Try the real question next: Cambridge O Level Computer Science 2210, June 2025, Paper 22, Question 8.
3. A=0, B=0, C=0 → X=0; A=0, B=0, C=1 → X=0; A=0, B=1, C=0 → X=1; A=0, B=1, C=1 → X=0; A=1, B=0, C=0 → X=1; A=1, B=0, C=1 → X=1; A=1, B=1, C=0 → X=1; A=1, B=1, C=1 → X=0. Eight correct [4]; six or seven correct [3]; four or five correct [2]; two or three correct [1]. (Working: A OR B is 0 only for the first two rows; B AND C is 1 only when B = 1 and C = 1, which makes NOT (B AND C) = 0 and so X = 0 in those rows.)
Mark-scheme insight (Cambridge 2210 June 2025 mark scheme, Paper 22, Question 8(b)(ii)): An eight-row answer was marked in bands: four marks for all eight outputs, three for six or seven, two for four or five and one for two or three. In Question 3 above, working out the intermediate values (A OR B, then B AND C) for each row helps you pick up most of these marks even if one row goes wrong.
Try the real question next: Cambridge O Level Computer Science 2210, June 2025, Paper 22, Question 8.
4. (a) X = (A AND B) OR NOT C [1] for A AND B, [1] for OR NOT C. (b) A AND B = 1 AND 0 = 0; NOT C = NOT 0 = 1; 0 OR 1 = 1, so X = 1 [1].
Tip: Follow the circuit from the inputs to the output, writing each gate’s expression in brackets as you go; brackets show which operation happens first.
5. (a) NOR [1]. (b) X = NOT (A OR B) [1].
Tip: NOR is “NOT OR”: it gives the opposite of OR, so its only 1 is when both inputs are 0. NAND is the opposite of AND, so its only 0 is when both inputs are 1.
Where marks are usually lost
- Forgetting to use NOT on an input whose 0 value means the condition is true (for example “0 = soil dry”).
- Leaving out brackets, so that an expression such as NOT A AND B OR C means something different from what was intended.
- Mixing up XOR and OR in the row where both inputs are 1.
- Rushing an eight-row answer; working out intermediate values for each row avoids careless errors.
- Confusing NAND with NOR when naming a gate from its outputs.
Frequently asked questions
How are eight-row truth table answers marked? In the worked answers, eight-row answers are marked in bands, such as four marks for all eight outputs and fewer marks for six or seven, so working out intermediate values helps you keep most of the marks.
When should you use NOT in a logic expression from a problem statement? Use NOT on an input whose value 0 means the condition is true, for example when 0 means the soil is dry. Forgetting this is a common mistake.
What is the difference between NAND and NOR? NAND is the opposite of AND, so its only 0 is when both inputs are 1. NOR is the opposite of OR, so its only 1 is when both inputs are 0.
Why do brackets matter in logic expressions? Brackets show which operation happens first. Without them, an expression such as NOT A AND B OR C can mean something different from what was intended.
Get free revision emails (optional)
Occasional emails with practice questions, worked explanations and links to free resources for the qualification and subjects you choose. No spam, and you can unsubscribe from any email. The free tools on this site never need an email.
Related resources
-
Revision notes
O Level Computer Science: Boolean Logic — Revision Notes
Boolean logic recall notes for Cambridge O Level Computer Science 2210: gate output patterns, words-to-gates, truth table drills and circuit-drawing rules.
Computer Science · Cambridge · O Level
Revise topic -
Study guides
O Level Computer Science: Boolean Logic (Cambridge 2210)
Topic 10 guide for Cambridge O Level Computer Science 2210: six logic gates, truth tables, expressions and circuits, with worked conversions between all forms.
Computer Science · Cambridge · O Level
Read guide -
Practice questions
O Level Computer Science: Data Representation — Practice Questions
Original exam-style practice questions with full worked answers on number bases, binary arithmetic, character sets and data storage.
Computer Science · Cambridge · O Level
Try questions
Related articles
-
teaching
A Level tuition in Dubai: Cambridge or Pearson Edexcel International A Level?
Schools in Dubai and Abu Dhabi teach either Cambridge International AS & A Level or Pearson Edexcel International A Level. How the two are structured, why it matters for tuition, and how online classes from Lahore work.
9 October 2026
-
curriculum guides
Choosing subjects at IGCSE and A Level
How subject choices at 14 and 16 affect university options later, and how to keep pathways open without overloading a timetable.
28 July 2026
Studying this with a teacher
Working through Computer Science O LEVELS?
This page is free and stays free. If you would rather be taught it, Marlbridge runs Computer Science classes one-to-one and in small groups of up to 15, online in your own time zone. The first trial class is free. WhatsApp replies within an hour (8am–11pm Pakistan time, every day); email the same day.
Cambridge Computer Science teachers at Marlbridge