Why are NAND and NOR gates called 'universal'?

They are called universal because any other logic gate (AND, OR, NOT, XOR) can be created by combining only NAND gates, or only NOR gates. For example, a NOT gate can be made by connecting both inputs of a NAND gate together. This is very efficient for manufacturing, as factories only need to produce one type of gate.

What is the main difference between an OR gate and an XOR gate?

An OR gate gives a TRUE (1) output if one OR both inputs are TRUE. An XOR (Exclusive OR) gate gives a TRUE output only if the inputs are different (one is TRUE and the other is FALSE). If both inputs are TRUE, an XOR gate gives a FALSE (0) output, whereas an OR gate would give a TRUE (1) output.

How do I know which Boolean algebra rule to apply when simplifying?

This comes with practice. A good strategy is to first look for opportunities to apply De Morgan's laws to break up negated brackets. Then, expand any remaining brackets using the distributive law. After that, look for common patterns like $A + \neg{A} = 1$, $A \cdot A = A$, or opportunities to factor out common variables. Always aim to reduce the number of terms or variables.

Do I need to memorise the IEC symbols for the exam?

Yes, you must be able to recognise and draw the standard IEC 60617-12 symbols for all the gates (the rectangular shapes). While older, distinctively shaped symbols (like the D-shape for AND) are sometimes seen, the IEC standard is what Cambridge International specifies and expects in exam answers.

Where can I learn Logic Gates and Logic Circuits for Cambridge 9618?

This free lesson on MarkScheme covers syllabus point 3.2 (Logic Gates and Logic Circuits) for Cambridge A-Level Computer Science. It includes visual revision, key points, and links to real past-paper questions with mark-scheme marking at markscheme.app/courses/9618/3-2-logic-gates-and-logic-circuits.

Is Logic Gates and Logic Circuits (3.2) on 9618 free to study?

Yes. The Computer Science 9618 course on MarkScheme is 100% free — including premium visual lessons, exam tips, and past-paper marking. No paywall for Logic Gates and Logic Circuits.

Logic Gates and Logic Circuits 9618 — Free…

Logic Gates and Logic Circuits

Welcome to the world of digital logic, the foundation upon which all modern computing is built. At the most fundamental level, a computer processes information using simple electronic switches. In this lesson, we will explore how these switches are organised into logic gates, and how these gates are combined to form logic circuits capable of performing complex calculations and decisions. Understanding this topic is key to grasping how computer hardware functions.

BY THE END, YOU CAN…

1Understand and define the function of the six main logic gates: NOT, AND, OR, NAND, NOR, and XOR.
2Construct truth tables for individual gates and for complex logic circuits with multiple inputs.
3Draw, interpret, and produce logic circuits using the standard IEC 60617-12 symbols.
4Simplify logic circuits using Boolean algebra, including De Morgan's laws, to create more efficient designs.

In simple terms

A friendly intro before the formal notes — no formulas yet.

The Building Blocks of Logic

Logic gates are simple electronic circuits that take one or more binary inputs and produce a single binary output. By combining these gates, we can build complex systems that perform everything from simple arithmetic to running a full operating system.

THINK OF IT LIKE…

Imagine you have two light switches controlling one bulb. If they must both be ON for the bulb to light up, that's an AND gate (switches in series). If either one being ON is enough to light the bulb, that's an OR gate (switches in parallel). A NOT gate is like a switch that turns the bulb ON when the switch is OFF, and vice-versa.

1
Basic gates like NOT, AND, and OR have defined behaviours. Their output for every possible combination of inputs is captured in a truth table.
2
NAND and NOR gates are 'universal'. This means you can construct any other logic gate, and therefore any logic circuit, using only NAND gates or only NOR gates.
3
Boolean algebra is the mathematics used to analyse and simplify logic circuits. Key rules, like De Morgan's laws, allow us to find equivalent circuits with fewer gates, saving cost and power.
4
Logic circuits are combinations of gates designed to perform specific tasks. These range from simple adders in a CPU to complex control logic in memory systems.

Explore the concept

Use the live diagram and synced steps — play it or tap a step card to walk through.

Key formulas

