Lesson Plan

• Describe how each logic gate corresponds to a Boolean operator.
• Translate a given circuit diagram into an accurate Boolean expression.
• Construct a sum‑of‑products expression from a truth table.
• Apply parentheses correctly to preserve operator precedence.
• Verify expressions by building a quick truth table.

• Projector or interactive whiteboard
• Printed circuit diagrams and truth tables
• Student worksheets with practice questions
• Logic‑gate cards or simulation software (e.g., Logisim)
• Whiteboard and markers

Start with a quick question about everyday true/false decisions to hook interest. Review the Boolean operators covered last lesson and link them to hardware gates. Explain that today students will demonstrate mastery by writing correct expressions from both circuit diagrams and truth tables.

1. Do‑now (5'): True/false quiz on AND, OR, NOT, XOR.
2. Mini‑lecture (10'): Gate‑operator mapping and expression syntax with examples.
3. Guided practice (15'): Convert a sample circuit to a Boolean expression, modelling the step‑by‑step process.
4. Pair activity (15'): Use the SOP method on a provided truth table and write the expression.
5. Whole‑class check (10'): Share results, construct a quick truth table to verify correctness.
6. Extension (optional 5'): Translate a given Boolean expression back into a circuit description.

Recap the two pathways—circuit → expression and truth table → expression—and emphasise the importance of parentheses. Students complete an exit ticket by writing the expression for a new circuit shown on the board. For homework, finish the worksheet with three additional conversion problems.