Lesson Plan

Resources → Subject Notes → Computer Science → Notes
Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Explain the purpose of a given algorithm
Learning Objective/s:
  • Read and interpret a given algorithm expressed in pseudocode.
  • Identify the input, processing steps, and output of an algorithm.
  • Explain the purpose of an algorithm in solving a specific problem.
  • Describe the algorithm’s efficiency and recognize its O(n) time complexity.
  • Apply the maximum‑finding algorithm to related tasks such as finding a minimum or the index of the maximum.
Materials Needed:
  • Projector or interactive whiteboard
  • Printed handout of the maximum‑finding algorithm
  • Laptops with a simple IDE or code editor
  • Whiteboard markers and eraser
  • Sample data sets (lists of numbers) for group activity
 Introduction:
Begin with the question, “How would you find the highest score in a class without sorting?” Connect this to students’ prior experience with sequences and loops. Explain that by the end of the lesson they will be able to read an algorithm and clearly state its purpose and efficiency.
Lesson Structure:
  1. Do‑Now (5') – Students write a one‑sentence description of how to locate the largest number in a list and share responses.
  2. Direct Instruction (10') – Teacher defines an algorithm and walks through the maximum‑value pseudocode, highlighting input, process, and output.
  3. Guided Practice (12') – Class annotates each step on the handout, identifying purpose and efficiency; teacher checks understanding with questions.
  4. Collaborative Activity (15') – Small groups run the algorithm on provided data sets using laptops, record the max, and discuss why every element must be examined.
  5. Misconception Check (5') – Quick poll on common errors; students correct false statements.
  6. Extension Discussion (8') – Explore modifications for finding the minimum, the index of the maximum, or counting occurrences of the maximum.
  7. Exit Ticket (5') – Students write the algorithm’s purpose in one sentence and note its time complexity.
Conclusion:
Recap that the algorithm systematically scans a list to identify the greatest value in linear time. Collect exit tickets confirming each student can state the purpose and complexity. Assign homework: write pseudocode to find the minimum value in a new list and explain its purpose.