How do you turn a set of requirements into a working logic circuit, and why are NAND and NOR universal?
Designing combinational logic: building a circuit from a truth table or word description, combining gates, and the universal NAND and NOR gates.
An Eduqas GCSE Electronics answer on designing combinational logic: turning a word description or truth table into a Boolean expression and a gate circuit, combining gates into a system, and using the universal NAND and NOR gates to build any function from one gate type.
Reviewed by: AI editorial process; not yet individually human-reviewed
Have a quick question? Jump to the Q&A page
Jump to a section
What this dot point is asking
Eduqas wants you to design a combinational logic circuit: turn a word description or a truth table into a Boolean expression and then a gate circuit, combine gates into a working system, and explain the universal NAND and NOR gates (any logic function can be built from one gate type). This is where the gates and algebra of the previous topics are put to use.
The answer
Combinational logic
Designing from a description or truth table
Combining gates into a system
Universal gates
Examples in context
Designing combinational logic is the core skill of the digital part of the course and of the non-exam assessment. A machine guard interlock, a two-out-of-three voting safety system, a code lock and a seven-segment decoder are all combinational designs built from a truth table or a word description. Building everything from NAND gates shows why one chip type can implement a whole design, and the same approach feeds into the adders and arithmetic circuits that follow.
Try this
Q1. State what "combinational" means for a logic circuit. [1 mark]
- Cue. The output depends only on the present inputs (it has no memory).
Q2. Write a Boolean expression for an output that is 1 when and are both 1, or when is 1. [2 marks]
- Cue. .
Q3. State how to make a NOT gate from a single NAND gate. [1 mark]
- Cue. Tie both NAND inputs together (a NAND of with gives ).
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 20195 marksA machine should sound an alarm when a guard is open () and the motor is running (), or when an emergency stop is pressed (). Write a Boolean expression for the alarm output and describe the gates needed.Show worked answer →
Expression (up to 3 marks): the guard-and-motor condition is ; the emergency stop is ; the alarm sounds for either, so .
Gates (up to 2 marks): an AND gate combines and ; an OR gate combines the AND output with ; the OR output drives the alarm (through a transistor switch).
Markers reward the correct expression and a description using one AND and one OR gate (the order and roles correct).
Eduqas 20224 marksExplain what is meant by a universal gate, and show how a NOT gate and an AND gate can each be made from NAND gates only.Show worked answer →
Universal gate (up to 2 marks): a universal gate is one from which any logic function can be built; NAND and NOR are both universal, so a whole circuit can be made from one gate type.
Constructions (up to 2 marks): a NOT gate is a NAND with both inputs joined together (a NAND of with gives ). An AND gate is a NAND followed by this NAND-inverter, because inverting the NAND output gives .
Markers reward the definition (any function from one gate type) and both valid constructions (NOT from a NAND with tied inputs, AND from a NAND plus an inverter).
Related dot points
- Logic gates: AND, OR, NOT, NAND, NOR and XOR, their symbols and truth tables, and the digital high and low logic levels.
An Eduqas GCSE Electronics answer on logic gates: the AND, OR, NOT, NAND, NOR and XOR gates with their symbols and truth tables, the meaning of logic high and logic low, and how a truth table lists the output for every combination of inputs.
- 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.
- Binary numbers and adders: counting in binary, the half adder (sum and carry), the full adder with a carry in, and adding multi-bit numbers.
An Eduqas GCSE Electronics answer on binary arithmetic and adders: counting in binary and converting to decimal, the half adder built from XOR and AND giving sum and carry, the full adder that includes a carry in, and chaining full adders to add multi-bit binary numbers.
- Electronic systems and subsystems: the systems approach with input, process and output blocks, block diagrams and signal flow, and analogue versus digital signals.
An Eduqas GCSE Electronics answer on the systems approach: representing an electronic product as input, process and output subsystems, drawing and reading block diagrams, tracing signal flow, and telling analogue and digital signals apart.
Sources & how we know this
- WJEC Eduqas GCSE (9-1) Electronics specification (C490) — WJEC Eduqas (2017)