Lesson Plan

Resources → Subject Notes → Computer Science → Notes
Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Write algorithms using pseudocode or flowcharts
Learning Objective/s:
  • Describe the problem‑solving process and identify inputs, processing, and outputs.
  • Write clear pseudocode using standard conventions for control structures and I/O.
  • Design and construct flowcharts employing correct symbols to represent algorithm steps.
  • Test and refine algorithms with sample data and edge cases.
  • Translate between pseudocode and flowchart representations accurately.
Materials Needed:
  • Projector or interactive whiteboard for displaying slides and flowchart examples.
  • Printed handouts of pseudocode conventions and flowchart symbols.
  • Whiteboard and markers for live algorithm drafting.
  • Computers with an IDE or pseudocode editor for student practice.
  • Sample worksheet with practice questions (max value, temperature classification, error correction).
 Introduction:
Begin with a quick think‑pair‑share where students list everyday tasks they follow step‑by‑step, linking this to algorithmic thinking. Review the IGCSE requirement to express solutions in a language‑independent form. Explain that by the end of the lesson they will be able to produce correct pseudocode and flowcharts and evaluate their algorithms against given criteria.
Lesson Structure:
  1. Do‑now (5') – Students solve a simple real‑world task in plain English; teacher collects responses to highlight need for structured steps.
  2. Mini‑lecture (10') – Present the 6‑stage problem‑solving process and pseudocode conventions, using the projector.
  3. Guided example (12') – Walk through the “Sum of Even Numbers” problem, constructing pseudocode together, then mapping each line to flowchart symbols.
  4. Pair activity (15') – Students choose one practice question, draft pseudocode, and create a corresponding flowchart on paper.
  5. Peer review (8') – Pairs exchange work, check for correct symbols, START/END, and logical flow; teacher circulates to give feedback.
  6. Whole‑class debrief (5') – Highlight common errors, discuss testing with edge cases, and reinforce translation between representations.
  7. Exit ticket (5') – Students write one concise success criterion they met and one question they still have.
Conclusion:
Summarise how the systematic process and clear conventions enable reliable algorithm design. Collect exit tickets to gauge understanding and assign homework to complete a pseudocode‑to‑flowchart conversion for a new problem. Remind students to review the symbol table before the next class.