This resource supports AQA GCSE Computer Science 3.4.2 Truth tables and logic circuits. It sits within Boolean logic in the Computer systems section of the course and focuses on the precise knowledge students need for exam questions on logic gates, combined circuits, and truth tables. The key teaching goal is not just getting students to remember what AND, OR, NOT, and XOR do, but helping them move confidently between a gate, a circuit, and a completed table.
Students often look comfortable right up until a circuit has more than one gate and a NOT sign appears in a slightly inconvenient place. Then the confident nodding begins to wobble. This page is designed to keep the wobbling to a minimum. It gives you a tight curriculum focus, practical teaching moves, and clear marking guidance so students can construct, interpret, and explain simple logic circuits accurately.
At a Glance
🧠 Specification context: AQA GCSE Computer Science 8525, section 3.4.2 Boolean logic, with this page focused on truth tables and simple logic circuits.
Students must know how to:
construct truth tables for NOT, AND, OR, and XOR gates
complete truth tables for simple logic circuits with combinations of these gates
interpret what a completed truth table shows
create, modify, and interpret simple logic circuit diagrams
cope with circuits and tables involving up to three inputs
Likely exam focus: accurate outputs, careful interpretation of combined gates, correct use of gate names and symbols, and explaining when a circuit output is 1 or 0.
Common challenge: students often know each gate on its own but lose marks when they must evaluate a circuit in the correct order.
Understanding the Topic
Where this sits in the specification
For AQA GCSE Computer Science, truth tables and logic circuits sit inside 3.4.2 Boolean logic. Students are expected to work with NOT, AND, OR, and XOR only. They do not need NAND or NOR for this specification point, which is often a relief to everyone involved.
The focus is practical and exam-friendly. Students should be able to look at a gate or circuit, test every possible input combination, and determine the correct output. They should also be able to interpret a truth table and explain what it shows.
Truth tables
A truth table shows all possible input combinations for a logic gate or circuit and the resulting output for each combination.
Key points to stress:
- a table must include every possible combination of inputs
- one input gives 2 rows, two inputs give 4 rows, and three inputs give 8 rows
- outputs are written as 1 or 0, not vague descriptions such as “on” or “off” unless the question specifically uses those words
- when a circuit has multiple gates, students often need intermediate columns to stay accurate
A strong teaching message is this: truth tables are not guesswork. They are a method. If students work row by row and gate by gate, the marks usually follow.
Simple logic circuits
A logic circuit combines gates to produce an output from one or more inputs. Students need to read circuits from the inputs through to the final output, evaluating each gate in turn.
For this specification, the important behaviours are:
- NOT flips the input
- AND outputs 1 only when both inputs are 1
- OR outputs 1 when at least one input is 1
- XOR outputs 1 when the inputs are different
When students evaluate a circuit, they must:
- identify the first gates acting on the inputs
- calculate any intermediate outputs
- use those intermediate values to calculate the final output
What examiners are really rewarding
In this topic, examiners usually reward:
- complete tables with no missing rows
- correct outputs for each input combination
- accurate reading of the gate symbols
- clear interpretation of what the circuit does
- methodical working, especially in multi-gate circuits
Students often drop marks not because the topic is too hard, but because they rush. Boolean logic is wonderfully unforgiving in that way.
Key Terms and Concepts
| Term | Explanation |
|---|---|
| Truth table | A table showing every possible combination of inputs and the output produced. |
| Logic gate | An electronic component that performs a Boolean operation on one or more inputs. |
| Input | A binary value, usually 0 or 1, fed into a gate or circuit. |
| Output | The binary result produced by a gate or circuit. |
| NOT | A gate with one input that reverses the value: 1 becomes 0 and 0 becomes 1. |
| AND | A gate that outputs 1 only if both inputs are 1. |
| OR | A gate that outputs 1 if at least one input is 1. |
| XOR | A gate that outputs 1 if the two inputs are different. |
| Logic circuit | A combination of logic gates linked together to produce a final output. |
| Intermediate value | A temporary output from one gate that is then used as an input to another gate in the same circuit. |
How to Teach This Topic
Teaching sequence
- Start with single gates first: NOT, AND, OR, XOR.
- Move quickly from gate meaning to mini truth tables.
- Then introduce two-gate circuits and insist on intermediate columns.
- Only after that move to three-input examples.
- Finish with short exam-style tasks where students must explain what a circuit does.
Useful classroom routines
- Use mini whiteboards for rapid truth table completion.
- Give students mixed cards with gate name, symbol, and rule to match.
- Model one row at a time rather than jumping straight to the final output.
- Ask students to highlight where the output of one gate becomes the input of another.
Discussion prompts
- “How many rows should this table have, and why?”
- “Which gate is evaluated first?”
- “What happens to this input before it reaches the final gate?”
- “Why is this row different from the previous one?”
Scaffolds and extension
- Provide partially completed tables with the input rows already filled in.
- Encourage students to add intermediate columns even when the question does not force them to.
- Challenge confident students to write a short sentence describing when the output is 1.
- Ask students to spot and correct a deliberately wrong truth table. It is surprisingly effective and mildly ruthless.
💡 Teacher tip: students often confuse OR and XOR because both can output 1 with more than one possible input pattern. Keep repeating the difference: OR means one or both, while XOR means one or the other, but not both.
How to Mark This Topic Effectively
What strong answers usually contain
- every input combination is included
- rows are in a sensible binary order
- intermediate gate values are worked out correctly
- the final output matches the circuit for every row
- explanations use the correct gate language, especially for XOR and NOT
What weaker answers often do
- miss out one or more rows
- treat XOR as if it means the same as OR
- apply NOT to the wrong input or to the whole circuit by accident
- jump straight to the final column without calculating the earlier gates
- describe a circuit vaguely instead of stating exactly when the output is 1
| If you see this | It usually means |
|---|---|
| Only 4 rows in a 3-input table | The student has not recognised that 3 inputs require 8 possible combinations. |
| XOR treated like OR | The student knows “at least one” but has forgotten that XOR outputs 0 when both inputs are 1. |
| Correct final answer on some rows but not all | The student may understand individual gates but is losing track of the order of operations. |
| No intermediate working in a combined circuit | The student is guessing or mentally skipping steps, which makes errors much more likely. |
📝 Marking shortcut: when a circuit question goes wrong, check the first incorrect row and work backwards. The first wrong intermediate value usually reveals the exact misconception.
Example Student Responses
Example question
Complete the truth table for the output Q = (A AND B) OR NOT C. [4 marks]
Marking guidelines
- 1 mark for the correct A AND B intermediate column
- 1 mark for the correct NOT C intermediate column
- 2 marks for the correct Q output column across all rows
Strong response
A B C | A AND B | NOT C | Q
0 0 0 | 0 | 1 | 1
0 0 1 | 0 | 0 | 0
0 1 0 | 0 | 1 | 1
0 1 1 | 0 | 0 | 0
1 0 0 | 0 | 1 | 1
1 0 1 | 0 | 0 | 0
1 1 0 | 1 | 1 | 1
1 1 1 | 1 | 0 | 1
Why this is strong:
- every row is present
- the student calculates the intermediate columns before the final output
- the final column is consistently derived from the circuit rather than guessed
- the response is easy to mark because the method is visible
Weak response
A B C | Q
0 0 0 | 0
0 0 1 | 0
0 1 0 | 1
0 1 1 | 1
1 0 0 | 1
1 0 1 | 1
1 1 0 | 1
1 1 1 | 0
Why this is weak:
- there are no intermediate columns, so the method cannot be followed
- NOT C has been handled inconsistently
- the final row is wrong, suggesting the student has not combined the gates accurately
- some answers look plausible, which is exactly why this topic punishes rushing
Practice Questions
- Construct the truth table for an XOR gate. [2 marks]
- Marking guidance: reward the correct four input combinations and the correct output pattern of 0, 1, 1, 0.
- A circuit has inputs A and B going into an AND gate. The output of that gate then goes into an OR gate with input C. Complete the truth table for the circuit. [4 marks]
- Marking guidance: reward a correct intermediate A AND B column and a correct final output column for all rows.
- Explain the difference between an OR gate and an XOR gate using examples from a truth table. [3 marks]
- Marking guidance: reward the idea that OR = 1 when one or both inputs are 1, while XOR = 1 only when the inputs are different.
- Draw a simple logic circuit for the rule: the output is 1 when A is 1 and B is 0. [3 marks]
- Marking guidance: reward use of a NOT gate on B, then an AND gate combining A with NOT B.
- A student says a circuit outputs 1 whenever at least one input is 1, so the gate must be XOR. Is the student correct? Explain. [2 marks]
- Marking guidance: reward the judgement that the student is not correct, because that rule describes OR, not XOR.
Common Misconceptions
| Misconception | Quick correction teachers can use |
|---|---|
| OR and XOR mean the same thing. | OR gives 1 when one or both inputs are 1. XOR gives 1 only when the inputs are different. |
| A 3-input truth table still has 4 rows. | Each extra input doubles the number of combinations. Three inputs means 8 rows. |
| NOT can be applied wherever it feels convenient. | NOT affects the specific input or value it is attached to, not the entire circuit unless shown that way. |
| You can work out the final output without intermediate steps. | In a combined circuit, intermediate columns usually prevent avoidable errors and make the logic visible. |
| If most rows are right, the circuit is basically understood. | One wrong gate rule can affect several rows. Precision matters because each row is a separate test case. |
FAQ
Do students need to know NAND or NOR for this AQA topic?
No. For AQA GCSE Computer Science 3.4.2, students are expected to work with NOT, AND, OR, and XOR. It is worth saying this explicitly because students sometimes revise extra gates and then become unsure about the required set.
Should students always include intermediate columns in a truth table?
For single gates, not usually. For combined circuits, it is strongly advisable. Intermediate columns reduce errors and make marking much clearer, especially when a circuit includes a NOT gate or more than one stage.
What is the best way to teach the difference between OR and XOR?
Use the two-input truth tables side by side and focus attention on the 1,1 row. OR outputs 1 there, but XOR outputs 0. That single row is often the most useful correction point in the whole topic.
How much explanation do students need in written answers?
Enough to be precise. If a question asks for an explanation, students should name the gate behaviour clearly, for example: “The output is 1 only when both inputs are 1, so this is AND.” Short and exact is much better than long and foggy.
Why do students lose marks on circuits they seem to understand in class?
Usually because they try to do everything mentally. In lessons, the process may feel obvious when modelled. In an exam, skipped steps turn into wrong outputs very quickly. Encouraging a row-by-row method is one of the simplest ways to protect marks.
Save time marking truth tables and logic circuits
Marking.ai can help teachers review Boolean logic responses more quickly and more consistently, especially when students have all the right intentions and one spectacularly unhelpful XOR mistake. It is particularly useful for spotting whether a student truly understands gate behaviour, row structure, and circuit order, rather than just landing on a few lucky outputs.