Why is "Filling in the XOR column exactly like the OR column, giving 1 when both inputs are 1." a common mistake in Boolean logic?

Why it happens: The two gates agree in three of the four rows, and everyday English 'or' is usually inclusive — so the one row where they differ is easy to overlook. How to avoid it: XOR means **exclusive** OR: one or the other, **but not both**. The row to watch is always the last one, where **1 ⊕ 1 = 0**. After completing an XOR column, check that final row specifically before moving on. Source: AQA 8525 specification 3.4.2 requires truth tables for XOR alongside NOT, AND and OR.

Why is "Using symbols from other courses, such as `∧` for AND, `∨` for OR or `¬` for NOT." a common mistake in Boolean logic?

Why it happens: These symbols appear widely in mathematics and in other computing qualifications, so students who have met them elsewhere transfer them across. How to avoid it: The specification names the operators it expects: **`.` for AND, `+` for OR, `⊕` for XOR and an overbar for NOT**. Learn the worked example `A.B + C̅` as the model and use those symbols exclusively. Source: AQA 8525 specification 3.4.2 additional information lists the exact Boolean expression operators students are expected to use.

Why is "Writing the overbar over the wrong part of an expression — `A̅.B` when `(A.B)‾` was meant." a common mistake in Boolean logic?

Why it happens: Both look similar at a glance and use the same symbols, and a hand-drawn overbar is easy to draw too short or too long. How to avoid it: The overbar covers **exactly what it sits above**. `A̅.B` is *(NOT A) AND B*, whereas `(A.B)‾` is *NOT (A AND B)* — and their truth tables differ in three of four rows. Draw the bar deliberately, and if a clean one is not possible, write **NOT (A AND B)** in words instead. Source: Expression questions require the overbar to be positioned correctly, and an ambiguous bar cannot be credited.

Why is "Attempting to complete a truth table for a circuit in a single step, without intermediate columns." a common mistake in Boolean logic?

Why it happens: The expression looks short enough to evaluate mentally, and adding extra columns feels like unnecessary work under time pressure. How to avoid it: Add **one intermediate column per gate** and fill them left to right, following the circuit. Mark schemes credit these columns **separately**, so showing them protects marks even if the final column slips — and it is where most errors are prevented in the first place. Source: Truth table mark schemes award intermediate columns independently of the final output column.

Why is "Drawing a NOT gate as a plain triangle without the small circle on its output." a common mistake in Boolean logic?

Why it happens: The triangle is the visually dominant part of the symbol, so the circle reads as decoration rather than as the element carrying the meaning. How to avoid it: The **circle is what indicates inversion** — a triangle alone is a buffer, which does nothing. Draw the circle clearly on the output side. The same applies to any inverted output in a circuit diagram. Source: AQA 8525 specification 3.4.2 states that students are expected to understand and use the given logic circuit symbols.

Why is "Spending revision time on NAND and NOR gates." a common mistake in Boolean logic?

Why it happens: NAND and NOR appear prominently in wider reading and in other specifications, where they are often presented as fundamental building blocks. How to avoid it: The specification states plainly that **students do not need to know about or use NAND and NOR logic gates**. Only NOT, AND, OR and XOR appear in circuits and expressions, so revision time is better spent on XOR's behaviour and on the notation. Source: AQA 8525 specification 3.4.2 additional information: 'Students do not need to know about or use NAND and NOR logic gates.'

AQA GCSE Computer Science (8525)

Boolean logic

0% Complete

Detailed Study Notes

Detailed notes on Computer Systems for AQA GCSE Computer Science, covering key concepts, explanations, examples, and exam-focused revision points.

Boolean Logic — AQA GCSE Computer Science 8525 (3.4.2)

Four gates — NOT, AND, OR, XOR — and AQA's own notation, which must be used exactly: . for AND, + for OR, ⊕ for XOR, and an overbar for NOT. The specification's worked example is (A AND B) OR (NOT C) written as A.B + C̅. You must construct truth tables (up to three inputs), read and draw logic circuit diagrams, and convert both ways between a circuit and a Boolean expression. NAND and NOR are explicitly excluded.

At a glance

Four gates only: NOT, AND, OR, XOR. NAND and NOR are NOT required.
NOT — one input; the output is the inverse of the input.
AND — output 1 only when ALL inputs are 1.
OR — output 1 when AT LEAST ONE input is 1.
XOR — output 1 when EXACTLY ONE input is 1 (not both, not neither).
AQA notation: . = AND, + = OR, ⊕ = XOR, overbar = NOT.
The specification's example: (A AND B) OR (NOT C) is written A.B + C̅.
Truth tables contain up to three inputs — 2 inputs need 4 rows, 3 inputs need 8 rows.
Number of rows = 2ⁿ where n is the number of inputs.
Work through a circuit left to right, adding an intermediate column for each gate.

What you’ll learn

Mapped to the AQA GCSE 8525 syllabus (2027-2029).

Construct truth tables for the logic gates NOT, AND, OR and XOR (NAND and NOR are not required).
Construct truth tables for simple logic circuits using combinations of NOT, AND, OR and XOR gates, containing up to three inputs, and interpret the results.
Create, modify and interpret simple logic circuit diagrams containing up to three inputs, using only NOT, AND, OR and XOR gates.
Create and interpret simple Boolean expressions using the operators: . for AND, + for OR, ⊕ for XOR and an overbar for NOT.
Create the Boolean expression for a simple logic circuit, and create a logic circuit from a simple Boolean expression.

The four logic gates and their truth tables

NOT inverts. AND needs all. OR needs at least one. XOR needs exactly one.

A logic gate is an electronic component that takes one or more binary inputs and produces a single binary output. Only four are required.

NOT — one input, inverts it

A	NOT A
0	1
1	0

The only gate with a single input. The output is always the opposite of the input.

AND — output 1 only when ALL inputs are 1

A	B	A AND B
0	0	0
0	1	0
1	0	0
1	1	1

Only one row gives 1. Think of it as the strict gate.

OR — output 1 when AT LEAST ONE input is 1

A	B	A OR B
0	0	0
0	1	1
1	0	1
1	1	1

Only one row gives 0. Note the last row — OR is inclusive, so 1 OR 1 = 1.

XOR — output 1 when EXACTLY ONE input is 1

A	B	A XOR B
0	0	0
0	1	1
1	0	1
1	1	0 ⚠️

XOR is "exclusive OR" — one or the other, but NOT both. The final row is what distinguishes it from OR, and it is the single most examined detail in this subtopic.

The comparison that matters

A	B	AND	OR	XOR
0	0	0	0	0
0	1	0	1	1
1	0	0	1	1
1	1	1	1	0

OR and XOR differ in exactly one row — the last. Everything else is identical.

AQA tip. The specification states plainly that "students do not need to know about or use NAND and NOR logic gates." Learning them is wasted effort, and using them in an answer risks confusion.

Four gates only: NOT, AND, OR, XOR. NAND and NOR are excluded.
NOT has one input and inverts it.
AND outputs 1 only when all inputs are 1.
OR outputs 1 when at least one input is 1, including both.
XOR outputs 1 when exactly one input is 1 — 1 XOR 1 = 0.

See the full worked example for boolean logic →

Logic circuit symbols and diagrams

Four symbols to recognise and draw. Signals flow left to right.

The specification states that students "will be expected to understand and use the following logic circuit symbols" and that circuits contain up to three inputs, using only NOT, AND, OR and XOR.

The NOT gate's small circle is what inverts — a triangle without it is just a buffer. XOR is an OR gate with an extra curved line on its back.

How to remember the shapes

Gate	Shape	Memory hook
NOT	Triangle with a circle on the output	The circle means "invert"
AND	Flat back, rounded front — a D shape	D for "anD"
OR	Curved back, pointed front	Points like an arrow
XOR	OR shape with an extra curved line	The extra line means "exclusive"

The circle on the NOT gate is essential — without it the symbol means nothing. Draw it clearly.

Reading a circuit

Signals flow left to right: inputs on the left, gates in the middle, output on the right. Where a wire splits, the same signal goes to both destinations.

AQA tip. When drawing, label every input (A, B, C) and the output (Q). Unlabelled diagrams are hard to mark and risk losing marks even when the logic is right.

Four symbols: NOT (triangle + circle), AND (D shape), OR (pointed), XOR (OR + extra line).
The circle on the NOT gate is what inverts — never omit it.
Circuits contain up to three inputs and use only these four gates.
Signals flow left to right; a split wire carries the same signal to both places.
Always label inputs A, B, C and the output Q.

See the full worked example for boolean logic →

AQA's Boolean expression notation

. for AND, + for OR, ⊕ for XOR, overbar for NOT. Use these exactly.

The specification lists the required operators explicitly:

Operation	AQA symbol	Example
AND	`.` (dot)	`A.B`
OR	`+` (plus)	`A+B`
XOR	`⊕`	`A⊕B`
NOT	overbar	`A̅`

The specification's own worked example

"For example the expression (A AND B) OR (NOT C) would be represented as: A.B + C̅"

Memorise this example. It demonstrates all the conventions at once.

Why `+` does not mean addition

In Boolean algebra the symbols are borrowed from arithmetic but mean something different:

A.B is A AND B, not A multiplied by B.
A+B is A OR B, not A plus B — so 1+1 = 1, not 2.

The notation exists because AND behaves rather like multiplication (1.1 = 1, anything.0 = 0) and OR rather like addition — but they are logic operations, not arithmetic.

Writing the overbar

The overbar goes above the letter or expression it negates:

C̅          means NOT C
A.B        means A AND B
(A.B)‾     means NOT (A AND B)

The position of the overbar matters. A̅.B means (NOT A) AND B, whereas (A.B)‾ means NOT (A AND B) — completely different expressions.

If you cannot draw a clean overbar by hand, write NOT C in words rather than risk an ambiguous mark.

Precedence

As in 3.2.5: NOT first, then AND, then OR. So A + B.C means A OR (B AND C).

Use brackets whenever you mix operators — they cost nothing and remove all ambiguity.

AQA tip. Use AQA's symbols exactly. Writing A ∧ B or A & B for AND, or A ∨ B for OR, uses conventions from other courses and risks losing the mark, since the specification names the operators it expects.

AQA notation: . = AND, + = OR, ⊕ = XOR, overbar = NOT.
The specification's example: (A AND B) OR (NOT C) = A.B + C̅.
+ means OR, not addition — 1+1 = 1 in Boolean algebra.
The overbar's position matters: A̅.B is not the same as (A.B)‾.
Precedence: NOT → AND → OR. Bracket when mixing.

See the full worked example for boolean logic →

Building truth tables for circuits

2ⁿ rows, inputs in binary counting order, one intermediate column per gate.

Step 1 — work out how many rows

$\text{rows} = 2^n \quad \text{where } n = \text{number of inputs}$

Inputs	Rows
2	4
3	8

The specification caps circuits at three inputs, so you will never need more than 8 rows.

Step 2 — list the input combinations systematically