Tap any symbol to reveal exactly what it means and its units.

A + 0 = A

Full topic notes

Formal explanation with the rigour you need for the exam.

The Fundamental Logic Gates

There are several fundamental logic gates, each performing a simple operation. They operate on binary values: 0 (False, Off) and 1 (True, On). For your exam, you must know the name, symbol, and function of each. The three most basic gates are NOT, AND, and OR.

NOT Gate: Has one input and one output. It inverts the input. If input A is 1, output X is 0. If A is 0, X is 1. Boolean expression: $X = \neg{A}$ .
AND Gate: Has two or more inputs and one output. The output is 1 only if all inputs are 1. Boolean expression: $X = A \cdot B$ .
OR Gate: Has two or more inputs and one output. The output is 1 if any input is 1. Boolean expression: $X = A + B$ .

Compound and Universal Gates

By combining the basic gates, we can create more complex ones. The NAND (NOT-AND) and NOR (NOT-OR) gates are crucial because they are 'universal gates'. This means any logic circuit can be constructed using only NAND gates, or only NOR gates. The XOR (Exclusive-OR) gate is also very common, particularly in arithmetic circuits.

NAND Gate: The output is the opposite of an AND gate. It is 0 only when all inputs are 1. Boolean expression: $X = \neg{(A \cdot B)}$ .
NOR Gate: The output is the opposite of an OR gate. It is 1 only when all inputs are 0. Boolean expression: $X = \neg{(A + B)}$ .
XOR Gate: The output is 1 only if the inputs are different. If inputs A and B are both 0 or both 1, the output is 0. Boolean expression: $X = A \oplus B$ .

From Gates to Circuits: Boolean Algebra

Boolean algebra is the mathematical system used to analyse and simplify logic circuits. Using a set of laws and identities, we can manipulate Boolean expressions to create circuits that are simpler, cheaper, and faster. This is a vital skill for hardware design and a common exam topic. The most powerful rules for simplification are De Morgan's Laws.

Key Boolean Identities:\nIdentity: $A + 0 = A$ , $A \cdot 1 = A$ \nAnnulment: $A + 1 = 1$ , $A \cdot 0 = 0$ \nIdempotent: $A + A = A$ , $A \cdot A = A$ \nComplement: $A + \neg{A} = 1$ , $A \cdot \neg{A} = 0$ \nCommutative: $A + B = B + A$ , $A \cdot B = B \cdot A$ \nAssociative: $(A+B)+C = A+(B+C)$ , $(A \cdot B) \cdot C = A \cdot (B \cdot C)$ \nDistributive: $A \cdot (B+C) = A \cdot B + A \cdot C$ , $A + (B \cdot C) = (A+B) \cdot (A+C)$ \nAbsorption: $A + (A \cdot B) = A$ , $A \cdot (A+B) = A$ \nDe Morgan's Laws: $\neg{(A \cdot B)} = \neg{A} + \neg{B}$ , $\neg{(A + B)} = \neg{A} \cdot \neg{B}$

Worked examples

See the formulas applied — reveal one step at a time, like the exam.

EXAMPLE 1

A logic circuit is represented by the Boolean expression $X = (A \cdot B) + (\neg{B} \cdot C)$ .

(i) Draw the logic circuit for this expression. [3 marks] (ii) Complete the truth table for this circuit. [4 marks]

1
(i) To draw the circuit, we identify the gates needed: two AND gates, one NOT gate, and one OR gate.
- The first AND gate takes inputs A and B.
- The NOT gate takes input B to produce $\neg{B}$ .
- The second AND gate takes inputs $\neg{B}$ and C.
- The OR gate takes the outputs of the two AND gates to produce the final output X.

EXAMPLE 2

Simplify the following Boolean expression using algebraic laws. Draw the logic circuit for the original expression and the simplified expression.

$X = (A + B) \cdot (A + \neg{B})$

1
Original Expression: $X = (A + B) \cdot (A + \neg{B})$

How it all connects

The big idea sits in the middle — tap a linked idea to explore the link.

MAIN IDEALogic Gates and Logic Circuits

Tap a linked idea to see how it connects back to the main topic — that connection is what examiners reward.

