Lesson Plan

Resources → Subject Notes → Information Technology IT → Notes
Lesson Plan
Grade: Date: 17/01/2026
Subject: Information Technology IT
Lesson Topic: Write algorithms with decision-making (branching, looping)
Learning Objective/s:
  • Describe the purpose and essential characteristics of an algorithm.
  • Apply decision‑making structures (if, if‑else, nested if, switch) in pseudo‑code.
  • Construct and trace loops (while, do‑while, for) to solve computational problems.
  • Translate algorithms that use branching and looping into accurate flowcharts using standard symbols.
  • Evaluate algorithms by testing edge cases and confirming termination.
Materials Needed:
  • Projector or interactive whiteboard
  • Printed handouts of flowchart symbols and sample algorithms
  • Computers with a simple IDE or pseudo‑code editor
  • Whiteboard markers and erasers
  • Worksheets with practice questions
  • Sticky notes for quick checks
 Introduction:
Begin with a quick poll: “What everyday tasks involve making choices or repeating steps?” Review the previous lesson on basic algorithm structure, then state today’s success criteria – students will write algorithms that incorporate branching and looping and represent them clearly as flowcharts. This connects prior knowledge to new decision‑making concepts.
Lesson Structure:
  1. Do‑Now (5’) – Students list real‑world examples of decisions and repetitions.
  2. Mini‑lecture (10’) – Review algorithm characteristics, standard flowchart symbols, and decision‑making constructs.
  3. Guided practice (15’) – Walk through the factorial while‑loop algorithm and co‑create its flowchart on the board.
  4. Group activity (20’) – Teams write an algorithm to print all even numbers up to n using a for loop and draw the corresponding flowchart.
  5. Peer review (10’) – Groups exchange flowcharts, using a checklist to verify correct symbols and loop logic.
  6. Error‑identification task (10’) – Analyse a provided pseudo‑code, identify logical errors, and rewrite it correctly.
  7. Summary & Q&A (5’) – Recap key points, answer lingering questions, and preview the next lesson.
Conclusion:
Recap the four core decision‑making and looping structures and how they are visualised in flowcharts. Students complete an exit ticket by writing one algorithm line that uses a decision or loop and drawing its symbol. Assign homework: create a flowchart for a simple “grade‑assignment” algorithm using at least two nested decisions.