Count up in binary so no combination is missed. For three inputs:

A	B	C
0	0	0
0	0	1
0	1	0
0	1	1
1	0	0
1	0	1
1	1	0
1	1	1

The pattern: the rightmost column alternates every row, the middle every two rows, the leftmost every four. Writing them this way guarantees completeness.

Step 3 — add an intermediate column for each gate

This is the technique that makes complex circuits easy. Do not attempt to evaluate the whole expression in one step.

Worked example: A.B + C̅

A	B	C	A.B	C̅	A.B + C̅
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

Method:

Fill the A.B column — 1 only where both A and B are 1.
Fill the C̅ column — the inverse of C.
Combine the two with OR — 1 where either is 1.

Step 4 — interpret the result

The specification requires you to interpret truth tables. Typical questions:

"For which input combinations is the output 1?" — read off the rows.
"What does this circuit do?" — describe it in words: here, the output is 1 whenever both A and B are on, or C is off.

AQA tip. Show the intermediate columns. Mark schemes award them separately, so a slip in the final column still leaves most of the marks — and working the whole expression mentally is where errors come from.

Number of rows = 2ⁿ; 2 inputs give 4 rows, 3 inputs give 8.
List inputs by counting up in binary so no combination is missed.
Add an intermediate column for each gate — never evaluate in one step.
Fill columns left to right, following the circuit's signal flow.
Intermediate columns are marked separately, so always show them.

See the full worked example for boolean logic →

Converting between circuits and expressions

Both directions are required. Work left to right, or inside out.

The specification requires both conversions: create the expression for a circuit, and create a circuit from an expression.

Circuit → Boolean expression

Method: work left to right, writing the output of each gate as an expression.

Given a circuit where A and B feed an AND gate, C feeds a NOT gate, and both results feed an OR gate:

The AND gate outputs A.B
The NOT gate outputs C̅
The OR gate combines them: A.B + C̅

Label the output of each gate on the diagram as you go. Writing the intermediate expression next to each gate turns a confusing diagram into a simple assembly job.

Boolean expression → circuit

Method: work from the inside out — innermost brackets first.

Given (A + B).C̅:

A + B → an OR gate with inputs A and B
C̅ → a NOT gate with input C
. → an AND gate combining the two outputs

Draw it left to right: inputs on the far left, then the first-level gates, then the combining gate, then the output Q.

A three-input worked conversion

Expression: A ⊕ (B.C)

Innermost: B.C → AND gate taking B and C
Outermost: A ⊕ … → XOR gate taking A and the AND gate's output

Truth table:

A	B	C	B.C	A ⊕ (B.C)
0	0	0	0	0
0	0	1	0	0
0	1	0	0	0
0	1	1	1	1
1	0	0	0	1
1	0	1	0	1
1	1	0	0	1
1	1	1	1	0 ⚠️

Note the final row. Both A and B.C are 1, and XOR of two 1s is 0 — the row that catches people out.

Modifying a circuit

The specification also requires you to modify circuits — for example, "change this circuit so the output is 1 only when all three inputs are 1." That means replacing a gate or adding one, so make sure you can redraw as well as read.

AQA tip. After converting either way, check with one or two input combinations. Pick a row of the truth table, trace it through your circuit, and confirm the output matches the expression. Thirty seconds, and it catches almost every error.

Circuit → expression: work left to right, labelling each gate's output.
Expression → circuit: work inside out, innermost brackets first.
Draw circuits left to right with inputs on the left and output Q on the right.
You must also be able to MODIFY a given circuit.
Check your conversion by tracing one or two input combinations.

See the full worked example for boolean logic →

Quick recap

Four gates only: NOT, AND, OR, XOR. NAND and NOR are explicitly excluded.
NOT inverts; AND needs all inputs 1; OR needs at least one; XOR needs exactly one.
XOR differs from OR in one row only: 1 XOR 1 = 0.
AQA notation: . for AND, + for OR, ⊕ for XOR, overbar for NOT.
The specification's example: (A AND B) OR (NOT C) = A.B + C̅.
Truth tables have 2ⁿ rows — 4 for two inputs, 8 for three.
List input combinations by counting up in binary so none is missed.
Add an intermediate column for each gate; they are marked separately.
Circuit → expression: left to right. Expression → circuit: inside out.

Memorise this

Verbatim phrases and definitions Cambridge mark schemes credit.

Four gates: NOT, AND, OR, XOR. NAND and NOR are NOT required.
AND = 1 only when ALL inputs are 1.
OR = 1 when AT LEAST ONE input is 1 (including both).
XOR = 1 when EXACTLY ONE input is 1 — so 1 XOR 1 = 0.
AQA notation: . = AND, + = OR, ⊕ = XOR, overbar = NOT.
(A AND B) OR (NOT C) is written A.B + C̅.
Rows in a truth table = 2ⁿ (2 inputs → 4 rows, 3 inputs → 8 rows).
Precedence: NOT → AND → OR.
Always add an intermediate column for each gate.

How it’s examined

3.4.2 is assessed on Paper 2 and appears in every series, usually as a multi-part question worth 4–8 marks. Five shapes recur. (1) Complete a truth table for a single gate, 1–2 marks: pure recall, where the XOR row 1 XOR 1 = 0 is the discriminator (AO1). (2) Complete a truth table for a circuit, 3–5 marks: with up to three inputs, so up to 8 rows, and intermediate columns are marked separately — they must be shown (AO2). (3) Write the Boolean expression for a given circuit, 2–3 marks: working left to right, using AQA's exact notation — ., +, ⊕ and the overbar (AO2). (4) Draw a circuit from a Boolean expression, 2–4 marks: working inside out, with correct gate symbols and every input and the output labelled (AO2). (5) Interpret or modify, 2–4 marks: state for which inputs the output is 1, describe what the circuit does, or alter a circuit to meet a new requirement (AO2/AO3). Two boundaries are worth banking: NAND and NOR are explicitly not required, so revising them is wasted; and the notation is fixed by the specification, so symbols from other courses such as ∧ and ∨ risk losing marks.

Sources: AQA GCSE Computer Science 8525 specification (v1.3, 16 June 2025) — 3.4.2 Boolean logic; AQA GCSE Computer Science Paper 2 past papers, mark schemes and examiner reports. Last reviewed 2026-07-29.

Take this whole topic with you

Step-by-step worked examples — Boolean logic

Step-by-step solutions to past-paper-style questions on boolean logic, written exactly the way a tutor would explain them at the board.

Question type:

1Complete truth tables for the four gates (4 marks)
Getting startedGraph or diagram• Paper 2 style — 4 marks (AO1)• truth-table, and, or, xor, not
Question
Complete the truth table below for the AND, OR and XOR gates, and state the output of a NOT gate when its input is 0. (4 marks)

A B A.B A+B A⊕B
0 0
0 1
1 0
1 1
Step-by-step solution
1. Step 1
  AND (A.B) outputs 1 only when both inputs are 1, so only the last row is 1.
2. Step 2
  OR (A+B) outputs 1 when at least one input is 1, so only the first row is 0.
3. Step 3
  XOR (A⊕B) outputs 1 when exactly one input is 1 — so the last row is 0, which is where it differs from OR.
4. Step 4
  NOT inverts its single input, so an input of 0 gives an output of 1.
Answer

A B A.B A+B A⊕B
0 0 0 0 0
0 1 0 1 1
1 0 0 1 1
1 1 1 1 0

(1 mark per correct column.)

NOT with input 0 gives output 1 (1). (4)
Examiner tip
The final row of the XOR column is the discriminator — OR and XOR are identical in every other row, so 1 ⊕ 1 = 0 is the single detail that separates them. Note that NAND and NOR are explicitly excluded from this specification.
2Identify logic gate symbols (3 marks)
Getting startedIdentify & classify• Paper 2 style — 3 marks (AO1)• symbols, gates, identify
Question
(a) State the name of the gate drawn as a triangle with a small circle on its output. (b) State the name of the gate with a flat back and a rounded front. (c) State how the XOR symbol differs from the OR symbol. (3 marks)
Step-by-step solution
1. Step 1
  (a) A triangle with a circle on the output is the NOT gate — the circle is what indicates inversion.
2. Step 2
  (b) The D-shaped symbol with a flat back and rounded front is the AND gate.
3. Step 3
  (c) XOR is drawn exactly like OR but with an extra curved line across its back.
Answer
(a) NOT gate — the small circle on the output indicates inversion (1) (b) AND gate (1) (c) The XOR symbol is the same as the OR symbol but with an additional curved line drawn across its back (1) (3)
Examiner tip
The circle on the NOT gate is essential — a triangle without it is not a NOT gate. When drawing circuits, that circle must be clearly visible, and the extra curved line must be present on any XOR gate.
3Use AQA's Boolean notation (3 marks)
Getting startedIdentify & classify• Paper 2 style — 3 marks (AO1)• notation, boolean, expression
Question
(a) State the symbol used for the AND operation. (b) State the symbol used for the OR operation. (c) Write the expression (A AND B) OR (NOT C) using AQA notation. (3 marks)
Step-by-step solution
1. Step 1
  (a) AND is represented by a dot: .
2. Step 2
  (b) OR is represented by a plus: +
3. Step 3
  (c) A AND B is A.B, and NOT C is C with an overbar, giving A.B + C̅ — the specification's own worked example.
Answer
(a) . (a dot) (1) (b) + (a plus) (1) (c) A.B + C̅ (1) (3)
Examiner tip
Part (c) is taken directly from the specification's additional information column and is worth memorising as the model. Note that ⊕ is XOR and an overbar is NOT — symbols from other courses such as ∧ and ∨ are not the ones AQA names.
4Build a truth table for a three-input circuit (5 marks)
Building confidenceGraph or diagram• Paper 2 style — 5 marks (AO2)• truth-table, three-inputs, intermediate-columns
Question
Construct a truth table for the Boolean expression A.B + C̅, including intermediate columns. (5 marks)
Step-by-step solution
1. Step 1
  Work out the number of rows. Three inputs give 2³ = 8 rows.
  $2^3 = 8 \text{ rows}$
2. Step 2
  List the inputs by counting up in binary — 000, 001, 010, 011, 100, 101, 110, 111 — so no combination is missed.
3. Step 3
  Add an intermediate column for A.B — 1 only in the rows where both A and B are 1, which are the last two.
4. Step 4
  Add an intermediate column for C̅ — simply the inverse of C.
5. Step 5
  Combine with OR: the output is 1 wherever either intermediate column is 1.
Answer

A B C A.B C̅ A.B + C̅
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

Marks: correct 8 rows of input combinations (1); correct A.B column (1); correct C̅ column (1); correct final column (2). (5)
Examiner tip
The intermediate columns are marked separately, so they must be shown — attempting to evaluate the whole expression in one step is where errors arise. Note the final row: A.B is 1 and C̅ is 0, and OR of 1 and 0 is 1.
5Write the Boolean expression for a circuit (4 marks)
Building confidenceGraph or diagram• Paper 2 style — 4 marks (AO2)• circuit, expression, convert
Question
A logic circuit is built as follows:

