Lesson Plan

Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Identify and use the standard symbols for logic gates
Learning Objective/s:
  • Identify the standard schematic symbols for the basic logic gates (AND, OR, NOT, NAND, NOR, XOR, XNOR).
  • Translate Boolean expressions into the corresponding gate symbols and vice‑versa.
  • Construct simple Boolean circuits using the correct gate symbols.
  • Evaluate truth tables to verify the function of each gate.
  • Apply the symbols to solve practice problems involving circuit design.
Materials Needed:
  • Projector or interactive whiteboard.
  • Printed worksheets with gate symbol chart and practice questions.
  • Logic‑gate cards or digital simulation software (e.g., Logisim).
  • Whiteboard and markers.
  • Student notebooks.
Introduction:
Begin with a quick visual of common electronic symbols and ask students what they think each represents. Recall prior work on Boolean expressions and truth tables, linking that knowledge to the visual symbols. Explain that by the end of the lesson they will confidently recognise and use these symbols to draw and interpret simple circuits.
Lesson Structure:
  1. Do‑now (5') – Matching activity of gate names to symbols on a handout.
  2. Mini‑lecture (10') – Present standard symbols for AND, OR, NOT, NAND, NOR, XOR, XNOR with examples.
  3. Guided practice (10') – Translate a set of Boolean expressions into gate symbols and sketch circuits together.
  4. Interactive simulation (10') – Students use Logisim to build the sketched circuits and verify outputs.
  5. Independent practice (10') – Worksheet with three practice questions; teacher provides immediate feedback.
  6. Check for understanding (5') – Quick exit quiz where learners identify a symbol from a given expression.
Conclusion:
Summarise how each symbol maps to a specific Boolean operation and why accurate notation matters in circuit design. Have students complete an exit ticket by drawing the symbol for a NAND gate from a description. Assign homework to create a hand‑drawn circuit that implements a given Boolean expression using the correct symbols.