Glossary

Try to recall each definition before you reveal it.

Quick check

Answer in your head first — then tap to check. No pressure.

Revision flashcards

Flip the card. Test yourself before the exam.

QUESTION · 1 / 12

What is a logic gate?

TAP OR SPACE TO FLIP

ANSWER

An electronic component that performs a basic logical function, taking one or more binary inputs (0 or 1) to produce a single binary output.

TAP OR SPACE TO FLIP BACK

1 / 12 · ← → space

Key takeaways

Review these before you close the topic — retrieval beats re-reading.

✓
NOT Gate: Has one input and one output. It inverts the input. If input A is 1, output X is 0. If A is 0, X is 1. Boolean expression: $X = \neg{A}$ .
✓
AND Gate: Has two or more inputs and one output. The output is 1 only if all inputs are 1. Boolean expression: $X = A \cdot B$ .
✓
OR Gate: Has two or more inputs and one output. The output is 1 if any input is 1. Boolean expression: $X = A + B$ .

Practice — then mark it

The whole point: a real Cambridge question, marked mark-by-mark.

Real past paper[0]

Test Your Knowledge on Logic Gates

Do it on paper → mark itMARKED MARK-BY-MARK · B1 / M1 / A1 · OFFICIAL SCHEME

Extra simulations & links

PhET, GeoGebra and other curated tools — open in a new tab.

Frequently asked

✓

Checkpoint

One marked question is worth ten re-reads — close the loop before you move on.

Checkpoint

Reading it isn’t knowing it — prove it.

Before you move on: do Test Your Knowledge on Logic Gates on paper, snap a photo, and get examiner-style feedback on exactly where you win and lose marks.

Attempt & get marked →Takes about a minute · you’ll land back on this lesson

← PREVIOUS3.1 Computers and their components NEXT →4.1 Central Processing Unit (CPU) Architecture

Logic Gates and Logic Circuits

BY THE END, YOU CAN…

1Understand and define the function of the six main logic gates: NOT, AND, OR, NAND, NOR, and XOR.
2Construct truth tables for individual gates and for complex logic circuits with multiple inputs.
3Draw, interpret, and produce logic circuits using the standard IEC 60617-12 symbols.
4Simplify logic circuits using Boolean algebra, including De Morgan's laws, to create more efficient designs.

In simple terms

A friendly intro before the formal notes — no formulas yet.

The Building Blocks of Logic

THINK OF IT LIKE…

1
Basic gates like NOT, AND, and OR have defined behaviours. Their output for every possible combination of inputs is captured in a truth table.
2
NAND and NOR gates are 'universal'. This means you can construct any other logic gate, and therefore any logic circuit, using only NAND gates or only NOR gates.
3
Boolean algebra is the mathematics used to analyse and simplify logic circuits. Key rules, like De Morgan's laws, allow us to find equivalent circuits with fewer gates, saving cost and power.
4
Logic circuits are combinations of gates designed to perform specific tasks. These range from simple adders in a CPU to complex control logic in memory systems.

Explore the concept

Use the live diagram and synced steps — play it or tap a step card to walk through.

Key formulas

Tap any symbol to reveal exactly what it means and its units.

A + 0 = A

Full topic notes

Formal explanation with the rigour you need for the exam.

The Fundamental Logic Gates

NOT Gate: Has one input and one output. It inverts the input. If input A is 1, output X is 0. If A is 0, X is 1. Boolean expression: $X = \neg{A}$ .
AND Gate: Has two or more inputs and one output. The output is 1 only if all inputs are 1. Boolean expression: $X = A \cdot B$ .
OR Gate: Has two or more inputs and one output. The output is 1 if any input is 1. Boolean expression: $X = A + B$ .

Compound and Universal Gates

NAND Gate: The output is the opposite of an AND gate. It is 0 only when all inputs are 1. Boolean expression: $X = \neg{(A \cdot B)}$ .
NOR Gate: The output is the opposite of an OR gate. It is 1 only when all inputs are 0. Boolean expression: $X = \neg{(A + B)}$ .
XOR Gate: The output is 1 only if the inputs are different. If inputs A and B are both 0 or both 1, the output is 0. Boolean expression: $X = A \oplus B$ .