Inputs A and B feed into an OR gate

Input C feeds into a NOT gate

The outputs of the OR gate and the NOT gate feed into an AND gate, producing output Q

(a) Write the Boolean expression for Q. (b) State the output when A = 0, B = 1 and C = 1. (4 marks)
Step-by-step solution
1. Step 1
  Work left to right. The OR gate takes A and B, so its output is A + B.
2. Step 2
  The NOT gate takes C, so its output is C̅.
3. Step 3
  The AND gate combines those two outputs, so Q = (A + B).C̅. The brackets are essential — without them, precedence would evaluate the AND first.
4. Step 4
  (b) Substitute: A + B = 0 + 1 = 1. C̅ = NOT 1 = 0. Then 1 AND 0 = 0.
Answer
(a) Working left to right:

OR gate output = A + B (1)

NOT gate output = C̅ (1)

AND gate combines them: Q = (A + B).C̅ (1)

(b) With A = 0, B = 1, C = 1:

A + B = 0 + 1 = 1

C̅ = NOT 1 = 0

Q = 1 AND 0 = 0 (1) (4)
Examiner tip
The brackets in part (a) carry a mark: without them, A + B.C̅ would mean A OR (B AND NOT C) because AND binds tighter than OR — a completely different circuit. Labelling each gate's output on the diagram as you work is the reliable method.
6Draw a circuit from a Boolean expression (5 marks)
Building confidenceGraph or diagram• Paper 2 style — 5 marks (AO2)• circuit, expression, draw
Question
Describe the logic circuit represented by the expression A ⊕ (B.C), stating which gates are needed, what feeds into each, and complete a truth table for it. (5 marks)
Step-by-step solution
1. Step 1
  Work inside out. The innermost part is B.C, which needs an AND gate taking inputs B and C.
2. Step 2
  The outer operation is A ⊕ …, which needs an XOR gate taking input A and the output of the AND gate.
3. Step 3
  Two gates in total, with the output labelled Q.
4. Step 4
  Build the truth table with an intermediate column for B.C, which is 1 only when both B and C are 1.
5. Step 5
  Apply XOR between A and B.C — output 1 when exactly one of them is 1. Watch the final row, where both are 1 and XOR gives 0.
Answer
The circuit needs two gates:

An AND gate with inputs B and C, producing B.C (1)

An XOR gate with inputs A and the output of the AND gate, producing Q (1)

Truth table:

A B C B.C A ⊕ (B.C)
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 1 1 1 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 1 0

(1 mark for the B.C column, 2 for the final column.) (5)
Examiner tip
The last row is the trap: both A and B.C are 1, and XOR of two 1s is 0. Working inside out — innermost brackets first — is the reliable method for turning an expression into a circuit, and it guarantees the gates end up in the right order.
7Interpret what a circuit does (6 marks)
StretchGraph or diagram• Paper 2 style — 6 marks (AO2/AO3)• interpret, truth-table, application
Question
A machine will only start when a safety guard is closed (input A = 1) and the start button is pressed (input B = 1), but not if the emergency stop is active (input C = 1).

(a) Write a Boolean expression for the output Q. (b) Construct the truth table. (c) State the only input combination for which the machine starts. (6 marks)
Step-by-step solution
1. Step 1
  Translate each requirement. 'Guard closed and button pressed' is A.B.
2. Step 2
  'But not if emergency stop is active' means the emergency stop must be off, which is C̅.
3. Step 3
  All three conditions must hold, so combine with AND: Q = A.B.C̅.
4. Step 4
  Build the table with intermediate columns for A.B and C̅.
5. Step 5
  The output is 1 only where all three are satisfied — A = 1, B = 1 and C = 0.
6. Step 6
  Interpret it as a rule about the world: the machine starts only when the guard is closed, the button is pressed and the emergency stop is not active.
Answer
(a) Q = A.B.C̅ (2 marks — 1 for A.B, 1 for .C̅)

(b)

A B C A.B C̅ Q
0 0 0 0 1 0
0 0 1 0 0 0
0 1 0 0 1 0
0 1 1 0 0 0
1 0 0 0 1 0
1 0 1 0 0 0
1 1 0 1 1 1
1 1 1 1 0 0

(3 marks)

(c) The machine starts only when A = 1, B = 1 and C = 0 — that is, when the guard is closed, the button is pressed and the emergency stop is not active (1). (6)
Examiner tip
This is what 'interpret the results of simple truth tables' means in practice — reading the table as a rule about a real system. The emergency stop is the discriminator: 'must not be active' becomes C̅, so the output is 1 only when C is 0, which correctly makes the stop override everything else.
8Modify a circuit to meet a new requirement (6 marks)
StretchGraph or diagram• Paper 2 style — 6 marks (AO3)• modify, circuit, expression
Question
A circuit currently implements A + B.

(a) State the change needed so the output is 1 only when exactly one of A and B is 1. (b) State the change needed so the output is 1 only when both A and B are 1. (c) State the change needed so the output is 1 only when neither A nor B is 1, and write the Boolean expression. (6 marks)
Step-by-step solution
1. Step 1
  (a) 'Exactly one' is precisely what XOR does, so replace the OR gate with an XOR gate.
2. Step 2
  Expression becomes A ⊕ B — identical to OR except when both inputs are 1, where XOR gives 0.
3. Step 3
  (b) 'Both' is what AND does, so replace the OR gate with an AND gate, giving A.B.
4. Step 4
  (c) 'Neither' means the output is 1 only when A = 0 and B = 0 — which is the inverse of OR.
5. Step 5
  So keep the OR gate and add a NOT gate on its output.
6. Step 6
  The expression is (A + B)‾ — note the overbar covers the whole bracket, not just one variable.
Answer
(a) Replace the OR gate with an XOR gate (1). The expression becomes A ⊕ B, which is 1 when exactly one input is 1 and 0 when both are (1).

(b) Replace the OR gate with an AND gate (1), giving A.B, which is 1 only when both inputs are 1 (1).

(c) Keep the OR gate but add a NOT gate on its output (1). The expression is (A + B)‾ — the overbar covers the entire bracket, so the output is 1 only when the OR result is 0, which happens only when both A and B are 0 (1). (6)
Examiner tip
Part (c) tests the position of the overbar: (A + B)‾ means NOT(A OR B), whereas A̅ + B̅ means (NOT A) OR (NOT B) — a genuinely different function. The specification requires students to modify circuits as well as read them, so being able to redraw is essential.
9Analyse a combined expression (6 marks)
StretchGraph or diagram• Paper 2 style — 6 marks (AO2/AO3)• truth-table, xor, complex, interpret
Question
Construct a truth table for (A ⊕ B) + (A.C̅) and state for how many input combinations the output is 1. (6 marks)
Step-by-step solution
1. Step 1
  Three inputs give 8 rows. List them by counting up in binary.
2. Step 2
  Column 1 — A ⊕ B: 1 when exactly one of A and B is 1, so rows where A and B differ.
3. Step 3
  Column 2 — C̅: the inverse of C.
4. Step 4
  Column 3 — A.C̅: 1 only where A is 1 and C̅ is 1, meaning A = 1 and C = 0.
5. Step 5
  Final column — OR the two bracketed results: 1 wherever either is 1.
6. Step 6
  Count the 1s in the output column to answer the final part.
Answer

A B C A⊕B C̅ A.C̅ Output
0 0 0 0 1 0 0
0 0 1 0 0 0 0
0 1 0 1 1 0 1
0 1 1 1 0 0 1
1 0 0 1 1 1 1
1 0 1 1 0 0 1
1 1 0 0 1 1 1
1 1 1 0 0 0 0

Marks: A⊕B column (1); C̅ column (1); A.C̅ column (1); final output column (2).

The output is 1 for 5 of the 8 input combinations (1). (6)
Examiner tip
Building this in four separate columns makes an otherwise daunting expression routine — attempting it in one step almost guarantees an error. The row A=1, B=1, C=0 is instructive: A⊕B is 0 because both are 1, but A.C̅ is 1, so the OR still gives an output of 1.

A	B	C	A.B	C̅	Q
0	0	0	0	1	0
0	0	1	0	0	0
0	1	0	0	1	0
0	1	1	0	0	0
1	0	0	0	1	0
1	0	1	0	0	0
1	1	0	1	1	1
1	1	1	1	0	0

A	B	C	A⊕B	C̅	A.C̅	Output
0	0	0	0	1	0	0
0	0	1	0	0	0	0
0	1	0	1	1	0	1
0	1	1	1	0	0	1
1	0	0	1	1	1	1
1	0	1	1	0	0	1
1	1	0	0	1	1	1
1	1	1	0	0	0	0

Model Answers — Boolean logic

High-scoring sample answers for boolean logic on the AQA GCSE 8525 paper, with examiner-style notes mapping each response to the mark scheme and assessment objectives.

Question 1
Paper 2 style — AO12 marks
State the difference between an OR gate and an XOR gate. (2 marks)
Model answer
An OR gate outputs 1 when at least one input is 1, including when both are 1 (1).

An XOR gate outputs 1 when exactly one input is 1, so when both inputs are 1 its output is 0 (1).
Why this scores
The two gates are identical in three of the four rows — the only difference is when both inputs are 1. That single row is what the mark is for, so it must be stated explicitly rather than implied.
Question 2
Paper 2 style — AO22 marks
Write the Boolean expression for (A OR B) AND (NOT C) using AQA notation. (2 marks)
Model answer
(A + B).C̅ (2 marks — 1 for A + B in brackets, 1 for .C̅)

The brackets are essential: without them the expression would be read as A + (B.C̅), because AND binds more tightly than OR.
Why this scores
Compare with the specification's own example, A.B + C̅, which represents (A AND B) OR (NOT C) — the operators are swapped here, and so the brackets move. The brackets are what fix which gate acts first.
Question 3
Paper 2 style — AO22 marks
A logic circuit has three inputs. State how many rows its truth table will have, and explain why. (2 marks)
Model answer
It will have 8 rows (1). Each of the three inputs can independently be 0 or 1, so the number of possible combinations is 2³ = 8 (1).
Why this scores
The specification caps circuits at three inputs, so 8 rows is the maximum ever required. Listing the combinations by counting up in binary — 000, 001, 010, 011, 100, 101, 110, 111 — guarantees none is missed.
Question 4
Paper 2 style — AO23 marks
Complete a truth table for the expression A̅ + B, showing the intermediate column. (3 marks)
Model answer

A B A̅ A̅ + B
0 0 1 1
0 1 1 1
1 0 0 0
1 1 0 1

Marks: correct A̅ column (1); correct final column (2).

The output is 0 only when A = 1 and B = 0.
Why this scores
The intermediate A̅ column carries a mark of its own and makes the OR step straightforward. Note the overbar applies only to A, not to the whole expression — (A + B)‾ would give a completely different table.
Question 5
Paper 2 style — AO23 marks
In a circuit, inputs A and B feed an XOR gate, and the output of that XOR gate feeds a NOT gate to produce output Q.

