Lesson Plan

Resources → Subject Notes → Computer Science → Notes
Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Construct the truth table for each of the logic gates above
Learning Objective/s:
  • Describe the function of each basic logic gate (AND, OR, NOT, NAND, NOR, XOR, XNOR).
  • Construct complete truth tables for two‑input gates and extend the method to three‑input gates.
  • Apply truth tables to verify logical expressions and simple combinational circuits.
Materials Needed:
  • Projector or interactive whiteboard
  • Printed worksheets with gate symbols and empty truth tables
  • Logic‑gate cards or digital simulation software (e.g., Logisim)
  • Markers and whiteboard
  • Student laptops or tablets (optional)
 Introduction:
Begin with a quick real‑world analogy of a light switch to capture interest, then recall students' prior experience with binary numbers. Explain that today they will master how each logic gate transforms inputs into outputs, and the success criteria is being able to produce accurate truth tables for all seven basic gates.
Lesson Structure:
  1. Do‑Now (5’) – Students complete a short binary‑counting exercise on the board.
  2. Mini‑lecture (10’) – Review symbols and truth‑table format for each gate using the projector.
  3. Guided practice (15’) – In pairs, students fill out truth tables for AND, OR, NOT on worksheets while the teacher circulates.
  4. Interactive simulation (10’) – Use Logisim to toggle inputs and observe outputs for NAND, NOR, XOR, XNOR.
  5. Extension activity (10’) – Students construct the truth table for a 3‑input AND gate and discuss the pattern.
  6. Check for understanding (5’) – Exit ticket: write the output for a given input combination of an XOR gate.
Conclusion:
Summarise the step‑by‑step method for building truth tables and highlight the common pattern across gates. Collect the exit tickets, then assign homework to design a truth table for a simple combinational circuit such as a half‑adder.