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 |
|---|---|---|---|---|---|
| 16.1 | Process states and scheduling A single processor core can only run one instruction stream at a time, yet a computer appears to run dozens of programs at once. | Think-Pair-Share | 6 Q, 21 marks | 6 MCQ | tab 7 |
| 16.1 | Paging, segmentation and virtual memory Modern computers run programs whose total size is far bigger than the RAM fitted. | Rally Coach | 6 Q, 21 marks | 6 MCQ | none |
| 16.2 | The stages of compilation A compiler does not translate a program in one leap. | Jigsaw | 6 Q, 18 marks | 6 MCQ | none |
| 16.2 | BNF and syntax diagrams Before a parser can check a program, the grammar of the language has to be written down precisely. | Corners | 6 Q, 19 marks | 6 MCQ | none |
| 16.2 | Reverse Polish notation We write 3 + 4 with the operator in the middle, and need brackets and precedence rules to make longer expressions unambiguous. | Rally Coach | 6 Q, 16 marks | 6 MCQ | tab 1 |
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