Write the Boolean expression for Q and state the output when A = 1 and B = 1. (3 marks)
Model answer
The XOR gate produces A ⊕ B, and the NOT gate inverts it, so:

Q = (A ⊕ B)‾ (2 marks)

With A = 1 and B = 1: A ⊕ B = 0 (since XOR of two 1s is 0), and NOT 0 = 1, so Q = 1 (1).
Why this scores
The overbar must cover the whole bracket, since the NOT gate acts on the XOR's output rather than on either input individually. This circuit outputs 1 whenever the two inputs are the same, which is the logical opposite of XOR.
Question 6
Paper 2 style — AO2/AO33 marks
A truth table for a two-input circuit shows an output of 1 only when both inputs are 0. State the Boolean expression for this circuit and describe the gates required. (3 marks)
Model answer
Output 1 only when both inputs are 0 is the inverse of OR, since OR gives 0 only in that same case (1).

The expression is (A + B)‾ (1).

The circuit needs an OR gate taking inputs A and B, with a NOT gate connected to its output (1).
Why this scores
Working from a truth table back to a circuit is the reverse of the usual direction and tests genuine understanding. The alternative expression A̅.B̅ — NOT A AND NOT B — produces the identical truth table and is equally creditworthy.
Question 7
Paper 2 style — AO26 marks
Construct a truth table for (A.B) ⊕ C, showing intermediate columns, and state for how many input combinations the output is 1. (6 marks)
Model answer

A B C A.B (A.B) ⊕ C
0 0 0 0 0
0 0 1 0 1
0 1 0 0 0
0 1 1 0 1
1 0 0 0 0
1 0 1 0 1
1 1 0 1 1
1 1 1 1 0

Marks: correct 8 input combinations (1); correct A.B column (2); correct final column (2).

The output is 1 for 4 of the 8 combinations (1).
Why this scores
The final row is the discriminator: A.B is 1 and C is 1, and XOR of two 1s is 0. The A.B column is 1 in only the last two rows, which makes the XOR step straightforward once that intermediate column is written out.
Question 8
Paper 2 style — AO36 marks
A greenhouse ventilation fan should switch on when the temperature is high (A = 1) or the humidity is high (B = 1), but not when the window is already open (C = 1).

(a) Write a Boolean expression for the fan output Q. (b) Describe the gates required. (c) State whether the fan is on when A = 1, B = 0, C = 1, showing your working. (6 marks)
Model answer
(a) 'Temperature high or humidity high' is A + B (1). 'But not when the window is open' means C must be 0, which is C̅ (1). Both conditions must hold, so:

Q = (A + B).C̅ (1)

(b) The circuit needs:

an OR gate with inputs A and B

a NOT gate with input C

an AND gate combining the outputs of those two gates to produce Q (1)

(c) With A = 1, B = 0, C = 1:

A + B = 1 + 0 = 1

C̅ = NOT 1 = 0 (1)

Q = 1 AND 0 = 0, so the fan is off (1)

This is correct behaviour: the window is already open, so the fan is not needed.
Why this scores
Translating a real requirement into logic is the AO3 skill here. The word 'not' signals an overbar, and the brackets are essential — A + B.C̅ would mean A OR (B AND NOT C), which would switch the fan on whenever the temperature was high regardless of the window.
Question 9
Paper 2 style — AO36 marks
Explain the difference between the expressions A̅.B and (A.B)‾, using a truth table to support your answer. (6 marks)
Model answer
The difference is what the overbar covers. In A̅.B the overbar applies only to A, so the expression means (NOT A) AND B (1). In (A.B)‾ the overbar applies to the whole bracket, so it means NOT (A AND B) — the AND is performed first and the result is then inverted (1).

A B A̅ A̅.B A.B (A.B)‾
0 0 1 0 0 1
0 1 1 1 0 1
1 0 0 0 0 1
1 1 0 0 1 0

(2 marks for the table)

The two columns differ in three of the four rows (1), so these are genuinely different functions despite using the same two variables and looking superficially similar. A̅.B is 1 only when A is 0 and B is 1, whereas (A.B)‾ is 1 in every case except when both are 1 (1).
Why this scores
The position of the overbar is one of the most consequential details in Boolean notation, and this comparison makes the difference unmistakable. When writing by hand, if a clean overbar cannot be drawn it is safer to write NOT (A AND B) in words than to risk an ambiguous mark.

A	B	A̅	A̅ + B
0	0	1	1
0	1	1	1
1	0	0	0
1	1	0	1

A	B	A̅	A̅.B	A.B	(A.B)‾
0	0	1	0	0	1
0	1	1	1	0	1
1	0	0	0	0	1
1	1	0	0	1	0

Key Formulae — Boolean logic

The formulae you need to memorise for boolean logic on the AQA GCSE 8525 paper, with every variable defined in plain English and a note on when to use it.

Number of rows in a truth table
$\text{rows} = 2^n$
$n$
The number of inputs to the circuit
$Limit$
AQA caps circuits at 3 inputs, so a maximum of 8 rows
When to use
Before starting any truth table, to know how many rows to draw. List the input combinations by counting up in binary so none is missed.
Example
2 inputs → 2² = 4 rows; 3 inputs → 2³ = 8 rows
AQA Boolean expression notation
$A.B = \text{AND} \;\;|\;\; A+B = \text{OR} \;\;|\;\; A \oplus B = \text{XOR} \;\;|\;\; \overline{A} = \text{NOT}$
$.$
AND — output 1 only when all inputs are 1
$+$
OR — output 1 when at least one input is 1
$⊕$
XOR — output 1 when exactly one input is 1
$overbar$
NOT — inverts the value beneath it
When to use
Writing any Boolean expression. These are the operators the specification names, so alternatives from other courses risk losing marks.
Example
(A AND B) OR (NOT C) is written A.B + C̅

Key Definitions and Keywords — Boolean logic

Definitions to memorise and the exact keywords mark schemes credit for boolean logic answers — sharpened from recent examiner reports for the 2026 AQA GCSE 8525 sitting.

Logic gate
Examiner keyword
An electronic component that takes one or more binary inputs and produces a single binary output. The four required are NOT, AND, OR and XOR.
Related: Truth table, Logic circuit
NOT gate
Examiner keyword
A gate with a single input whose output is the inverse of that input. Drawn as a triangle with a small circle on the output; written with an overbar.
Example
NOT 0 = 1; NOT 1 = 0
Related: Logic gate, Overbar
AND gate
Examiner keyword
A gate whose output is 1 only when all of its inputs are 1. Drawn with a flat back and rounded front; written with a dot.
Example
A.B is 1 only when A = 1 and B = 1.
Related: OR gate, Logic gate
OR gate
Examiner keyword
A gate whose output is 1 when at least one input is 1, including when both are. Drawn with a curved back and pointed front; written with a plus.
Example
A+B is 0 only when both A and B are 0.
Related: XOR gate, AND gate
XOR gate
Examiner keyword
Exclusive OR. Its output is 1 when exactly one input is 1, so an input of 1 and 1 gives 0. Drawn like an OR gate with an extra curved line; written with ⊕.
Example
1 ⊕ 1 = 0, which is the only row where XOR differs from OR.
Related: OR gate, Logic gate
Truth table
Examiner keyword
A table listing every possible combination of inputs and the resulting output. A circuit with n inputs needs 2ⁿ rows, and AQA caps circuits at three inputs.
Related: Logic gate, Intermediate column
Intermediate column
Examiner keyword
A column in a truth table showing the output of one gate part-way through a circuit. Marked separately, so it should always be shown.
Example
A column for A.B before combining it with C̅.
Related: Truth table, Logic circuit
Logic circuit
Examiner keyword
A diagram showing how gates are connected, with inputs on the left, gates in the middle and the output on the right. AQA circuits use up to three inputs and only NOT, AND, OR and XOR.
Related: Logic gate, Boolean expression
Boolean expression
Examiner keyword
An algebraic way of writing a logic circuit using AQA's operators: . for AND, + for OR, ⊕ for XOR and an overbar for NOT.
Example
(A AND B) OR (NOT C) is written A.B + C̅
Related: Logic circuit, Overbar
Overbar
Examiner keyword
The notation for NOT, written above the variable or expression it negates. Its position matters: A̅.B is not the same as (A.B)‾.
Related: NOT gate, Boolean expression
Input
A binary signal entering a logic gate or circuit, labelled A, B or C. Each can be 0 or 1, so n inputs give 2ⁿ combinations.
Related: Output, Truth table
Output
The single binary signal produced by a gate or circuit, conventionally labelled Q in a circuit diagram.
Related: Input, Logic gate
Operator precedence
Examiner keyword
The order in which Boolean operators are applied: NOT first, then AND, then OR. Brackets override this and should be used whenever operators are mixed.
Example
A + B.C means A OR (B AND C).
Related: Boolean expression

Common Mistakes and Misconceptions — Boolean logic

The traps other students keep falling into on boolean logic questions — taken from recent AQA GCSE 8525 examiner reports and mark schemes — and how to avoid them.

✕Filling in the XOR column exactly like the OR column, giving 1 when both inputs are 1.
AQA 8525 specification 3.4.2 requires truth tables for XOR alongside NOT, AND and OR.
Why it happens
The two gates agree in three of the four rows, and everyday English 'or' is usually inclusive — so the one row where they differ is easy to overlook.
How to avoid it
XOR means exclusive OR: one or the other, but not both. The row to watch is always the last one, where 1 ⊕ 1 = 0. After completing an XOR column, check that final row specifically before moving on.
✕Using symbols from other courses, such as ∧ for AND, ∨ for OR or ¬ for NOT.
AQA 8525 specification 3.4.2 additional information lists the exact Boolean expression operators students are expected to use.
Why it happens
These symbols appear widely in mathematics and in other computing qualifications, so students who have met them elsewhere transfer them across.
How to avoid it
The specification names the operators it expects: . for AND, + for OR, ⊕ for XOR and an overbar for NOT. Learn the worked example A.B + C̅ as the model and use those symbols exclusively.
✕Writing the overbar over the wrong part of an expression — A̅.B when (A.B)‾ was meant.
Expression questions require the overbar to be positioned correctly, and an ambiguous bar cannot be credited.
Why it happens
Both look similar at a glance and use the same symbols, and a hand-drawn overbar is easy to draw too short or too long.
How to avoid it
The overbar covers exactly what it sits above. A̅.B is (NOT A) AND B, whereas (A.B)‾ is NOT (A AND B) — and their truth tables differ in three of four rows. Draw the bar deliberately, and if a clean one is not possible, write NOT (A AND B) in words instead.
✕Attempting to complete a truth table for a circuit in a single step, without intermediate columns.
Truth table mark schemes award intermediate columns independently of the final output column.
Why it happens
The expression looks short enough to evaluate mentally, and adding extra columns feels like unnecessary work under time pressure.
How to avoid it
Add one intermediate column per gate and fill them left to right, following the circuit. Mark schemes credit these columns separately, so showing them protects marks even if the final column slips — and it is where most errors are prevented in the first place.
✕Drawing a NOT gate as a plain triangle without the small circle on its output.
AQA 8525 specification 3.4.2 states that students are expected to understand and use the given logic circuit symbols.
Why it happens
The triangle is the visually dominant part of the symbol, so the circle reads as decoration rather than as the element carrying the meaning.
How to avoid it
The circle is what indicates inversion — a triangle alone is a buffer, which does nothing. Draw the circle clearly on the output side. The same applies to any inverted output in a circuit diagram.
✕Spending revision time on NAND and NOR gates.
AQA 8525 specification 3.4.2 additional information: 'Students do not need to know about or use NAND and NOR logic gates.'
Why it happens
NAND and NOR appear prominently in wider reading and in other specifications, where they are often presented as fundamental building blocks.
How to avoid it
The specification states plainly that students do not need to know about or use NAND and NOR logic gates. Only NOT, AND, OR and XOR appear in circuits and expressions, so revision time is better spent on XOR's behaviour and on the notation.

