Lesson Plan

Resources → Subject Notes → Computer Science → Notes
Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Use flowcharts, structure diagrams and pseudocode to construct a solution
Learning Objective/s:
  • Describe the key characteristics of an algorithm and its components.
  • Analyse a problem to identify inputs, outputs and constraints.
  • Design algorithmic solutions using appropriate representations (flowchart, structure diagram, pseudocode).
  • Translate a designed solution into executable code and test it with sample data.
  • Document algorithmic solutions clearly using correct symbols and syntax.
Materials Needed:
  • Projector and screen
  • Whiteboard and markers
  • Printed handouts of flowchart symbols and pseudocode conventions
  • Structure‑diagram example sheets
  • Computers with a simple IDE or code editor
  • Worksheet with practice problems
 Introduction:
Begin with a quick discussion of everyday algorithms, such as a recipe, to hook interest. Review the definition of an algorithm and why steps must be clear, finite and effective. Explain that today students will learn to represent algorithms using flowcharts, structure diagrams and pseudocode, and will be able to produce a complete, testable solution. Success will be measured by creating correct diagrams and pseudocode for a given problem.
Lesson Structure:
  1. Do‑now (5') – Students list the steps of a simple daily task and share to recall algorithm characteristics.
  2. Mini‑lecture (10') – Review algorithm properties, flowchart symbols, structure‑diagram hierarchy and pseudocode conventions.
  3. Guided practice (15') – Work through the “average of three numbers” example together, constructing a flowchart, structure diagram and pseudocode on the board.
  4. Collaborative activity (20') – In pairs, students receive a new problem (e.g., calculate total price with tax) and create their own flowchart, structure diagram and pseudocode; teacher circulates to give feedback.
  5. Testing & debugging (10') – Pairs exchange designs, identify test cases and simulate execution to verify correctness.
  6. Consolidation (5') – Whole‑class review of common errors and exam tips.
  7. Exit ticket (5') – Students write one key takeaway and a remaining question.
Conclusion:
Summarise how flowcharts, structure diagrams and pseudocode complement each other and reinforce accurate problem analysis. Collect exit tickets to gauge understanding. For homework, students will complete a worksheet converting a given problem into all three representations and test the solution with three data sets.