Lesson Plan

Resources → Subject Notes → Computer Science → Notes
Lesson Plan
Grade: 10 Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Complete a trace table to document a dry-run of an algorithm
Learning Objective/s:
  • Describe the purpose and components of a trace table.
  • Explain how to perform a dry‑run of an algorithm using a trace table.
  • Apply the trace‑table method to complete a step‑by‑step record for a WHILE‑loop algorithm.
  • Analyse the final output to verify the correctness of the algorithm.
Materials Needed:
  • Projector or interactive whiteboard
  • Printed handout with pseudo‑code and empty trace‑table
  • Whiteboard and markers
  • Student laptops with a simple IDE or text editor (optional)
  • Sticky notes for quick checks
 Introduction:
Begin with the question “How can we be sure an algorithm works before we code it?” Review prior learning on variables and loops. Explain that today’s success criteria are to construct a correct trace table and use it to predict the algorithm’s output.
Lesson Structure:
  1. Do‑now (5’) – Students answer a short exit ticket recalling variables and loops; teacher reviews.
  2. Mini‑lecture (10’) – Define a trace table, show its components, and walk through the sample algorithm (n = 4) on the board.
  3. Guided practice (15’) – Whole class fills the first half of the provided trace table together, discussing each statement.
  4. Independent practice (15’) – Students complete the remaining steps for n = 5 on their handout while the teacher circulates.
  5. Check for understanding (5’) – Quick quiz (Kahoot or show of hands) on the final output for n = 5.
  6. Reflection (5’) – Each student writes one sentence on how trace tables help debugging and shares it.
Conclusion:
Recap that trace tables let us verify algorithm logic step by step. For the exit ticket, students write the final sum for n = 5 on a sticky note and hand it in. Homework: create a trace table for a new algorithm that multiplies a series of numbers.