AQA GCSE Computer Science (8525)

Boolean logic

0% Complete

Detailed Study Notes

Detailed notes on Computer Systems for AQA GCSE Computer Science, covering key concepts, explanations, examples, and exam-focused revision points.

Boolean Logic — AQA GCSE Computer Science 8525 (3.4.2)

At a glance

Four gates only: NOT, AND, OR, XOR. NAND and NOR are NOT required.
NOT — one input; the output is the inverse of the input.
AND — output 1 only when ALL inputs are 1.
OR — output 1 when AT LEAST ONE input is 1.
XOR — output 1 when EXACTLY ONE input is 1 (not both, not neither).
AQA notation: . = AND, + = OR, ⊕ = XOR, overbar = NOT.
The specification's example: (A AND B) OR (NOT C) is written A.B + C̅.
Truth tables contain up to three inputs — 2 inputs need 4 rows, 3 inputs need 8 rows.
Number of rows = 2ⁿ where n is the number of inputs.
Work through a circuit left to right, adding an intermediate column for each gate.

What you’ll learn

Mapped to the AQA GCSE 8525 syllabus (2027-2029).

Construct truth tables for the logic gates NOT, AND, OR and XOR (NAND and NOR are not required).
Construct truth tables for simple logic circuits using combinations of NOT, AND, OR and XOR gates, containing up to three inputs, and interpret the results.
Create, modify and interpret simple logic circuit diagrams containing up to three inputs, using only NOT, AND, OR and XOR gates.
Create and interpret simple Boolean expressions using the operators: . for AND, + for OR, ⊕ for XOR and an overbar for NOT.
Create the Boolean expression for a simple logic circuit, and create a logic circuit from a simple Boolean expression.

The four logic gates and their truth tables

NOT inverts. AND needs all. OR needs at least one. XOR needs exactly one.

A logic gate is an electronic component that takes one or more binary inputs and produces a single binary output. Only four are required.

NOT — one input, inverts it

A	NOT A
0	1
1	0

The only gate with a single input. The output is always the opposite of the input.

AND — output 1 only when ALL inputs are 1

A	B	A AND B
0	0	0
0	1	0
1	0	0
1	1	1

Only one row gives 1. Think of it as the strict gate.

OR — output 1 when AT LEAST ONE input is 1

A	B	A OR B
0	0	0
0	1	1
1	0	1
1	1	1

Only one row gives 0. Note the last row — OR is inclusive, so 1 OR 1 = 1.

XOR — output 1 when EXACTLY ONE input is 1

A	B	A XOR B
0	0	0
0	1	1
1	0	1
1	1	0 ⚠️

XOR is "exclusive OR" — one or the other, but NOT both. The final row is what distinguishes it from OR, and it is the single most examined detail in this subtopic.

The comparison that matters

A	B	AND	OR	XOR
0	0	0	0	0
0	1	0	1	1
1	0	0	1	1
1	1	1	1	0

OR and XOR differ in exactly one row — the last. Everything else is identical.

AQA tip. The specification states plainly that "students do not need to know about or use NAND and NOR logic gates." Learning them is wasted effort, and using them in an answer risks confusion.

Four gates only: NOT, AND, OR, XOR. NAND and NOR are excluded.
NOT has one input and inverts it.
AND outputs 1 only when all inputs are 1.
OR outputs 1 when at least one input is 1, including both.
XOR outputs 1 when exactly one input is 1 — 1 XOR 1 = 0.

See the full worked example for boolean logic →

Logic circuit symbols and diagrams

Four symbols to recognise and draw. Signals flow left to right.

The NOT gate's small circle is what inverts — a triangle without it is just a buffer. XOR is an OR gate with an extra curved line on its back.

How to remember the shapes

Gate	Shape	Memory hook
NOT	Triangle with a circle on the output	The circle means "invert"
AND	Flat back, rounded front — a D shape	D for "anD"
OR	Curved back, pointed front	Points like an arrow
XOR	OR shape with an extra curved line	The extra line means "exclusive"

The circle on the NOT gate is essential — without it the symbol means nothing. Draw it clearly.

Reading a circuit

Signals flow left to right: inputs on the left, gates in the middle, output on the right. Where a wire splits, the same signal goes to both destinations.

AQA tip. When drawing, label every input (A, B, C) and the output (Q). Unlabelled diagrams are hard to mark and risk losing marks even when the logic is right.

Four symbols: NOT (triangle + circle), AND (D shape), OR (pointed), XOR (OR + extra line).
The circle on the NOT gate is what inverts — never omit it.
Circuits contain up to three inputs and use only these four gates.
Signals flow left to right; a split wire carries the same signal to both places.
Always label inputs A, B, C and the output Q.

See the full worked example for boolean logic →

AQA's Boolean expression notation

. for AND, + for OR, ⊕ for XOR, overbar for NOT. Use these exactly.

The specification lists the required operators explicitly:

Operation	AQA symbol	Example
AND	`.` (dot)	`A.B`
OR	`+` (plus)	`A+B`
XOR	`⊕`	`A⊕B`
NOT	overbar	`A̅`

The specification's own worked example

"For example the expression (A AND B) OR (NOT C) would be represented as: A.B + C̅"

Memorise this example. It demonstrates all the conventions at once.

Why `+` does not mean addition

In Boolean algebra the symbols are borrowed from arithmetic but mean something different:

A.B is A AND B, not A multiplied by B.
A+B is A OR B, not A plus B — so 1+1 = 1, not 2.

The notation exists because AND behaves rather like multiplication (1.1 = 1, anything.0 = 0) and OR rather like addition — but they are logic operations, not arithmetic.

Writing the overbar

The overbar goes above the letter or expression it negates:

C̅          means NOT C
A.B        means A AND B
(A.B)‾     means NOT (A AND B)

The position of the overbar matters. A̅.B means (NOT A) AND B, whereas (A.B)‾ means NOT (A AND B) — completely different expressions.

If you cannot draw a clean overbar by hand, write NOT C in words rather than risk an ambiguous mark.

Precedence

As in 3.2.5: NOT first, then AND, then OR. So A + B.C means A OR (B AND C).

Use brackets whenever you mix operators — they cost nothing and remove all ambiguity.

AQA notation: . = AND, + = OR, ⊕ = XOR, overbar = NOT.
The specification's example: (A AND B) OR (NOT C) = A.B + C̅.
+ means OR, not addition — 1+1 = 1 in Boolean algebra.
The overbar's position matters: A̅.B is not the same as (A.B)‾.
Precedence: NOT → AND → OR. Bracket when mixing.

See the full worked example for boolean logic →

Building truth tables for circuits

2ⁿ rows, inputs in binary counting order, one intermediate column per gate.

Step 1 — work out how many rows

$\text{rows} = 2^n \quad \text{where } n = \text{number of inputs}$

Inputs	Rows
2	4
3	8

The specification caps circuits at three inputs, so you will never need more than 8 rows.

Step 2 — list the input combinations systematically

Count up in binary so no combination is missed. For three inputs:

A	B	C
0	0	0
0	0	1
0	1	0
0	1	1
1	0	0
1	0	1
1	1	0
1	1	1

The pattern: the rightmost column alternates every row, the middle every two rows, the leftmost every four. Writing them this way guarantees completeness.

Step 3 — add an intermediate column for each gate

This is the technique that makes complex circuits easy. Do not attempt to evaluate the whole expression in one step.

Worked example: A.B + C̅

A	B	C	A.B	C̅	A.B + C̅
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

Method:

Fill the A.B column — 1 only where both A and B are 1.
Fill the C̅ column — the inverse of C.
Combine the two with OR — 1 where either is 1.

Step 4 — interpret the result

The specification requires you to interpret truth tables. Typical questions:

"For which input combinations is the output 1?" — read off the rows.
"What does this circuit do?" — describe it in words: here, the output is 1 whenever both A and B are on, or C is off.

Number of rows = 2ⁿ; 2 inputs give 4 rows, 3 inputs give 8.
List inputs by counting up in binary so no combination is missed.
Add an intermediate column for each gate — never evaluate in one step.
Fill columns left to right, following the circuit's signal flow.
Intermediate columns are marked separately, so always show them.

See the full worked example for boolean logic →

Converting between circuits and expressions

Both directions are required. Work left to right, or inside out.

The specification requires both conversions: create the expression for a circuit, and create a circuit from an expression.

Circuit → Boolean expression

Method: work left to right, writing the output of each gate as an expression.

Given a circuit where A and B feed an AND gate, C feeds a NOT gate, and both results feed an OR gate:

The AND gate outputs A.B
The NOT gate outputs C̅
The OR gate combines them: A.B + C̅

Label the output of each gate on the diagram as you go. Writing the intermediate expression next to each gate turns a confusing diagram into a simple assembly job.

Boolean expression → circuit

Method: work from the inside out — innermost brackets first.

Given (A + B).C̅:

A + B → an OR gate with inputs A and B
C̅ → a NOT gate with input C
. → an AND gate combining the two outputs

Draw it left to right: inputs on the far left, then the first-level gates, then the combining gate, then the output Q.

A three-input worked conversion

Expression: A ⊕ (B.C)

Innermost: B.C → AND gate taking B and C
Outermost: A ⊕ … → XOR gate taking A and the AND gate's output

Truth table:

A	B	C	B.C	A ⊕ (B.C)
0	0	0	0	0
0	0	1	0	0
0	1	0	0	0
0	1	1	1	1
1	0	0	0	1
1	0	1	0	1
1	1	0	0	1
1	1	1	1	0 ⚠️

Note the final row. Both A and B.C are 1, and XOR of two 1s is 0 — the row that catches people out.

Modifying a circuit

