| Lesson Plan | |
| Grade: | Date: 17/01/2026 |
| Subject: Computer Science | |
| Lesson Topic: Define and use non-composite types | |
Learning Objective/s:
|
|
Materials Needed:
|
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:
|
|
|
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. |
|
Your generous donation helps us continue providing free Cambridge IGCSE & A-Level resources, past papers, syllabus notes, revision questions, and high-quality online tutoring to students across Kenya.