From Gates to Circuits: Boolean Algebra

Worked examples

See the formulas applied — reveal one step at a time, like the exam.

EXAMPLE 1

A logic circuit is represented by the Boolean expression $X = (A \cdot B) + (\neg{B} \cdot C)$ .

(i) Draw the logic circuit for this expression. [3 marks] (ii) Complete the truth table for this circuit. [4 marks]

1
(i) To draw the circuit, we identify the gates needed: two AND gates, one NOT gate, and one OR gate.
- The first AND gate takes inputs A and B.
- The NOT gate takes input B to produce $\neg{B}$ .
- The second AND gate takes inputs $\neg{B}$ and C.
- The OR gate takes the outputs of the two AND gates to produce the final output X.

EXAMPLE 2

Simplify the following Boolean expression using algebraic laws. Draw the logic circuit for the original expression and the simplified expression.

$X = (A + B) \cdot (A + \neg{B})$

1
Original Expression: $X = (A + B) \cdot (A + \neg{B})$

How it all connects

The big idea sits in the middle — tap a linked idea to explore the link.

MAIN IDEALogic Gates and Logic Circuits

Tap a linked idea to see how it connects back to the main topic — that connection is what examiners reward.

Glossary

Try to recall each definition before you reveal it.

Quick check

Answer in your head first — then tap to check. No pressure.

Revision flashcards

Flip the card. Test yourself before the exam.

QUESTION · 1 / 12

What is a logic gate?

TAP OR SPACE TO FLIP

ANSWER

An electronic component that performs a basic logical function, taking one or more binary inputs (0 or 1) to produce a single binary output.

TAP OR SPACE TO FLIP BACK

1 / 12 · ← → space

Key takeaways

Review these before you close the topic — retrieval beats re-reading.

✓
NOT Gate: Has one input and one output. It inverts the input. If input A is 1, output X is 0. If A is 0, X is 1. Boolean expression: $X = \neg{A}$ .
✓
AND Gate: Has two or more inputs and one output. The output is 1 only if all inputs are 1. Boolean expression: $X = A \cdot B$ .
✓
OR Gate: Has two or more inputs and one output. The output is 1 if any input is 1. Boolean expression: $X = A + B$ .

Practice — then mark it

The whole point: a real Cambridge question, marked mark-by-mark.

Real past paper[0]

Test Your Knowledge on Logic Gates

Do it on paper → mark itMARKED MARK-BY-MARK · B1 / M1 / A1 · OFFICIAL SCHEME

Extra simulations & links

PhET, GeoGebra and other curated tools — open in a new tab.

Frequently asked

✓

Checkpoint

One marked question is worth ten re-reads — close the loop before you move on.

Checkpoint

Reading it isn’t knowing it — prove it.

Before you move on: do Test Your Knowledge on Logic Gates on paper, snap a photo, and get examiner-style feedback on exactly where you win and lose marks.

Attempt & get marked →Takes about a minute · you’ll land back on this lesson

← PREVIOUS3.1 Computers and their components NEXT →4.1 Central Processing Unit (CPU) Architecture

Revise Logic Gates and Logic Circuits for Cambridge 9618 (3.2)

In simple terms

Explore the concept

Key formulas

Full topic notes

The Fundamental Logic Gates

Compound and Universal Gates

From Gates to Circuits: Boolean Algebra

Worked examples

How it all connects

Glossary

Quick check

Revision flashcards

Key takeaways

Practice — then mark it

Test Your Knowledge on Logic Gates

Extra simulations & links

Frequently asked

Checkpoint

Reading it isn’t knowing it — prove it.

In simple terms

Explore the concept

Key formulas

Full topic notes

The Fundamental Logic Gates

Compound and Universal Gates

From Gates to Circuits: Boolean Algebra

Worked examples

How it all connects

Glossary

Quick check

Revision flashcards

Key takeaways

Practice — then mark it

Test Your Knowledge on Logic Gates

Extra simulations & links

Frequently asked

Checkpoint

Reading it isn’t knowing it — prove it.

Discuss Logic Gates and Logic Circuits