Lesson Plan

Resources → Subject Notes → Computer Science → Notes
Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Show understanding of Boolean algebra
Learning Objective/s:
  • Describe the fundamental laws and identities of Boolean algebra.
  • Apply simplification techniques, including Karnaugh maps, to reduce Boolean expressions.
  • Translate simplified Boolean expressions into corresponding logic‑gate circuits.
  • Construct truth tables to verify the correctness of simplified expressions.
Materials Needed:
  • Projector or interactive whiteboard.
  • Slides/handout covering Boolean laws and Karnaugh‑map examples.
  • Worksheet with practice simplification and K‑map problems.
  • Logic‑gate symbol set or circuit‑design software (e.g., Logisim).
  • Calculator or computer for truth‑table verification.
 Introduction:
Begin with a quick poll: which digital devices rely on logical decisions? Review that students already know binary digits and basic AND/OR/NOT gates from previous lessons. Explain that today they will master Boolean algebra to simplify and design efficient circuits, and they will be able to demonstrate this by simplifying an expression and drawing its gate diagram.
Lesson Structure:
  1. Do‑now (5'): Short quiz on binary values and basic gates; teacher checks answers.
  2. Direct instruction (10'): Present Boolean laws and identities with examples using the projector.
  3. Guided practice (15'): Work through simplification of a sample expression step‑by‑step on the worksheet.
  4. Karnaugh‑map activity (10'): Students construct a 4‑variable K‑map for a given function and derive the minimal SOP.
  5. Circuit translation (10'): Convert the simplified expression into a logic‑gate schematic using symbols or software.
  6. Check for understanding (5'): Exit ticket where each student writes one law and an example of its use.
Conclusion:
Summarise that Boolean algebra provides a systematic way to reduce logical expressions and design compact circuits. Students submit an exit ticket stating the most useful law they applied today. For homework, assign a set of expressions to simplify and draw the corresponding circuit diagrams.