Homeschool Guide: These lesson plans are a guide for parents. Content may contain errors — always cross-reference with official exam board specifications.

boolean algebra

FoundationHigherAll Boards

4 detailed 50-minute lessons with teaching scripts, worked examples, parent guides, and assessment criteria.

Fastmail

Lesson Overview

Total Lessons: 4
Tier: Foundation and Higher
Duration: 50 minutes per lesson (200 minutes total)
Exam Boards: AQA, Edexcel, OCR, Eduqas, CCEA

Learning Objectives

Prerequisites

Materials & Equipment

Lesson 1: Introduction: boolean algebra

Duration: 50 minutes

Starter Activity (5 minutes)

Quick Recall

Write down everything you already know about boolean algebra. Then check against the key terms: key terms from boolean algebra. Use a mini-whiteboard or paper.

Main Content (35 minutes)

Parent/Teacher Guide:
Before lesson: Read the script below. Pre-teach key vocab: key terms from boolean algebra.
If stuck: Re-read the revision notes (link above), then break the content into smaller steps.
Extension: See the Stretch & Challenge ideas in Lesson 4.
Teaching Script (35 mins):
Mins 0-5 - Hook: "Today: boolean algebra. By the end you will be able to answer exam questions on it unaided. It connects to the rest of Electronics because the ideas here recur across the spec."
Mins 5-20 - Direct Instruction: Work through the core ideas below one at a time; after each, ask your student to explain it back in their own words.
Mins 20-30 - Guided Practice: Model the worked example together, then let your student attempt the first practice question with guidance.
Mins 30-35 - Independent Practice: 2-3 practice questions from Lesson 3 below, with immediate feedback.
First Look

Start with the revision notes summary, then attempt: explain the key ideas of boolean algebra

Plenary (5 minutes)

Check Out

Your student states one thing they learned and one question they still have about boolean algebra.

Lesson 2: Core Concepts: boolean algebra

Duration: 50 minutes

Starter Activity (5 minutes)

Review Previous Lesson

Quick recap: write 3 key points from Lesson 1 on boolean algebra. Check them against the notes below.

Main Content (35 minutes)

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.

Practice (10 minutes)

Q: explain the key ideas of boolean algebra

Answer:

Plenary (5 minutes)

Explain Back

Your student teaches the key points back to you without looking. Fill any gaps immediately.

Lesson 3: Application: boolean algebra

Duration: 50 minutes

Starter Activity (5 minutes)

Quick Recall

Recall the key terms: key terms from boolean algebra. Define each in one sentence.

Main Content (35 minutes)

Parent/Teacher Guide: Let your student attempt each question alone first, then compare with the model answer. Award method marks for correct working even if the final answer is wrong.

Work through the practice questions on the revision notes page for this topic.

Plenary (5 minutes)

Error Review

Review any questions answered incorrectly. Identify whether the error was knowledge, method, or reading the question.

Lesson 4: Exam Practice: boolean algebra

Duration: 50 minutes

Starter Activity (5 minutes)

Command Words

Review what these command words require: state (one point), describe (say what happens), explain (say why), compare (both sides), evaluate (judgement).

Main Content (35 minutes)

Extended Answer

Extended question: 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. <div class="

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.

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.
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.
Stretch & Challenge (Grade 8-9):
  • Synoptic links: explain how boolean algebra connects to another Electronics topic you have studied
  • Real-world: research one real-world use or example of boolean algebra
  • Critical: "What are the limitations of the models used in boolean algebra?"

Plenary (5 minutes)

Assessment Criteria
  • Got it: Confident explanation + correct worked examples
  • Getting there: Main points OK, needs support with detail
  • Not yet: Confused on key concepts - re-run Lesson 2

Homework & Consolidation

Recommended Resources

🎓 Smart Lesson (Guided)