Skip to main content
EnglandElectronicsSyllabus dot point

How are logic circuits written and simplified using Boolean algebra?

Boolean algebra: writing Boolean expressions for gates, the laws of Boolean algebra, De Morgan's laws, and simplifying an expression to use fewer gates.

An Eduqas GCSE Electronics answer on Boolean algebra: writing Boolean expressions using the AND, OR and NOT notation, the main laws of Boolean algebra, De Morgan's two laws, and simplifying an expression so a logic circuit uses fewer gates.

Generated by Claude Opus 4.813 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. The answer
  3. Examples in context
  4. Try this

What this dot point is asking

Eduqas wants you to write Boolean expressions for logic circuits, apply the laws of Boolean algebra and De Morgan's laws to simplify them, and explain why simplifying matters (fewer gates means a cheaper, faster, lower-power circuit). This is the algebra of digital logic, and mark schemes reward shown working with the laws named.

The answer

Writing Boolean expressions

The laws of Boolean algebra

De Morgan's laws

Why simplify

Examples in context

Boolean algebra is the language used to design and simplify every combinational circuit. A safety interlock written from its requirements often produces a long expression that simplifies to far fewer gates; De Morgan's laws let a whole design be rebuilt from NAND gates only (one cheap chip type), which is how real integrated circuits are made. The same algebra describes the conditions a microcontroller program tests, so the skill carries straight into the sequential and microcontroller modules.

Try this

Q1. Write the Boolean expression for "AA AND NOT BB". [1 mark]

  • Cue. A⋅B‾A \cdot \overline{B}.

Q2. Apply De Morgan's law to A+B‾\overline{A + B}. [1 mark]

  • Cue. A+B‾=A‾⋅B‾\overline{A + B} = \overline{A} \cdot \overline{B}.

Q3. Simplify A+A⋅BA + A \cdot B and name the law. [2 marks]

  • Cue. AA, by the absorption law.

Exam-style practice questions

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

Eduqas 20204 marksSimplify the Boolean expression A⋅B+A⋅B‾A \cdot B + A \cdot \overline{B}, naming the laws used.
Show worked answer →

Factor out AA using the distributive law: A⋅B+A⋅B‾=A⋅(B+B‾)A \cdot B + A \cdot \overline{B} = A \cdot (B + \overline{B}).

Apply the complement law B+B‾=1B + \overline{B} = 1: this gives A⋅1A \cdot 1.

Apply the identity law A⋅1=AA \cdot 1 = A: the simplified expression is AA.

Markers reward the named distributive, complement and identity laws and the final answer AA. A circuit that originally needed two AND gates, a NOT and an OR reduces to a plain wire from AA.

Eduqas 20224 marksState De Morgan's two laws and use one of them to rewrite A⋅B‾\overline{A \cdot B} without a bar over the whole expression.
Show worked answer →

De Morgan's laws (up to 2 marks): A+B‾=A‾⋅B‾\overline{A + B} = \overline{A} \cdot \overline{B} and A⋅B‾=A‾+B‾\overline{A \cdot B} = \overline{A} + \overline{B}.

Rewriting (up to 2 marks): applying the second law, A⋅B‾=A‾+B‾\overline{A \cdot B} = \overline{A} + \overline{B} (break the bar and change the AND to an OR, with each variable now individually barred).

Markers reward both laws stated correctly and the conversion of A⋅B‾\overline{A \cdot B} to A‾+B‾\overline{A} + \overline{B}, breaking the bar and swapping the operator.

Related dot points

Sources & how we know this