Lesson Plan

Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Document a simple algorithm using a structured English description, a flowchart or pseudocode
Learning Objective/s:
  • Describe how to document an algorithm using structured English, flowcharts, and pseudocode.
  • Convert a problem statement into a clear algorithmic description.
  • Apply standard symbols and conventions to create an accurate flowchart.
  • Write pseudocode with proper indentation and control structures.
  • Evaluate algorithm documentation for clarity and completeness.
Materials Needed:
  • Projector or interactive whiteboard
  • Printed handout of the example problem and algorithm steps
  • Whiteboard markers
  • Student worksheets for structured English, flowchart drafting, and pseudocode
  • Laptops or tablets with a simple drawing tool (e.g., draw.io) for flowchart creation
Introduction:

Begin with a quick discussion about why clear algorithm documentation matters in programming and debugging. Recall that students have previously written basic pseudocode for sorting tasks. Today they will learn three complementary techniques—structured English, flowcharts, and pseudocode—and will be able to choose the appropriate one for a given problem. Success will be demonstrated by correctly documenting the “find maximum” algorithm.

Lesson Structure:
  1. Do‑Now (5'): Students answer a short question: “What information must be included when describing an algorithm?” (Check understanding).
  2. Mini‑lecture (10'): Explain the three documentation techniques and show examples from the source material.
  3. Guided practice – Structured English (10'): Co‑construct the max‑value algorithm step‑by‑step on the board.
  4. Guided practice – Flowchart (10'): Students sketch the flowchart using standard symbols while the teacher circulates.
  5. Guided practice – Pseudocode (10'): Learners write pseudocode in notebooks, then compare with the provided template.
  6. Consolidation (5'): Quick exit‑ticket quiz where students identify which documentation method best fits a new scenario.
Conclusion:

Review the key features of each documentation method and how they convey the same algorithmic logic. Students complete an exit ticket summarising the steps of the max‑value algorithm in one of the three formats. For homework, they will document a simple “average of numbers” algorithm using a method of their choice.