Lesson Plan

• Describe the purpose of truth tables in analysing digital circuits.
• Explain the step‑by‑step process for constructing a truth table for any Boolean expression.
• Apply truth tables to verify the correctness of a logic circuit.
• Construct a truth table for a given expression and sketch the corresponding gate diagram.

• Projector and screen
• Whiteboard and markers
• Printed worksheets with practice expressions
• Truth‑table template handouts
• Computers with a simple logic‑simulation tool (optional)

Begin by asking students how they can be certain a digital circuit works for every possible input combination. Review the Boolean operators (AND, OR, NOT, XOR) they have already mastered. Explain that by the end of the lesson they will be able to build a complete truth table and translate it into a working circuit, which will be the success criteria for today.

1. Do‑now (5'): Quick quiz on Boolean operators and basic gate symbols.
2. Mini‑lecture (10'): Explain why truth tables are essential and outline the five construction steps.
3. Guided example (10'): Construct the truth table for F = (A ∧ B) ∨ ¬C on the projector, highlighting intermediate columns.
4. Pair activity (10'): Students create a truth table for G = ¬(A ∨ B) ∧ (B ⊕ C) and sketch the corresponding circuit.
5. Whole‑class check (5'): Review answers, discuss common errors, and connect table rows to gate outputs.
6. Exit ticket (5'): Each student writes one step they found most challenging and a question they still have.

Recap that truth tables provide a systematic way to verify and design digital circuits. Collect exit tickets and remind students to complete the additional worksheet for homework, which includes three new Boolean expressions and a request to draw the associated gate diagrams for the next class.