Lesson Plan

Resources → Subject Notes → Computer Science → Notes
Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: pseudocode using the three basic constructs of sequence, decision, and iteration
Learning Objective/s:
  • Describe the purpose and essential properties of an algorithm.
  • Identify and apply the three basic pseudocode constructs: sequence, decision, and iteration.
  • Write clear, correctly indented pseudocode for given problem statements.
  • Test pseudocode with sample inputs to verify correctness.
  • Recognize common pitfalls such as infinite loops and improper indentation.
Materials Needed:
  • Projector or interactive whiteboard for displaying slides and code.
  • Printed handouts of pseudocode conventions and example algorithms.
  • Computers with a simple IDE or text editor for students to write pseudocode.
  • Whiteboard and markers for flowchart sketches.
  • Sample worksheets with practice questions.
 Introduction:
Begin with a quick discussion: “What makes a set of instructions a good algorithm?” Connect to previous lessons on algorithm design. Explain that today’s success criteria are to write readable pseudocode using sequence, decision, and iteration.
Lesson Structure:
  1. Do‑Now (5’) – Students list characteristics of a good algorithm on sticky notes; teacher collects key points.
  2. Mini‑lecture (10’) – Review algorithm properties and introduce the three constructs with examples shown on screen.
  3. Guided practice (15’) – Whole class walks through sequence, decision, and iteration examples, emphasizing indentation and keyword usage.
  4. Independent activity (20’) – Students complete a worksheet writing pseudocode for two practice questions while teacher circulates for formative feedback.
  5. Peer review (10’) – Pairs exchange scripts, check for correct construct usage and proper formatting using a checklist.
  6. Whole‑class debrief (5’) – Highlight common pitfalls identified, clarify misconceptions, and answer questions.
Conclusion:
Summarise how the three constructs combine to form complete algorithms and remind students to test their pseudocode with varied inputs. For the exit ticket, each learner writes one tip to avoid infinite loops. Homework: complete the remaining practice questions and bring printed pseudocode for the next lesson.