Circuit → expression: work left to right, labelling each gate's output.
Expression → circuit: work inside out, innermost brackets first.
Draw circuits left to right with inputs on the left and output Q on the right.
You must also be able to MODIFY a given circuit.
Check your conversion by tracing one or two input combinations.

See the full worked example for boolean logic →

Quick recap

Four gates only: NOT, AND, OR, XOR. NAND and NOR are explicitly excluded.
NOT inverts; AND needs all inputs 1; OR needs at least one; XOR needs exactly one.
XOR differs from OR in one row only: 1 XOR 1 = 0.
AQA notation: . for AND, + for OR, ⊕ for XOR, overbar for NOT.
The specification's example: (A AND B) OR (NOT C) = A.B + C̅.
Truth tables have 2ⁿ rows — 4 for two inputs, 8 for three.
List input combinations by counting up in binary so none is missed.
Add an intermediate column for each gate; they are marked separately.
Circuit → expression: left to right. Expression → circuit: inside out.

Memorise this

Verbatim phrases and definitions Cambridge mark schemes credit.

Four gates: NOT, AND, OR, XOR. NAND and NOR are NOT required.
AND = 1 only when ALL inputs are 1.
OR = 1 when AT LEAST ONE input is 1 (including both).
XOR = 1 when EXACTLY ONE input is 1 — so 1 XOR 1 = 0.
AQA notation: . = AND, + = OR, ⊕ = XOR, overbar = NOT.
(A AND B) OR (NOT C) is written A.B + C̅.
Rows in a truth table = 2ⁿ (2 inputs → 4 rows, 3 inputs → 8 rows).
Precedence: NOT → AND → OR.
Always add an intermediate column for each gate.

How it’s examined

Take this whole topic with you

Step-by-step worked examples — Boolean logic

Step-by-step solutions to past-paper-style questions on boolean logic, written exactly the way a tutor would explain them at the board.

Question type:

1Complete truth tables for the four gates (4 marks)
Getting startedGraph or diagram• Paper 2 style — 4 marks (AO1)• truth-table, and, or, xor, not
Question
Complete the truth table below for the AND, OR and XOR gates, and state the output of a NOT gate when its input is 0. (4 marks)

A B A.B A+B A⊕B
0 0
0 1
1 0
1 1
Step-by-step solution
1. Step 1
  AND (A.B) outputs 1 only when both inputs are 1, so only the last row is 1.
2. Step 2
  OR (A+B) outputs 1 when at least one input is 1, so only the first row is 0.
3. Step 3
  XOR (A⊕B) outputs 1 when exactly one input is 1 — so the last row is 0, which is where it differs from OR.
4. Step 4
  NOT inverts its single input, so an input of 0 gives an output of 1.
Answer

A B A.B A+B A⊕B
0 0 0 0 0
0 1 0 1 1
1 0 0 1 1
1 1 1 1 0

(1 mark per correct column.)

NOT with input 0 gives output 1 (1). (4)
Examiner tip
The final row of the XOR column is the discriminator — OR and XOR are identical in every other row, so 1 ⊕ 1 = 0 is the single detail that separates them. Note that NAND and NOR are explicitly excluded from this specification.
2Identify logic gate symbols (3 marks)
Getting startedIdentify & classify• Paper 2 style — 3 marks (AO1)• symbols, gates, identify
Question
(a) State the name of the gate drawn as a triangle with a small circle on its output. (b) State the name of the gate with a flat back and a rounded front. (c) State how the XOR symbol differs from the OR symbol. (3 marks)
Step-by-step solution
1. Step 1
  (a) A triangle with a circle on the output is the NOT gate — the circle is what indicates inversion.
2. Step 2
  (b) The D-shaped symbol with a flat back and rounded front is the AND gate.
3. Step 3
  (c) XOR is drawn exactly like OR but with an extra curved line across its back.
Answer
(a) NOT gate — the small circle on the output indicates inversion (1) (b) AND gate (1) (c) The XOR symbol is the same as the OR symbol but with an additional curved line drawn across its back (1) (3)
Examiner tip
The circle on the NOT gate is essential — a triangle without it is not a NOT gate. When drawing circuits, that circle must be clearly visible, and the extra curved line must be present on any XOR gate.
3Use AQA's Boolean notation (3 marks)
Getting startedIdentify & classify• Paper 2 style — 3 marks (AO1)• notation, boolean, expression
Question
(a) State the symbol used for the AND operation. (b) State the symbol used for the OR operation. (c) Write the expression (A AND B) OR (NOT C) using AQA notation. (3 marks)
Step-by-step solution
1. Step 1
  (a) AND is represented by a dot: .
2. Step 2
  (b) OR is represented by a plus: +
3. Step 3
  (c) A AND B is A.B, and NOT C is C with an overbar, giving A.B + C̅ — the specification's own worked example.
Answer
(a) . (a dot) (1) (b) + (a plus) (1) (c) A.B + C̅ (1) (3)
Examiner tip
Part (c) is taken directly from the specification's additional information column and is worth memorising as the model. Note that ⊕ is XOR and an overbar is NOT — symbols from other courses such as ∧ and ∨ are not the ones AQA names.
4Build a truth table for a three-input circuit (5 marks)
Building confidenceGraph or diagram• Paper 2 style — 5 marks (AO2)• truth-table, three-inputs, intermediate-columns
Question
Construct a truth table for the Boolean expression A.B + C̅, including intermediate columns. (5 marks)
Step-by-step solution
1. Step 1
  Work out the number of rows. Three inputs give 2³ = 8 rows.
  $2^3 = 8 \text{ rows}$
2. Step 2
  List the inputs by counting up in binary — 000, 001, 010, 011, 100, 101, 110, 111 — so no combination is missed.
3. Step 3
  Add an intermediate column for A.B — 1 only in the rows where both A and B are 1, which are the last two.
4. Step 4
  Add an intermediate column for C̅ — simply the inverse of C.
5. Step 5
  Combine with OR: the output is 1 wherever either intermediate column is 1.
Answer

A B C A.B C̅ A.B + C̅
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

Marks: correct 8 rows of input combinations (1); correct A.B column (1); correct C̅ column (1); correct final column (2). (5)
Examiner tip
The intermediate columns are marked separately, so they must be shown — attempting to evaluate the whole expression in one step is where errors arise. Note the final row: A.B is 1 and C̅ is 0, and OR of 1 and 0 is 1.
5Write the Boolean expression for a circuit (4 marks)
Building confidenceGraph or diagram• Paper 2 style — 4 marks (AO2)• circuit, expression, convert
Question
A logic circuit is built as follows:

Inputs A and B feed into an OR gate

Input C feeds into a NOT gate

The outputs of the OR gate and the NOT gate feed into an AND gate, producing output Q

(a) Write the Boolean expression for Q. (b) State the output when A = 0, B = 1 and C = 1. (4 marks)
Step-by-step solution
1. Step 1
  Work left to right. The OR gate takes A and B, so its output is A + B.
2. Step 2
  The NOT gate takes C, so its output is C̅.
3. Step 3
  The AND gate combines those two outputs, so Q = (A + B).C̅. The brackets are essential — without them, precedence would evaluate the AND first.
4. Step 4
  (b) Substitute: A + B = 0 + 1 = 1. C̅ = NOT 1 = 0. Then 1 AND 0 = 0.
Answer
(a) Working left to right:

OR gate output = A + B (1)

NOT gate output = C̅ (1)

AND gate combines them: Q = (A + B).C̅ (1)

(b) With A = 0, B = 1, C = 1:

A + B = 0 + 1 = 1

C̅ = NOT 1 = 0

Q = 1 AND 0 = 0 (1) (4)
Examiner tip
The brackets in part (a) carry a mark: without them, A + B.C̅ would mean A OR (B AND NOT C) because AND binds tighter than OR — a completely different circuit. Labelling each gate's output on the diagram as you work is the reliable method.
6Draw a circuit from a Boolean expression (5 marks)
Building confidenceGraph or diagram• Paper 2 style — 5 marks (AO2)• circuit, expression, draw
Question
Describe the logic circuit represented by the expression A ⊕ (B.C), stating which gates are needed, what feeds into each, and complete a truth table for it. (5 marks)
Step-by-step solution
1. Step 1
  Work inside out. The innermost part is B.C, which needs an AND gate taking inputs B and C.
2. Step 2
  The outer operation is A ⊕ …, which needs an XOR gate taking input A and the output of the AND gate.
3. Step 3
  Two gates in total, with the output labelled Q.
4. Step 4
  Build the truth table with an intermediate column for B.C, which is 1 only when both B and C are 1.
5. Step 5
  Apply XOR between A and B.C — output 1 when exactly one of them is 1. Watch the final row, where both are 1 and XOR gives 0.
Answer
The circuit needs two gates:

An AND gate with inputs B and C, producing B.C (1)

An XOR gate with inputs A and the output of the AND gate, producing Q (1)

Truth table:

A B C B.C A ⊕ (B.C)
0 0 0 0 0
0 0 1 0 0
0 1 0 0 0
0 1 1 1 1
1 0 0 0 1
1 0 1 0 1
1 1 0 0 1
1 1 1 1 0

(1 mark for the B.C column, 2 for the final column.) (5)
Examiner tip
The last row is the trap: both A and B.C are 1, and XOR of two 1s is 0. Working inside out — innermost brackets first — is the reliable method for turning an expression into a circuit, and it guarantees the gates end up in the right order.
7Interpret what a circuit does (6 marks)
StretchGraph or diagram• Paper 2 style — 6 marks (AO2/AO3)• interpret, truth-table, application
Question
A machine will only start when a safety guard is closed (input A = 1) and the start button is pressed (input B = 1), but not if the emergency stop is active (input C = 1).

(a) Write a Boolean expression for the output Q. (b) Construct the truth table. (c) State the only input combination for which the machine starts. (6 marks)
Step-by-step solution
1. Step 1
  Translate each requirement. 'Guard closed and button pressed' is A.B.
2. Step 2
  'But not if emergency stop is active' means the emergency stop must be off, which is C̅.
3. Step 3
  All three conditions must hold, so combine with AND: Q = A.B.C̅.
4. Step 4
  Build the table with intermediate columns for A.B and C̅.
5. Step 5
  The output is 1 only where all three are satisfied — A = 1, B = 1 and C = 0.
6. Step 6
  Interpret it as a rule about the world: the machine starts only when the guard is closed, the button is pressed and the emergency stop is not active.
Answer
(a) Q = A.B.C̅ (2 marks — 1 for A.B, 1 for .C̅)

(b)

A B C A.B C̅ Q
0 0 0 0 1 0
0 0 1 0 0 0
0 1 0 0 1 0
0 1 1 0 0 0
1 0 0 0 1 0
1 0 1 0 0 0
1 1 0 1 1 1
1 1 1 1 0 0

(3 marks)

