Lesson Plan

• Describe the function of basic logic gates (AND, OR, NOT, etc.).
• Translate a Boolean expression into a logic‑circuit diagram.
• Construct and label a circuit that matches a given truth table.
• Verify the correctness of a circuit by producing its truth table.

• Projector or interactive whiteboard
• Printed handouts of gate symbols and truth tables
• Logic‑gate simulation software (e.g., Logisim) or breadboard kits
• Worksheets with Boolean expressions and practice questions
• Markers and whiteboard

Begin with a quick “gate‑match” challenge to activate prior knowledge of AND, OR and NOT symbols. Review how Boolean expressions map to real‑world decisions, then state that today’s success criteria are to design a correct circuit and prove it with a truth table.

1. Do‑now (5') – Students complete a short truth‑table matching worksheet.
2. Mini‑lecture (10') – Review gate symbols, Boolean operations, and the translation process.
3. Guided example (15') – Walk through constructing the circuit for F = (A ∧ B) ∨ ¬C and verify its truth table.
4. Pair work (20') – Each pair simplifies a given Boolean expression, selects appropriate gates, sketches the circuit, and labels all nodes.
5. Whole‑class check (10') – Selected pairs present; class validates using truth‑table verification.
6. Exit ticket (5') – Students write one step they found challenging and how they resolved it.

Recap the key steps: simplify the expression, choose gates, draw connections, and confirm with a truth table. Collect exit tickets to gauge understanding, and assign a homework task to design a circuit for a new Boolean expression using a Karnaugh map.