In simple terms
A friendly intro before the formal notes — no formulas yet.
From Laws to Logic Memory
Boolean algebra provides the rules to simplify complex digital circuits, making them faster and cheaper to build. These simplified circuits can then be combined to perform calculations or, with the addition of feedback, to store information.
Imagine you have a very long and complicated recipe for baking a cake. Boolean algebra is like a set of chef's techniques that let you simplify the recipe—perhaps by combining dry ingredients in one step instead of three, or realising two steps cancel each other out. The final, simplified recipe (the simplified circuit) produces the exact same delicious cake (the correct output) but is much quicker and uses fewer bowls (components).
- 1
Master Boolean laws like De Morgan's to algebraically simplify logic expressions, reducing the number of gates needed in a circuit.
- 2
Use Karnaugh maps as a visual tool to group '1's from a truth table, quickly finding the simplest Sum-of-Products (SOP) form for a function.
- 3
Combine basic gates (XOR, AND, OR) to build combinational circuits like half and full adders, which perform binary addition.
- 4
Introduce feedback to create sequential circuits like flip-flops, which can 'remember' a state and store a single bit of data.
Explore the concept
Use the live diagram and synced steps — play it or tap a step card to walk through.
1 more simulation for this topic — run them in the Simulations section below
Simulations
Every simulation here runs the real model — try the steps on a card, then check what you see against the notes.
1 simulation
- GeoGebra9618 15.2
Logic gate explorer
One gate at a time: two clickable ON/OFF inputs, the gate symbol with its name, an output box, and a slider underneath that changes the gate.
Try this
- Drag the slider until the label reads XOR and try all four input pairs. That output column is the Sum of a half adder.
- Slide to AND and repeat. That column is the Carry.
- Slide to NAND, record its column, then work out (NOT A) OR (NOT B) on paper: the columns match, which is De Morgan's law.
Look for A half adder is two gates sharing the same inputs: XOR gives the sum bit and AND gives the carry bit. Chain two half adders and an OR gate and you have a full adder.
Susan Donovan · GeoGebra · GeoGebra Terms of Service
Full topic notes
Formal explanation with the rigour you need for the exam.
Advanced Boolean Algebra for Simplification
While basic laws like identity, complement, and associative laws are useful, more complex expressions require more powerful tools. Simplifying a Boolean expression is crucial in hardware design as it directly translates to a circuit with fewer logic gates. This reduces cost, power consumption, and signal propagation delay, leading to a faster and more efficient circuit.
De Morgan's Laws: Essential for converting between AND/OR forms and simplifying negated expressions. and . A useful mnemonic is 'break the line, change the sign'.
Distributive Law: Allows for the expansion or factorisation of expressions. The key form for simplification is often .
Absorption Law: Excellent for removing redundant terms. The most common forms are and . This is because if X is true, the whole expression is true regardless of Y.
Karnaugh Maps (K-maps)
For expressions with three or four variables, algebraic simplification can be tedious and error-prone. A Karnaugh map, or K-map, provides a visual, systematic method for simplification. It's a 2D grid representing a truth table, but with a special ordering (Gray code) that places logically adjacent terms next to each other. By grouping adjacent '1's in the map, we can easily identify and eliminate redundant variables to arrive at a minimal sum-of-products (SOP) expression.
Structure: A 4-variable K-map is a 4x4 grid. The rows and columns are labelled with Gray code (00, 01, 11, 10) to ensure only one bit changes between adjacent cells.
Grouping: Group adjacent '1's in rectangles of size (i.e., 1, 2, 4, 8, 16). The groups must be rectangular.
Wrap-around: The map is considered to wrap around from top to bottom and from left to right. This allows grouping of '1's on opposite edges.
Strategy: Always make the largest possible groups first. Each '1' must be included in at least one group. It's acceptable to overlap groups if it leads to a simpler overall expression.
Combinational and Sequential Circuits
Digital logic circuits are broadly classified into two types. Combinational circuits, like the adders we will see next, produce an output that is purely a function of their current inputs. They have no memory. In contrast, sequential circuits have memory. Their output depends on both the current inputs and the previous state of the circuit, which is stored in memory elements like flip-flops. This ability to store information is fundamental to building computer memory and registers.
Half Adder: Adds two bits (A, B). Produces a Sum () and a Carry (). It cannot handle a carry-in from a previous stage.
Full Adder: Adds three bits (A, B, ). Produces a Sum () and a Carry-out (). Full adders can be chained together to add multi-bit numbers.
SR Flip-Flop: A simple 1-bit memory latch built with cross-coupled NOR or NAND gates. It has a 'Set' input to make the output 1, a 'Reset' input to make it 0, and an invalid state when both are active.
D-type Flip-Flop: An improvement on the SR flip-flop that eliminates the invalid state. It has a Data input (D) and a Clock input. On a specific edge of the clock pulse (e.g., rising edge), the value at D is copied to the output Q and stored until the next clock edge.
Be ready to draw the logic circuit for a half adder and a full adder. For sequential logic, you are expected to understand the function of SR and D-type flip-flops from their truth tables and explain their role in data storage, but you are not typically required to draw their internal gate structure.
Worked examples
See the formulas applied — reveal one step at a time, like the exam.
Using Boolean algebra, simplify the expression .
- 1
Start with the given expression:
A logic circuit is defined by the Boolean function . Use a Karnaugh map to find the minimal sum-of-products expression for F.
- 1
Draw and populate the K-map: We create a 4x4 grid for variables A, B, C, D and place '1's in the cells for the given minterms.
How it all connects
The big idea sits in the middle — tap a linked idea to explore the link.
Tap a linked idea to see how it connects back to the main topic — that connection is what examiners reward.
Glossary
Key terms for this topic — skim now; the Check step will test them.
- Combinational circuits
Digital logic circuits are broadly classified into two types. Combinational circuits, like the adders we will see next, produce an output that is purely a function of their current inputs. They have no memory.
- De Morgan's Law (First Law)
The negation of a conjunction is the disjunction of the negations. Algebraically: . In logic gates, a NAND gate is equivalent to an OR gate with inverted inputs.
- De Morgan's Law (Second Law)
The negation of a disjunction is the conjunction of the negations. Algebraically: . In logic gates, a NOR gate is equivalent to an AND gate with inverted inputs.
- Distributive Law
AND distributes over OR: . OR distributes over AND: .
- Absorption Law
A set of laws that simplify expressions where a variable is combined with a term containing that same variable. Key forms: and .
- Karnaugh Map (K-map)
A graphical method used to simplify Boolean algebra expressions. It's a grid where cells represent minterms, and adjacent cells differ by only one variable, allowing for visual grouping to find a minimal sum-of-products form.
- Sum-of-Products (SOP)
A standard form for a Boolean expression where several product terms (AND operations) are summed together (OR operation). For example: .
- Combinational Logic Circuit
A type of digital circuit whose output is solely determined by its current input values. It has no memory. Examples include adders, decoders, and multiplexers.
- Sequential Logic Circuit
A type of digital circuit whose output depends not only on the current inputs but also on the previous sequence of inputs, due to internal memory elements. Examples include flip-flops and counters.
- Half Adder
A combinational circuit that adds two single binary digits (A and B) and produces two outputs: Sum (S) and Carry (C). S = A XOR B, C = A AND B.
- Full Adder
A combinational circuit that adds three binary digits (A, B, and a Carry-in, Cin) and produces two outputs: Sum (S) and Carry-out (Cout). It can be built from two half adders and an OR gate.
- SR Flip-Flop
A basic sequential circuit with two inputs, Set (S) and Reset (R). S=1 sets the output Q to 1, R=1 resets Q to 0. S=1 and R=1 simultaneously is an invalid state.
- D-type Flip-Flop
A clocked sequential circuit that transfers the value of its data input (D) to its output (Q) on the triggering edge of a clock signal. It's used to store one bit of data and prevents the invalid state of an SR flip-flop.
Name it
Read the meaning, then pick which of this lesson’s terms it describes. Miss one and you see what your choice really means.
A basic sequential circuit with two inputs, Set (S) and Reset (R). S=1 sets the output Q to 1, R=1 resets Q to 0. S=1 and R=1 simultaneously is an invalid state.
Quick check
Write your answer first, then compare it with the model one — the gap is what you would have lost.
Teach it back
If you can explain it simply, you own it — gaps here are marks you’d lose.
Teach it back
Explain this topic as if teaching a friend. We name the gaps an examiner would still dock.
Revision flashcards
Guess first, then flip — retrieval beats re-reading.
Key takeaways
Review these before you close the topic — retrieval beats re-reading.
De Morgan's Laws: Essential for converting between AND/OR forms and simplifying negated expressions. and . A useful mnemonic is 'break the line, change the sign'.
Distributive Law: Allows for the expansion or factorisation of expressions. The key form for simplification is often .
Absorption Law: Excellent for removing redundant terms. The most common forms are and . This is because if X is true, the whole expression is true regardless of Y.
Practice — then mark it
The whole point: a real Cambridge question, marked mark-by-mark.
Test Your Knowledge on Boolean Algebra & Logic Circuits
Test Your Knowledge on Boolean Algebra & Logic Circuits
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.
Reading it isn’t knowing it — prove it.
Before you move on: do Test Your Knowledge on Boolean Algebra & Logic Circuits on paper, snap a photo, and get examiner-style feedback on exactly where you win and lose marks.
Discuss Boolean Algebra and Logic Circuits
Ask, share and discuss with other Computer Science students