What does the Digital Electronics and Logic Gates module cover?

It covers how digital circuits represent and process information with just two levels: logic 0 and logic 1, and binary numbers; the three basic gates AND, OR and NOT with their symbols, truth tables and Boolean expressions; the NAND and NOR gates and why NAND is described as a universal gate; how to derive the truth table of a combinational circuit built from several gates; and how to design a logic system from a written specification by building its truth table and selecting the gates.

Why is digital often described as more robust than analogue?

A digital signal uses only two well-separated levels, logic 0 (a low voltage) and logic 1 (a high voltage), so small amounts of noise or voltage drift do not change which level is read. An analogue signal can take any value, so any added noise corrupts it directly. Because a digital circuit only has to decide whether a voltage is nearer the low or the high level, it tolerates interference far better, which is why digital is preferred for processing and storing information.

Why is the NAND gate called a universal gate?

A NAND gate is universal because any other logic function can be built from NAND gates alone. A NAND with its inputs joined acts as a NOT gate; NAND gates can be combined to make AND, OR and the other functions. This means a manufacturer can build an entire logic system from just one type of gate, which simplifies design and production. The NOR gate is universal in the same way.

How do you design a logic system from a written specification?

Start by identifying the inputs and the single output, then build a truth table that lists the output for every combination of inputs, marking a 1 wherever the specification says the output should be on. From the rows where the output is 1 you write a Boolean expression, and from that expression you select and connect the gates (for example AND gates for the conditions and an OR gate to combine them). Finally you check the circuit against the original truth table.

SingaporeElectronics

Digital Electronics and Logic Gates: O-Level Electronics module overview of binary, the basic gates, NAND and NOR, truth tables and combinational logic design

An O-Level Electronics overview of the Digital Electronics and Logic Gates module. Binary and logic levels, the AND, OR and NOT gates, NAND and NOR (including why NAND is universal), deriving truth tables of combinational logic, and designing a logic system from a specification, with links to every dot point.

Generated by Claude Opus 4.87 min readSEAB O-Level Electronics: Digital Electronics and Logic GatesUpdated 2026-06-14

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

Jump to a section

What this module is about
Binary and logic levels
The basic logic gates
NAND and NOR gates
Truth tables and combinational logic
Building logic systems
A worked combinational logic example
How this module is examined
Check your knowledge

What this module is about

Digital Electronics and Logic Gates is the other half of the subject alongside the analogue circuits. Here a signal takes only two values, logic 0 and logic 1, and circuits process information by combining those values through logic gates. The module starts with binary and logic levels, introduces the three basic gates and then the NAND and NOR gates, teaches you to derive the truth table of a multi-gate circuit, and finishes by having you design a complete logic system from a written specification. The skills are recall (gate functions and symbols), analysis (truth tables) and design (turning a specification into a circuit).

This overview ties the module together and links to every dot point, each with its own worked answers and practice questions. See the full set at /sg-o-level/electronics/syllabus/digital-electronics-and-logic-gates.

Binary and logic levels

Binary and logic levels explains that a digital signal uses two levels, logic 0 (low) and logic 1 (high), which makes it robust against noise. It also covers binary place values and converting between small binary and denary numbers, the number system every digital circuit works in.

The basic logic gates

Basic logic gates gives the function, symbol, truth table and Boolean expression of the AND, OR and NOT gates. AND outputs 1 only when all inputs are 1; OR outputs 1 when any input is 1; NOT inverts a single input. These three are the foundation of every logic circuit.

NAND and NOR gates

NAND and NOR gates introduces the inverted forms: NAND is AND followed by NOT, and NOR is OR followed by NOT. The key idea is that NAND is a universal gate, because any logic function can be built from NAND gates alone, and the NOR gate is universal in the same way.

Truth tables and combinational logic

Truth tables and combinational logic teaches the systematic method for finding the output of a circuit built from two or more gates: list every input combination, work through the gates stage by stage, and record the final output. From the completed table you can write the Boolean expression for the circuit.

Building logic systems

Building logic systems is the design skill: turn a written specification into a truth table, read off a Boolean expression from the rows where the output is 1, and select the gates to implement it. This is the highest-level outcome of the module and a frequent extended question.

A worked combinational logic example

Deriving a truth table for two gates

A circuit has two inputs, $A$ and $B$ . Input $A$ and input $B$ go into an AND gate, and input $B$ also goes through a NOT gate; the AND output and the inverted $B$ go into an OR gate to give output $Q$ . Build the truth table and write the Boolean expression.

Step 1: List every input combination

With two inputs there are four combinations: $A,B$ equal to $0,0$ then $0,1$ then $1,0$ then $1,1$ .

Step 2: Work out the intermediate signals

The AND output ( $A \cdot B$ ) is 1 only for $A=1, B=1$ . The NOT output (NOT $B$ ) is 1 whenever $B=0$ , so for the rows $0,0$ and $1,0$ .

Step 3: Combine with the OR gate

$Q$ is 1 if either the AND output or NOT $B$ is 1. So $Q = 1$ for rows $0,0$ (NOT B is 1), $1,0$ (NOT B is 1) and $1,1$ (AND is 1), and $Q = 0$ only for row $0,1$ .

Step 4: Write the Boolean expression and check

The expression is $Q = (A \cdot B) + \overline{B}$ . Checking row $0,1$ : AND is 0 and NOT B is 0, so $Q = 0$ , which matches the table.

How this module is examined

Know the gates cold. The AND, OR, NOT, NAND and NOR truth tables and symbols are straight recall marks; learn them to fluency.
Work truth tables stage by stage. List all input rows, then fill each intermediate signal column before the final output, rather than guessing.
Design from the specification. For a design question, build the truth table from the words first, then derive the expression, then draw the gates and check.

Check your knowledge

Work through the quiz for this module to test binary, the gate truth tables, the universal NAND, combinational logic and logic design, then review the worked explanations.

Sources & how we know this

Singapore Examinations and Assessment Board (SEAB) — Singapore Examinations and Assessment Board (2026)
Subjects and syllabuses, Ministry of Education Singapore — Ministry of Education, Singapore (2026)