Lesson Plan

• Describe the purpose of variable declarations in pseudocode.
• Identify appropriate data types for given variables.
• Write correct DECLARE statements with optional initial values.
• Apply a step‑by‑step procedure to place declarations at the start of an algorithm.
• Avoid common pitfalls such as missing types or mismatched initial values.

• Projector or interactive whiteboard
• Printed handout with variable declaration examples
• Whiteboard and markers
• Student laptops with a simple pseudocode editor
• Sample algorithm worksheets
• Sticky notes for quick checks

Begin with a quick recall: why must variables be declared before use in programming? Students will connect this to the need for clear identifiers and data types. Explain that by the end of the lesson they will be able to write accurate pseudocode declarations and recognise common errors. Success will be measured through a short exit ticket where they create their own declarations.

1. Do‑Now (5'): Students list any variables they used in yesterday’s algorithm and note their types.
2. Mini‑lecture (10'): Explain the purpose of declarations and review common data types using projector slides.
3. Guided practice (12'): Walk through the generic DECLARE syntax and complete the example table together.
4. Pair activity (15'): Pairs receive a worksheet with scenarios; they identify purpose, choose type, and write DECLARE statements with optional initial values.
5. Whole‑class review (8'): Pairs share answers; teacher highlights common pitfalls (missing type, reserved words, mismatched values).
6. Quick check (5'): Exit ticket – students write two correct DECLARE statements for given variables.

Summarise that variable declarations establish identifiers, types, and optional start values, forming the foundation of any algorithm. Highlight how the exit ticket demonstrated their ability to apply the syntax correctly. Assign homework: students create a short pseudocode algorithm that includes at least five variable declarations of varied types.