Lesson Plan

Lesson Plan
Grade: Date: 17/01/2026
Subject: Computer Science
Lesson Topic: Define and use non-composite types
Learning Objective/s:
  • Describe the three non‑composite user‑defined types (enumerated, subrange, type synonym).
  • Explain how each type improves code clarity, safety, and maintainability.
  • Apply the syntax to declare and use these types in a Pascal‑style program.
  • Write simple functions/procedures that utilise enumerated and subrange types.
  • Identify common pitfalls when working with non‑composite types.
Materials Needed:
  • Projector or interactive whiteboard
  • Computer with Pascal/IDE installed
  • Printed handout of type syntax summary
  • Example code sheet (ExamResult program)
  • Worksheets with practice questions
  • Exit‑ticket slips
Introduction:
Begin with a quick poll: Which data types have you already used in your programs? Review that primitive types are built‑in, then explain that today we’ll extend this with user‑defined non‑composite types. Students will know they can recognise, declare and safely manipulate enumerated, subrange and synonym types by the end of the lesson.
Lesson Structure:
  1. Do‑now (5’) – Students list primitive types they know on sticky notes.
  2. Mini‑lecture (10’) – Define non‑composite types, show syntax and purpose with examples.
  3. Guided coding (15’) – Teacher walks through the ExamResult program, highlighting each type.
  4. Pair activity (15’) – Learners create their own enumerated and subrange types and test them in the IDE.
  5. Whole‑class review (10’) – Discuss common pitfalls and answer questions.
  6. Exit ticket (5’) – Write one correct declaration for each non‑composite type.
Conclusion:
Summarise how enumerated, subrange and type‑synonym definitions enhance readability and error checking. Students complete an exit ticket by writing a brief type declaration, which you collect for quick assessment. Assign homework to extend the ExamResult program with a new enumerated type for exam status.