Skip to main content
EnglandComputer ScienceSyllabus dot point

How do logic gates make decisions inside a computer?

Understand the AND, OR and NOT logic gates, construct and interpret truth tables, and build and read simple logic circuits.

A focused answer to AQA GCSE Computer Science 3.4.2, covering the AND, OR and NOT logic gates, constructing and interpreting truth tables, and building and reading simple logic circuits.

Generated by Claude Opus 4.88 min answer

Reviewed by: AI editorial process; not yet individually human-reviewed

Have a quick question? Jump to the Q&A page

Jump to a section
  1. What this dot point is asking
  2. Logic gates
  3. The three gates
  4. Truth tables
  5. Logic circuits
  6. Reading a logic circuit diagram
  7. Why logic gates matter
  8. Try this

What this dot point is asking

AQA wants you to know the AND, OR and NOT logic gates, build and read truth tables for them, and interpret simple logic circuits and Boolean expressions that combine the gates.

Logic gates

The three gates

Truth tables

The AND, OR and NOT truth tables are:

AND          OR           NOT
A B | Out    A B | Out    A | Out
0 0 |  0     0 0 |  0      0 |  1
0 1 |  0     0 1 |  1      1 |  0
1 0 |  0     1 0 |  1
1 1 |  1     1 1 |  1

Logic circuits

You may be given a circuit or a Boolean expression that combines gates, such as Q=(A AND B) OR NOT CQ = (A \text{ AND } B) \text{ OR NOT } C, and asked to complete its truth table. The reliable method is to add a column for each gate, fill the intermediate columns first, then combine them for the final output.

Reading a logic circuit diagram

In the exam a circuit may be drawn with gate symbols rather than written as an expression. The standard symbols are a flat-backed D shape for AND, a curved-backed shield for OR, and a triangle with a small circle on the output for NOT (the circle means "invert"). To work out the output, label the value on every wire: start from the inputs on the left, write the output of each gate on its output wire, and carry those values forward into the next gate until you reach the final output on the right. Converting the diagram into a written expression first, such as (A AND B) OR NOT C(A \text{ AND } B) \text{ OR NOT } C, often makes the truth table easier to complete.

Why logic gates matter

Logic gates are not just an abstract exercise: they are how the processor actually computes. The arithmetic logic unit adds binary numbers using circuits built from AND, OR and NOT gates (a half adder uses an AND and an exclusive-OR), and memory cells, decision-making and control signals are all built from the same building blocks. This is the link back to why computers use binary: two-state signals (0 and 1) flow through gates that follow fixed logical rules, so complex behaviour is built from these few simple components.

Try this

Q1. State the output of an AND gate when both inputs are 1. [1 mark]

  • Cue. 1.

Q2. Complete the output column for an OR gate with inputs (0,0), (0,1), (1,0), (1,1). [2 marks]

  • Cue. 0, 1, 1, 1.

Exam-style practice questions

Practice questions written in the style of AQA exam questions on this dot point, with worked answer explainers. The year tag is the paper they imitate, not the source.

AQA 20214 marksA logic circuit has the Boolean expression Q = (A AND B) OR (NOT C). Complete a truth table showing the output Q for the input combination A = 1, B = 0, C = 0, and for A = 1, B = 1, C = 1. Show the value of each intermediate gate.
Show worked answer →

Work each gate in turn. For A = 1, B = 0, C = 0: A AND B =1 AND 0=0= 1 \text{ AND } 0 = 0; NOT C =NOT 0=1= \text{NOT } 0 = 1; so Q =0 OR 1=1= 0 \text{ OR } 1 = 1.

For A = 1, B = 1, C = 1: A AND B =1 AND 1=1= 1 \text{ AND } 1 = 1; NOT C =NOT 1=0= \text{NOT } 1 = 0; so Q =1 OR 0=1= 1 \text{ OR } 0 = 1.

Both give Q = 1. Markers reward showing the intermediate values of A AND B and NOT C, then combining them with the final OR. Working gate by gate earns method marks even if one final value slips.

AQA 20193 marksConstruct the complete truth table for the Boolean expression Q = NOT (A OR B), showing all input combinations and the output.
Show worked answer →

Two inputs give four rows. First compute A OR B, then invert it with NOT.

A=0,B=0: A OR B =0= 0, so Q =NOT 0=1= \text{NOT } 0 = 1. A=0,B=1: A OR B =1= 1, Q =0= 0. A=1,B=0: A OR B =1= 1, Q =0= 0. A=1,B=1: A OR B =1= 1, Q =0= 0.

So Q is 1 only when both inputs are 0 (this gate is a NOR). Markers reward all four input rows present, the intermediate OR column, and the correct inverted output.

Related dot points

Sources & how we know this