Unit at a glance
5 lessons, 225 minutes of teaching
Scheme of work
The lessons in order
| Ref | Lesson pack | Structure | Worksheet | Quiz | Lab tab |
|---|---|---|---|---|---|
| 10.1 | Data types and records Every item of data in a program has a data type that fixes what values it can hold and what you can do with it. | Jigsaw | 6 Q, 21 marks | 6 MCQ | none |
| 10.2 | 1D and 2D arrays An array stores a fixed number of values of the same data type under one identifier, each reached by its index. | Corners | 6 Q, 23 marks | 6 MCQ | tab 6 |
| 10.2 | Linear search and bubble sort The two array algorithms the AS syllabus names. | Frayer Model | 6 Q, 24 marks | 6 MCQ | tab 1, tab 2 |
| 10.3 | Text files Variables and arrays live in main memory and vanish when the program stops. | Connect-Extend-Challenge | 6 Q, 23 marks | 6 MCQ | tab 6 |
| 10.4 | Stacks, queues and linked lists An abstract data type is defined by what you can do with it, not by how it is stored. | Anticipation / Reaction Guide | 6 Q, 23 marks | 6 MCQ | tab 1, tab 2, tab 3 |
Each pack holds the plan, worksheet and quiz for its lesson. Teach the rows in order; the lab tabs match the student lessons.
Also for this topic