Lesson Plan

Resources → Subject Notes → Computer Science → Notes
Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Understand primary storage
Learning Objective/s:
  • Describe the role and characteristics of primary storage components (registers, cache, RAM, ROM).
  • Explain how address size determines maximum memory capacity and perform related binary calculations.
  • Compare volatile and non‑volatile primary storage and justify their use in a computer system.
  • Analyse a memory hierarchy diagram to identify where each type of primary storage fits.
  • Solve exam‑style questions involving memory addressing and capacity calculations.
Materials Needed:
  • Projector and screen
  • PowerPoint presentation on primary storage
  • Printed handout with memory hierarchy diagram
  • Worksheet containing a sample exam question
  • Computers with internet access for a memory‑simulation activity
  • Whiteboard and markers
 Introduction:
Begin with a quick poll: “Where does a program keep its data while it runs?” Connect this to students’ prior experience with RAM in games. Outline that by the end of the lesson they will be able to describe primary storage types, calculate memory capacity from address bits, and compare volatile versus non‑volatile memory. Success will be demonstrated through a short exam‑style problem.
Lesson Structure:
  1. Do‑now (5') – students answer the poll question on sticky notes; teacher notes misconceptions.
  2. Direct instruction (10') – present slides covering definition, characteristics, and hierarchy of primary storage.
  3. Guided practice (10') – work through an address‑size calculation example together on the board.
  4. Interactive activity (15') – students use an online memory‑hierarchy simulation to place registers, cache, RAM, and ROM.
  5. Collaborative worksheet (10') – pairs complete the sample exam question and compare answers.
  6. Check for understanding (5') – quick Kahoot quiz on volatility and typical capacities.
  7. Summary discussion (5') – recap key points and address any remaining questions.
Conclusion:
Summarise that primary storage provides the fast, directly addressable memory needed for program execution and that capacity is limited by address‑bus size. Ask students to write one key difference between volatile and non‑volatile storage on an exit ticket. For homework, assign a set of binary‑to‑decimal conversion problems and a short essay on how cache improves performance.