E7: Boolean Algebra
Boolean identities, De Morgan's laws, simplification and Karnaugh maps
Boolean Algebra
Boolean identities, De Morgan's laws, simplification and Karnaugh maps
Key Fact: Boolean algebra uses variables with values 0 or 1; operations are AND (·), OR (+) and NOT (overbar).
Key Fact: Identity laws: A + 0 = A, A · 1 = A; null element laws: A + 1 = 1, A · 0 = 0.
Key Fact: Idempotent laws: A + A = A, A · A = A; complement laws: A + Ā = 1, A · Ā = 0.
Key Fact: Commutative: A + B = B + A, A · B = B · A; Associative: (A + B) + C = A + (B + C).
Key Fact: Distributive law: A · (B + C) = A·B + A·C; also A + B·C = (A + B)·(A + C).
Key Fact: De Morgan's First Law: (A · B)' = A' + B'; the complement of AND is OR of complements.
Key Fact: De Morgan's Second Law: (A + B)' = A' · B'; the complement of OR is AND of complements.
Key Fact: Absorption laws: A + A·B = A, A · (A + B) = A eliminate redundant terms.
Key Fact: Karnaugh maps (K-maps) provide a visual method for simplifying Boolean expressions up to 4 variables.
Key Fact: On a K-map, adjacent cells differ by one variable; groups of 1, 2, 4 or 8 can be combined.
Key Fact: Sum of Products (SoP) groups the 1s on the K-map; Product of Sums (PoS) groups the 0s.
Key Fact: Simplified expressions from K-maps use the fewest gates, reducing cost and propagation delay.
📋 Key Vocabulary and Concepts
For Boolean Algebra, you must know:
- De Morgan's laws: Rules for complementing compound expressions: (A·B)' = A'+B' and (A+B)' = A'·B'.
- Karnaugh map: A grid-based tool for visually simplifying Boolean expressions by grouping adjacent minterms.
- Minterm: A product term containing all variables in either true or complemented form, corresponding to one row of a truth table.
- Sum of Products: A Boolean expression written as the OR of AND terms (minterms).
- Idempotent law: A + A = A and A · A = A; repeating a variable has no effect.
- Absorption law: A + A·B = A; a term absorbed by another containing a subset of its variables can be removed.
❓ Practice Questions
Q: Simplify: A + A·B
Q: Apply De Morgan's law to (A·B)'.
Q: Simplify: A·Ā
Q: How many cells does a 3-variable Karnaugh map have?
Q: On a K-map, what is the rule for grouping cells?
✅ Answers
- A + A·B = A (absorption law).
- (A·B)' = A' + B' (De Morgan's first law).
- A·Ā = 0 (complement law: a variable ANDed with its complement is always 0).
- 2³ = 8 cells.
- Groups must contain 1, 2, 4 or 8 adjacent cells in powers of two, and adjacent cells must differ by only one variable (Gray code ordering).
🎯 Exam Tips
- When applying De Morgan's laws, break the bar, change the operator: AND becomes OR and vice versa.
- On K-maps, always use Gray code ordering of variables along rows and columns.
- Group the largest possible power of 2 to obtain the simplest expression.
- Show each simplification step and state the law used (absorption, distribution, etc.).
- Every 1 on the K-map must be included in at least one group for SoP form.
📝 Exam Technique
GCSE Electronics Exam Tips — Boolean Algebra:
1. For Boolean Algebra questions, use correct electronic symbols and terminology
2. Always show your working in calculations, including units at each step
3. When analysing circuits, state which law or rule you are applying first
4. For evaluation questions on Boolean Algebra, compare component choices and consider cost, reliability and tolerance
5. Draw circuit diagrams neatly with conventional symbols
1. For Boolean Algebra questions, use correct electronic symbols and terminology
2. Always show your working in calculations, including units at each step
3. When analysing circuits, state which law or rule you are applying first
4. For evaluation questions on Boolean Algebra, compare component choices and consider cost, reliability and tolerance
5. Draw circuit diagrams neatly with conventional symbols
⚠️ Common Errors
✗ Applying De Morgan's law but not complementing the individual variables. ✓ Break the overall bar AND complement each variable: (A·B)' = A' + B'.
✗ Grouping non-adjacent cells on a K-map. ✓ Only cells that differ by one variable (horizontally or vertically adjacent, including wrap-around) can be grouped.
✗ Forgetting that K-maps wrap around: the top row is adjacent to the bottom row. ✓ Cells on opposite edges of the K-map are adjacent and can be grouped together.
✗ Leaving isolated 1s ungrouped on a K-map. ✓ Every 1 must be in at least one group; isolated 1s form a group of one containing all variables.
✍️ Model Answer
Full-Mark Response
State De Morgan's laws and show how they can be used to convert an AND-OR logic circuit into an equivalent circuit using only NAND gates.
De Morgan's laws state: (1) (A·B)' = A' + B' — the complement of an AND is the OR of the complements; (2) (A + B)' = A'·B' — the complement of an OR is the AND of the complements. To convert an AND-OR circuit (implementing a Sum of Products expression F = A·B + C·D) to NAND-only, note that a NAND gate with both inputs tied together acts as a NOT gate. The expression F = A·B + C·D can be double-complemented: F = ((A·B + C·D)')'. By De Morgan's first law, the inner complement becomes (A·B)' · (C·D)'. So F = ((A·B)' · (C·D)')'. This requires only NAND gates: two NAND gates compute (A·B)' and (C·D)', and a third NAND gate combines them as ((A·B)' · (C·D)')'. Thus any SoP expression can be implemented entirely with NAND gates by double-complementing and applying De Morgan's laws.
📊 AO Deep Dive
Assessment Objective Analysis
AO1 (Knowledge & Understanding): Demonstrate knowledge and understanding of boolean algebra, including electronic components, circuit theory and systems concepts relevant to WJEC Eduqas C690QS.
AO2 (Application): Apply knowledge and understanding of boolean algebra to analyse, design and construct electronic circuits and systems.
AO3 (Evaluation): Evaluate electronic circuits and systems, making reasoned judgements about design choices, performance and practical considerations, constructing supported arguments.
📝 Exam Questions by Topic
🎬 Video Resources
Ready to ace your GCSE Electronics exams?
Get the best revision books and guides to boost your grades.