(c) The machine starts only when A = 1, B = 1 and C = 0 — that is, when the guard is closed, the button is pressed and the emergency stop is not active (1). (6)
Examiner tip
This is what 'interpret the results of simple truth tables' means in practice — reading the table as a rule about a real system. The emergency stop is the discriminator: 'must not be active' becomes C̅, so the output is 1 only when C is 0, which correctly makes the stop override everything else.
8Modify a circuit to meet a new requirement (6 marks)
StretchGraph or diagram• Paper 2 style — 6 marks (AO3)• modify, circuit, expression
Question
A circuit currently implements A + B.

(a) State the change needed so the output is 1 only when exactly one of A and B is 1. (b) State the change needed so the output is 1 only when both A and B are 1. (c) State the change needed so the output is 1 only when neither A nor B is 1, and write the Boolean expression. (6 marks)
Step-by-step solution
1. Step 1
  (a) 'Exactly one' is precisely what XOR does, so replace the OR gate with an XOR gate.
2. Step 2
  Expression becomes A ⊕ B — identical to OR except when both inputs are 1, where XOR gives 0.
3. Step 3
  (b) 'Both' is what AND does, so replace the OR gate with an AND gate, giving A.B.
4. Step 4
  (c) 'Neither' means the output is 1 only when A = 0 and B = 0 — which is the inverse of OR.
5. Step 5
  So keep the OR gate and add a NOT gate on its output.
6. Step 6
  The expression is (A + B)‾ — note the overbar covers the whole bracket, not just one variable.
Answer
(a) Replace the OR gate with an XOR gate (1). The expression becomes A ⊕ B, which is 1 when exactly one input is 1 and 0 when both are (1).

(b) Replace the OR gate with an AND gate (1), giving A.B, which is 1 only when both inputs are 1 (1).

(c) Keep the OR gate but add a NOT gate on its output (1). The expression is (A + B)‾ — the overbar covers the entire bracket, so the output is 1 only when the OR result is 0, which happens only when both A and B are 0 (1). (6)
Examiner tip
Part (c) tests the position of the overbar: (A + B)‾ means NOT(A OR B), whereas A̅ + B̅ means (NOT A) OR (NOT B) — a genuinely different function. The specification requires students to modify circuits as well as read them, so being able to redraw is essential.
9Analyse a combined expression (6 marks)
StretchGraph or diagram• Paper 2 style — 6 marks (AO2/AO3)• truth-table, xor, complex, interpret
Question
Construct a truth table for (A ⊕ B) + (A.C̅) and state for how many input combinations the output is 1. (6 marks)
Step-by-step solution
1. Step 1
  Three inputs give 8 rows. List them by counting up in binary.
2. Step 2
  Column 1 — A ⊕ B: 1 when exactly one of A and B is 1, so rows where A and B differ.
3. Step 3
  Column 2 — C̅: the inverse of C.
4. Step 4
  Column 3 — A.C̅: 1 only where A is 1 and C̅ is 1, meaning A = 1 and C = 0.
5. Step 5
  Final column — OR the two bracketed results: 1 wherever either is 1.
6. Step 6
  Count the 1s in the output column to answer the final part.
Answer

A B C A⊕B C̅ A.C̅ Output
0 0 0 0 1 0 0
0 0 1 0 0 0 0
0 1 0 1 1 0 1
0 1 1 1 0 0 1
1 0 0 1 1 1 1
1 0 1 1 0 0 1
1 1 0 0 1 1 1
1 1 1 0 0 0 0

Marks: A⊕B column (1); C̅ column (1); A.C̅ column (1); final output column (2).

The output is 1 for 5 of the 8 input combinations (1). (6)
Examiner tip
Building this in four separate columns makes an otherwise daunting expression routine — attempting it in one step almost guarantees an error. The row A=1, B=1, C=0 is instructive: A⊕B is 0 because both are 1, but A.C̅ is 1, so the OR still gives an output of 1.

A	B	C	A.B	C̅	Q
0	0	0	0	1	0
0	0	1	0	0	0
0	1	0	0	1	0
0	1	1	0	0	0
1	0	0	0	1	0
1	0	1	0	0	0
1	1	0	1	1	1
1	1	1	1	0	0

A	B	C	A⊕B	C̅	A.C̅	Output
0	0	0	0	1	0	0
0	0	1	0	0	0	0
0	1	0	1	1	0	1
0	1	1	1	0	0	1
1	0	0	1	1	1	1
1	0	1	1	0	0	1
1	1	0	0	1	1	1
1	1	1	0	0	0	0

Model Answers — Boolean logic

High-scoring sample answers for boolean logic on the AQA GCSE 8525 paper, with examiner-style notes mapping each response to the mark scheme and assessment objectives.

Question 1
Paper 2 style — AO12 marks
State the difference between an OR gate and an XOR gate. (2 marks)
Model answer
An OR gate outputs 1 when at least one input is 1, including when both are 1 (1).

An XOR gate outputs 1 when exactly one input is 1, so when both inputs are 1 its output is 0 (1).
Why this scores
The two gates are identical in three of the four rows — the only difference is when both inputs are 1. That single row is what the mark is for, so it must be stated explicitly rather than implied.
Question 2
Paper 2 style — AO22 marks
Write the Boolean expression for (A OR B) AND (NOT C) using AQA notation. (2 marks)
Model answer
(A + B).C̅ (2 marks — 1 for A + B in brackets, 1 for .C̅)

The brackets are essential: without them the expression would be read as A + (B.C̅), because AND binds more tightly than OR.
Why this scores
Compare with the specification's own example, A.B + C̅, which represents (A AND B) OR (NOT C) — the operators are swapped here, and so the brackets move. The brackets are what fix which gate acts first.
Question 3
Paper 2 style — AO22 marks
A logic circuit has three inputs. State how many rows its truth table will have, and explain why. (2 marks)
Model answer
It will have 8 rows (1). Each of the three inputs can independently be 0 or 1, so the number of possible combinations is 2³ = 8 (1).
Why this scores
The specification caps circuits at three inputs, so 8 rows is the maximum ever required. Listing the combinations by counting up in binary — 000, 001, 010, 011, 100, 101, 110, 111 — guarantees none is missed.
Question 4
Paper 2 style — AO23 marks
Complete a truth table for the expression A̅ + B, showing the intermediate column. (3 marks)
Model answer

A B A̅ A̅ + B
0 0 1 1
0 1 1 1
1 0 0 0
1 1 0 1

Marks: correct A̅ column (1); correct final column (2).

The output is 0 only when A = 1 and B = 0.
Why this scores
The intermediate A̅ column carries a mark of its own and makes the OR step straightforward. Note the overbar applies only to A, not to the whole expression — (A + B)‾ would give a completely different table.
Question 5
Paper 2 style — AO23 marks
In a circuit, inputs A and B feed an XOR gate, and the output of that XOR gate feeds a NOT gate to produce output Q.

Write the Boolean expression for Q and state the output when A = 1 and B = 1. (3 marks)
Model answer
The XOR gate produces A ⊕ B, and the NOT gate inverts it, so:

Q = (A ⊕ B)‾ (2 marks)

With A = 1 and B = 1: A ⊕ B = 0 (since XOR of two 1s is 0), and NOT 0 = 1, so Q = 1 (1).
Why this scores
The overbar must cover the whole bracket, since the NOT gate acts on the XOR's output rather than on either input individually. This circuit outputs 1 whenever the two inputs are the same, which is the logical opposite of XOR.
Question 6
Paper 2 style — AO2/AO33 marks
A truth table for a two-input circuit shows an output of 1 only when both inputs are 0. State the Boolean expression for this circuit and describe the gates required. (3 marks)
Model answer
Output 1 only when both inputs are 0 is the inverse of OR, since OR gives 0 only in that same case (1).

The expression is (A + B)‾ (1).

The circuit needs an OR gate taking inputs A and B, with a NOT gate connected to its output (1).
Why this scores
Working from a truth table back to a circuit is the reverse of the usual direction and tests genuine understanding. The alternative expression A̅.B̅ — NOT A AND NOT B — produces the identical truth table and is equally creditworthy.
Question 7
Paper 2 style — AO26 marks
Construct a truth table for (A.B) ⊕ C, showing intermediate columns, and state for how many input combinations the output is 1. (6 marks)
Model answer

A B C A.B (A.B) ⊕ C
0 0 0 0 0
0 0 1 0 1
0 1 0 0 0
0 1 1 0 1
1 0 0 0 0
1 0 1 0 1
1 1 0 1 1
1 1 1 1 0

Marks: correct 8 input combinations (1); correct A.B column (2); correct final column (2).

The output is 1 for 4 of the 8 combinations (1).
Why this scores
The final row is the discriminator: A.B is 1 and C is 1, and XOR of two 1s is 0. The A.B column is 1 in only the last two rows, which makes the XOR step straightforward once that intermediate column is written out.
Question 8
Paper 2 style — AO36 marks
A greenhouse ventilation fan should switch on when the temperature is high (A = 1) or the humidity is high (B = 1), but not when the window is already open (C = 1).

(a) Write a Boolean expression for the fan output Q. (b) Describe the gates required. (c) State whether the fan is on when A = 1, B = 0, C = 1, showing your working. (6 marks)
Model answer
(a) 'Temperature high or humidity high' is A + B (1). 'But not when the window is open' means C must be 0, which is C̅ (1). Both conditions must hold, so:

Q = (A + B).C̅ (1)

(b) The circuit needs:

an OR gate with inputs A and B

a NOT gate with input C

an AND gate combining the outputs of those two gates to produce Q (1)

(c) With A = 1, B = 0, C = 1:

A + B = 1 + 0 = 1

C̅ = NOT 1 = 0 (1)

Q = 1 AND 0 = 0, so the fan is off (1)

This is correct behaviour: the window is already open, so the fan is not needed.
Why this scores
Translating a real requirement into logic is the AO3 skill here. The word 'not' signals an overbar, and the brackets are essential — A + B.C̅ would mean A OR (B AND NOT C), which would switch the fan on whenever the temperature was high regardless of the window.
Question 9
Paper 2 style — AO36 marks
Explain the difference between the expressions A̅.B and (A.B)‾, using a truth table to support your answer. (6 marks)
Model answer
The difference is what the overbar covers. In A̅.B the overbar applies only to A, so the expression means (NOT A) AND B (1). In (A.B)‾ the overbar applies to the whole bracket, so it means NOT (A AND B) — the AND is performed first and the result is then inverted (1).

A B A̅ A̅.B A.B (A.B)‾
0 0 1 0 0 1
0 1 1 1 0 1
1 0 0 0 0 1
1 1 0 0 1 0

(2 marks for the table)

The two columns differ in three of the four rows (1), so these are genuinely different functions despite using the same two variables and looking superficially similar. A̅.B is 1 only when A is 0 and B is 1, whereas (A.B)‾ is 1 in every case except when both are 1 (1).
Why this scores
The position of the overbar is one of the most consequential details in Boolean notation, and this comparison makes the difference unmistakable. When writing by hand, if a clean overbar cannot be drawn it is safer to write NOT (A AND B) in words than to risk an ambiguous mark.

