Boolean Expressions and Logic Circuits · Cambridge syllabus 10.3 · Lesson 2 of 2
Circuit Construction
Construct a circuit from the inside of an expression outward. Create a gate for each operation, connect intermediate outputs and preserve the grouping. Draw the circuit for the statement as given, without simplifying it. NOT has one input, every other gate has two, and a circuit has at most three inputs and one output.
By the end, you can
- Draw logic circuits from Boolean expressions.
- Use standard logic-gate symbols.
- Combine multiple gates to form a circuit.
- Draw a logic circuit from a problem statement.
- Draw a logic circuit from a truth table.
- Draw each circuit as stated, without simplification, using gates of at most two inputs and at most three circuit inputs.
From expression to circuit
Drawing a circuit from an expression is the reverse of reading one, and it is done from the inside out.
Work out which operation happens last, because that is the gate nearest the output. In (A AND B) OR C the OR is last, so the final gate is an OR gate. Everything inside a bracket happens before the operation outside it.
Then work backwards. Each input of the final gate is either an input letter, which connects directly, or another expression, which needs its own gate. A AND B becomes an AND gate fed by A and B, whose output feeds the OR; C connects to the OR directly.
Lay the diagram out left to right with the inputs down the left-hand side, each labelled once, and the output on the right. Where an input is used more than once, draw a single line that branches, with a dot at the junction; where a variable appears inverted, put a NOT gate on that branch only.
Use the standard symbols and nothing else: the flat-backed shape for AND, the curved shield for OR, the triangle and circle for NOT, and those shapes with a circle added for NAND and NOR. Every gate must have the right number of inputs and exactly one output, and no line may be left unconnected.
Check the drawing by tracing it back into an expression. If what comes out is not what went in, the error is usually a missing bracket that has changed which gate came last.
A circuit can also be drawn from a problem statement or a truth table: first write the logic expression, as in the Boolean expressions lesson, then draw the circuit from that expression. Draw the circuit for the statement exactly as it is given, without simplifying it, with one gate for each operation. NOT has one input, every other gate has two, and a circuit has at most three inputs and one output, so a condition joining three inputs needs two gates.
Worth remembering
- The operation done last is the gate nearest the output.
- Inputs on the left, one label each, branching where a value is used twice.
- From a statement or truth table, write the expression first, then draw it.
- Draw it as stated, without simplifying; gates have at most two inputs.
Worked example
For (A OR B) AND C, connect A and B to an OR gate, then connect its output and C to an AND gate.
Practice
Warm-up · not marked
Check your understanding
Answer in your own words, then compare with the worked answer. Nothing here is saved or scored.
Worked answer
An AND gate for A and B, a NOT gate for C, and an OR gate joining their outputs.
Check your method, units and explanation against it.
Marked practice
Set 1 of 5 · easiest first · Checked as you go, with the worked answer. Sign in or create a free account to save your progress.