Lesson Plan

• Describe the meaning of the logical operators AND, OR, NOT, IF‑THEN and IF‑AND‑ONLY‑IF.
• Apply logical expressions to specify pre‑conditions, loop invariants and post‑conditions in pseudocode.
• Construct input, processing and output sections of an algorithm using appropriate logical statements.
• Analyse a given algorithm (e.g., GCD) and identify the logical conditions that control its flow.
• Design a simple algorithm (e.g., leap‑year test) that correctly uses logical operators to produce the required output.

• Projector and screen
• Whiteboard and markers
• Printed handout of logical operator table
• Worksheet with GCD example and leap‑year exercise
• Laptops or tablets with a simple IDE/pseudocode editor
• Exit‑ticket slips

Begin with a quick poll: “What everyday decisions do you make using “and” or “or”?” Connect this to prior knowledge of IF statements from earlier lessons. Explain that today’s success criteria are to correctly express algorithm parts with logical statements and to produce a working pseudocode solution.

1. Do‑Now (5'): Short quiz on symbols for AND, OR, NOT, IF‑THEN.
2. Mini‑lecture (10'): Review logical operators, show mapping to pseudocode, discuss pre‑/post‑conditions.
3. Guided Example (15'): Walk through the GCD algorithm, identify input, processing, output using logical statements.
4. Paired Activity (15'): Students write a leap‑year algorithm, filling a template that requires explicit logical conditions.
5. Class Share & Feedback (10'): Pairs present their logic; teacher highlights common errors and correct usage.
6. Exit Ticket (5'): Write one sentence explaining why logical precision is essential for algorithm implementation.

Recap the role of logical operators in defining clear algorithm sections and how they translate directly into code. Collect exit tickets to gauge understanding, and assign homework: create an algorithm that determines if a number is prime, using logical statements for input, processing, and output.