A	B	A̅	A̅ + B
0	0	1	1
0	1	1	1
1	0	0	0
1	1	0	1

A	B	A̅	A̅.B	A.B	(A.B)‾
0	0	1	0	0	1
0	1	1	1	0	1
1	0	0	0	0	1
1	1	0	0	1	0

Key Formulae — Boolean logic

The formulae you need to memorise for boolean logic on the AQA GCSE 8525 paper, with every variable defined in plain English and a note on when to use it.

Number of rows in a truth table
$\text{rows} = 2^n$
$n$
The number of inputs to the circuit
$Limit$
AQA caps circuits at 3 inputs, so a maximum of 8 rows
When to use
Before starting any truth table, to know how many rows to draw. List the input combinations by counting up in binary so none is missed.
Example
2 inputs → 2² = 4 rows; 3 inputs → 2³ = 8 rows
AQA Boolean expression notation
$A.B = \text{AND} \;\;|\;\; A+B = \text{OR} \;\;|\;\; A \oplus B = \text{XOR} \;\;|\;\; \overline{A} = \text{NOT}$
$.$
AND — output 1 only when all inputs are 1
$+$
OR — output 1 when at least one input is 1
$⊕$
XOR — output 1 when exactly one input is 1
$overbar$
NOT — inverts the value beneath it
When to use
Writing any Boolean expression. These are the operators the specification names, so alternatives from other courses risk losing marks.
Example
(A AND B) OR (NOT C) is written A.B + C̅

Key Definitions and Keywords — Boolean logic

Definitions to memorise and the exact keywords mark schemes credit for boolean logic answers — sharpened from recent examiner reports for the 2026 AQA GCSE 8525 sitting.

Logic gate
Examiner keyword
An electronic component that takes one or more binary inputs and produces a single binary output. The four required are NOT, AND, OR and XOR.
Related: Truth table, Logic circuit
NOT gate
Examiner keyword
A gate with a single input whose output is the inverse of that input. Drawn as a triangle with a small circle on the output; written with an overbar.
Example
NOT 0 = 1; NOT 1 = 0
Related: Logic gate, Overbar
AND gate
Examiner keyword
A gate whose output is 1 only when all of its inputs are 1. Drawn with a flat back and rounded front; written with a dot.
Example
A.B is 1 only when A = 1 and B = 1.
Related: OR gate, Logic gate
OR gate
Examiner keyword
A gate whose output is 1 when at least one input is 1, including when both are. Drawn with a curved back and pointed front; written with a plus.
Example
A+B is 0 only when both A and B are 0.
Related: XOR gate, AND gate
XOR gate
Examiner keyword
Exclusive OR. Its output is 1 when exactly one input is 1, so an input of 1 and 1 gives 0. Drawn like an OR gate with an extra curved line; written with ⊕.
Example
1 ⊕ 1 = 0, which is the only row where XOR differs from OR.
Related: OR gate, Logic gate
Truth table
Examiner keyword
A table listing every possible combination of inputs and the resulting output. A circuit with n inputs needs 2ⁿ rows, and AQA caps circuits at three inputs.
Related: Logic gate, Intermediate column
Intermediate column
Examiner keyword
A column in a truth table showing the output of one gate part-way through a circuit. Marked separately, so it should always be shown.
Example
A column for A.B before combining it with C̅.
Related: Truth table, Logic circuit
Logic circuit
Examiner keyword
A diagram showing how gates are connected, with inputs on the left, gates in the middle and the output on the right. AQA circuits use up to three inputs and only NOT, AND, OR and XOR.
Related: Logic gate, Boolean expression
Boolean expression
Examiner keyword
An algebraic way of writing a logic circuit using AQA's operators: . for AND, + for OR, ⊕ for XOR and an overbar for NOT.
Example
(A AND B) OR (NOT C) is written A.B + C̅
Related: Logic circuit, Overbar
Overbar
Examiner keyword
The notation for NOT, written above the variable or expression it negates. Its position matters: A̅.B is not the same as (A.B)‾.
Related: NOT gate, Boolean expression
Input
A binary signal entering a logic gate or circuit, labelled A, B or C. Each can be 0 or 1, so n inputs give 2ⁿ combinations.
Related: Output, Truth table
Output
The single binary signal produced by a gate or circuit, conventionally labelled Q in a circuit diagram.
Related: Input, Logic gate
Operator precedence
Examiner keyword
The order in which Boolean operators are applied: NOT first, then AND, then OR. Brackets override this and should be used whenever operators are mixed.
Example
A + B.C means A OR (B AND C).
Related: Boolean expression

Common Mistakes and Misconceptions — Boolean logic

The traps other students keep falling into on boolean logic questions — taken from recent AQA GCSE 8525 examiner reports and mark schemes — and how to avoid them.

✕Filling in the XOR column exactly like the OR column, giving 1 when both inputs are 1.
AQA 8525 specification 3.4.2 requires truth tables for XOR alongside NOT, AND and OR.
Why it happens
The two gates agree in three of the four rows, and everyday English 'or' is usually inclusive — so the one row where they differ is easy to overlook.
How to avoid it
XOR means exclusive OR: one or the other, but not both. The row to watch is always the last one, where 1 ⊕ 1 = 0. After completing an XOR column, check that final row specifically before moving on.
✕Using symbols from other courses, such as ∧ for AND, ∨ for OR or ¬ for NOT.
AQA 8525 specification 3.4.2 additional information lists the exact Boolean expression operators students are expected to use.
Why it happens
These symbols appear widely in mathematics and in other computing qualifications, so students who have met them elsewhere transfer them across.
How to avoid it
The specification names the operators it expects: . for AND, + for OR, ⊕ for XOR and an overbar for NOT. Learn the worked example A.B + C̅ as the model and use those symbols exclusively.
✕Writing the overbar over the wrong part of an expression — A̅.B when (A.B)‾ was meant.
Expression questions require the overbar to be positioned correctly, and an ambiguous bar cannot be credited.
Why it happens
Both look similar at a glance and use the same symbols, and a hand-drawn overbar is easy to draw too short or too long.
How to avoid it
The overbar covers exactly what it sits above. A̅.B is (NOT A) AND B, whereas (A.B)‾ is NOT (A AND B) — and their truth tables differ in three of four rows. Draw the bar deliberately, and if a clean one is not possible, write NOT (A AND B) in words instead.
✕Attempting to complete a truth table for a circuit in a single step, without intermediate columns.
Truth table mark schemes award intermediate columns independently of the final output column.
Why it happens
The expression looks short enough to evaluate mentally, and adding extra columns feels like unnecessary work under time pressure.
How to avoid it
Add one intermediate column per gate and fill them left to right, following the circuit. Mark schemes credit these columns separately, so showing them protects marks even if the final column slips — and it is where most errors are prevented in the first place.
✕Drawing a NOT gate as a plain triangle without the small circle on its output.
AQA 8525 specification 3.4.2 states that students are expected to understand and use the given logic circuit symbols.
Why it happens
The triangle is the visually dominant part of the symbol, so the circle reads as decoration rather than as the element carrying the meaning.
How to avoid it
The circle is what indicates inversion — a triangle alone is a buffer, which does nothing. Draw the circle clearly on the output side. The same applies to any inverted output in a circuit diagram.
✕Spending revision time on NAND and NOR gates.
AQA 8525 specification 3.4.2 additional information: 'Students do not need to know about or use NAND and NOR logic gates.'
Why it happens
NAND and NOR appear prominently in wider reading and in other specifications, where they are often presented as fundamental building blocks.
How to avoid it
The specification states plainly that students do not need to know about or use NAND and NOR logic gates. Only NOT, AND, OR and XOR appear in circuits and expressions, so revision time is better spent on XOR's behaviour and on the notation.

A	B	A.B	A+B	A⊕B
0	0
0	1
1	0
1	1

A	B	A.B	A+B	A⊕B
0	0	0	0	0
0	1	0	1	1
1	0	0	1	1
1	1	1	1	0

A	B	A.B	A+B	A⊕B
0	0
0	1
1	0
1	1

A	B	A.B	A+B	A⊕B
0	0	0	0	0
0	1	0	1	1
1	0	0	1	1
1	1	1	1	0

Boolean logic

Detailed Study Notes

At a glance

What you’ll learn

The four logic gates and their truth tables

NOT — one input, inverts it

AND — output 1 only when ALL inputs are 1

OR — output 1 when AT LEAST ONE input is 1

XOR — output 1 when EXACTLY ONE input is 1

The comparison that matters

Logic circuit symbols and diagrams

How to remember the shapes

Reading a circuit

AQA's Boolean expression notation

The specification's own worked example

Why + does not mean addition

Writing the overbar

Precedence

Building truth tables for circuits

Step 1 — work out how many rows

Step 2 — list the input combinations systematically

Step 3 — add an intermediate column for each gate

Step 4 — interpret the result

Converting between circuits and expressions

Circuit → Boolean expression

Boolean expression → circuit

A three-input worked conversion

Modifying a circuit

Quick recap

Memorise this

How it’s examined

Take this whole topic with you

1Complete truth tables for the four gates (4 marks)

2Identify logic gate symbols (3 marks)

3Use AQA's Boolean notation (3 marks)

4Build a truth table for a three-input circuit (5 marks)

5Write the Boolean expression for a circuit (4 marks)

6Draw a circuit from a Boolean expression (5 marks)

7Interpret what a circuit does (6 marks)

8Modify a circuit to meet a new requirement (6 marks)

9Analyse a combined expression (6 marks)

Number of rows in a truth table

AQA Boolean expression notation

Logic gate

NOT gate

AND gate

OR gate

XOR gate

Truth table

Intermediate column

Logic circuit

Boolean expression

Overbar

Input

Output

Operator precedence

✕Filling in the XOR column exactly like the OR column, giving 1 when both inputs are 1.

✕Using symbols from other courses, such as ∧ for AND, ∨ for OR or ¬ for NOT.

✕Writing the overbar over the wrong part of an expression — A̅.B when (A.B)‾ was meant.

✕Attempting to complete a truth table for a circuit in a single step, without intermediate columns.

✕Drawing a NOT gate as a plain triangle without the small circle on its output.

✕Spending revision time on NAND and NOR gates.

Boolean logic

Detailed Study Notes

At a glance

What you’ll learn

The four logic gates and their truth tables

NOT — one input, inverts it

AND — output 1 only when ALL inputs are 1

OR — output 1 when AT LEAST ONE input is 1

XOR — output 1 when EXACTLY ONE input is 1

The comparison that matters

Logic circuit symbols and diagrams

How to remember the shapes

Reading a circuit

AQA's Boolean expression notation

The specification's own worked example

Why + does not mean addition

Writing the overbar

Precedence

Why `+` does not mean addition

✕Using symbols from other courses, such as `∧` for AND, `∨` for OR or `¬` for NOT.

✕Writing the overbar over the wrong part of an expression — `A̅.B` when `(A.B)‾` was meant.

Why `+` does not mean addition