Lesson Plan

• Describe why clear identifier names improve algorithm readability and reduce errors.
• Apply naming guidelines to create descriptive, consistent, and appropriately typed identifiers.
• Construct an identifier table that records each data item’s name, type, and purpose.
• Translate an identifier table into correct pseudocode for a given problem.
• Evaluate and refine identifiers for clarity and brevity.

• Projector or interactive whiteboard
• Printed handout of identifier guidelines and example table
• Student worksheets with the library‑book practice problem
• Laptops/computers with a simple IDE or pseudocode editor
• Whiteboard markers
• Sticky notes for quick brainstorming

Begin with a quick “name‑that‑variable” challenge to highlight how vague names can confuse readers. Review students’ prior experience writing algorithms and remind them that clear identifiers are a key success criterion for this lesson.

1. Do‑Now (5'): Students write three recent variable names and discuss their clarity.
2. Mini‑lecture (10'): Explain the purpose of identifiers, present the five naming guidelines, and show the example identifier table.
3. Guided practice (12'): Walk through the class‑average example, filling the identifier table together and converting it to pseudocode.
4. Pair activity (15'): Learners create an identifier table for the library‑book problem and draft a brief pseudocode outline.
5. Whole‑class review (8'): Groups share tables; teacher highlights strengths and common pitfalls, prompting refinements.
6. Exit ticket (5'): Each student writes one rule for good identifiers and one example identifier for the library scenario.

Recap the importance of descriptive identifiers and how the identifier table supports algorithm design. Collect exit tickets to gauge understanding, and assign homework to complete a full pseudocode solution for the library problem and to design an identifier table for a new real‑world scenario.