Lesson Plan

• Describe the standard symbols for AND, OR, NOT, NAND, NOR, and XOR gates.
• Convert between Boolean expressions and their corresponding gate symbols.
• Construct truth tables for each of the six basic gates.
• Apply the gates to design simple combinational circuits.

• Projector or interactive whiteboard
• Printed worksheets with gate‑symbol matching and truth‑table tasks
• Logic‑gate cards or simulation software (e.g., Logisim)
• Whiteboard and markers
• Laptops or tablets for student simulations

Begin with a quick “mystery gate” challenge where students guess the gate from a simple truth table. Review prior knowledge of Boolean operators (AND, OR, NOT) and explain that today they will master all six standard symbols. Success will be measured by correctly labeling symbols and building a short circuit.

1. Do‑now (5'): Matching worksheet – students pair gate symbols with names.
2. Direct instruction (10'): Present the six symbols and their Boolean expressions using the projector.
3. Guided practice (12'): Build truth tables together for each gate on the whiteboard.
4. Interactive simulation (10'): Students use Logisim to create a circuit for the expression F = (A AND B) OR (NOT C).
5. Collaborative challenge (8'): Small groups solve the three practice questions from the source notes.
6. Check for understanding (5'): Exit‑ticket – write one real‑world example where a NAND gate is useful.

Recap the symbols, their Boolean forms, and how truth tables verify gate behaviour. Collect exit‑tickets to gauge individual mastery and assign a short homework: complete a worksheet converting three Boolean expressions into gate diagrams. Remind students that these fundamentals underpin all digital circuit design.