Lesson Plan

• Describe the function of each basic logic gate (AND, OR, NOT) and its truth table.
• Explain the operation of derived gates (NAND, NOR, XOR, XNOR) and their role in digital circuits.
• Convert simple Boolean expressions into gate diagrams and vice‑versa.
• Apply knowledge of universal gates to design a circuit using only NAND or only NOR gates.

• Projector and screen
• Whiteboard and markers
• Printed handouts of truth tables and gate symbols
• Worksheet with practice conversion tasks
• Logic‑gate cards or digital simulation software (e.g., Logisim)
• Exit‑ticket slips

Begin with a quick visual of a real‑world digital device and ask students what makes it “think”. Review that they already know true/false values from previous lessons. State that today they will identify how hardware implements these values using logic gates and what they must be able to do by the end of the lesson.

1. Do‑now (5'): Quick quiz on truth tables for AND, OR, NOT on exit tickets.
2. Mini‑lecture (10'): Review Boolean operators, introduce symbols and truth tables for all basic and derived gates.
3. Guided practice (15'): Teacher models building the circuit F = (A ∧ B) ∨ ¬C on the board; students replicate on worksheets.
4. Collaborative activity (15'): Groups use gate cards or Logisim to design a circuit for a given expression, identifying any universal gates used.
5. Check for understanding (5'): Exit ticket – write the truth table for a NAND gate and explain why NAND is universal.

Summarise the key functions of each gate and remind students of the power of universal gates. Collect exit tickets to gauge understanding, and assign homework: convert a provided Boolean expression into a NAND‑only circuit and draw the corresponding diagram.