Final exam model papers
Full practice papers for the Grade 12 final exam of Computing, Reimagined: a 50-mark theory paper and a 20-mark practical exam, made to the course’s own specification grid. Every question and task has a model answer and a marking scheme.
- Final Exam Model Paper 1
- Final Exam Model Paper 2
- Final Exam Model Paper 3
- Final Exam Model Paper 4
- Final Exam Model Paper 5
- Final Exam Model Paper 6
- Final Exam Model Paper 7
- Final Exam Model Paper 8
- Final Exam Model Paper 9
- Final Exam Model Paper 10
The final exam of Computing, Reimagined
Computing, Reimagined is our own course, so its exams are ours too: Grades 8, 10 and 12 end with a final exam, the years of Nepal’s board exams. The Grade 12 result is out of 100, split as CDC splits its own Computer Science course: half given by the school (a practical exam at a computer and the year’s work) and half for a written theory paper.
| Part | What is marked | Marks |
|---|---|---|
| School: the year’s work | Capstone (Unit 9) 20, Term tests 5, Participation 5 | 30 |
| School: practical exam | Programs written and run on a computer, alone, with no internet or AI, before the teacher, with a short viva; 1 hour 30 minutes | 20 |
| Theory paper | Written, 2 hours, 20 questions | 50 |
| Total | 100 |
The theory paper is set to the course’s Specification Grid, Grade 12 Computing, made in the format of CDC’s grids: 50 marks in 2 hours, 20 questions in three sections, every question compulsory. It tests programming on paper as well as ideas: working an algorithm by hand, estimating how fast a program’s work grows, reading tests and code, reasoning about systems that fail, working a small RSA example, judging evidence and AI systems, and arguing a case. Each unit’s marks follow its share of the periods, and the questions are spread over four levels: remembering a fact (knowledge), explaining it (understanding), using it in a new situation (application), and analyzing, judging or creating (higher ability).
Every paper here keeps to the grid exactly: the same number of questions in each section and at each level, and each unit’s questions as the grid plans them below. A 3- or 8-mark question earns one mark for each point expected, so its marking scheme lists exactly that many points; so do the practical tasks.
The three sections
| Section | Kind of question | Questions | Marks | Knowledge | Understanding | Application | Higher ability |
|---|---|---|---|---|---|---|---|
| A | Multiple choice | 10 | 10 × 1 = 10 | 4 | 3 | 1 | 2 |
| B | Short answer | 8 | 8 × 3 = 24 | 1 | 4 | 2 | 1 |
| C | Long answer | 2 | 2 × 8 = 16 | 0 | 0 | 1 | 1 |
| Total marks | 20 | 50 | 7 | 15 | 15 | 13 |
The level columns give the number of questions at each level; the last row, the marks at each level.
Marks for each unit
| Unit | Periods | K | U | A | H | Marks | Unit group total |
|---|---|---|---|---|---|---|---|
| Algorithms and their limits | |||||||
| 1. Algorithms for Hard Problems | 12 | · | · | 8 | · | 8 | 13 |
| 2. The Limits of Computing | 10 | 1 | 3 | · | 1 | 5 | |
| Building software and systems | |||||||
| 3. Software Engineering | 14 | 1 | 4 | 3 | · | 8 | 14 |
| 4. Systems at Scale | 9 | 1 | 4 | 1 | · | 6 | |
| Data and AI | |||||||
| 5. Data, Evidence and Decisions | 12 | · | 3 | · | 3 | 6 | 14 |
| 6. Building and Judging AI Systems | 12 | · | · | · | 8 | 8 | |
| Security and society | |||||||
| 7. Cryptography and Trust | 9 | 1 | 1 | 3 | · | 5 | 9 |
| 8. Technology, Policy and You | 6 | 3 | · | · | 1 | 4 | |
| 9. Capstone Project (not in the theory paper: the capstone, marked by the school) | 20 | – | – | ||||
| Total | 104 | 7 | 15 | 15 | 13 | 50 | 50 |
K, U, A, H: each unit’s marks at each level (knowledge, understanding, application, higher ability). Each unit’s marks are its share of the 84 periods of the examined units, rounded (CDC allows ±2); the groups’ totals are fixed. The grid also sets each unit’s questions: which section and which level each one is, the same in every paper. Source: Science Playground, Computing, Reimagined, Grades 6–12: the curriculum, Section 5 (the marks split 50/50 as CDC's Computer Science, 2026-10-25).
The practical exam
20 marks, 1 hour 30 minutes. Marked by the school. Each student works alone at a computer, with no internet or AI, before the teacher, and shows each program running; the viva is a few questions about what the student did. Where a school has no computers, the tasks are done on a phone with the book’s on-page programs. Each paper has its own tasks of these kinds:
| Task | Unit | Marks |
|---|---|---|
| 1. Write a program with automatic tests that solves a given problem with a suitable data structure or algorithm (a shortest route, dynamic programming) | 1. Algorithms for Hard Problems | 7 |
| 2. Find and fix a failing test or a bug in given code | 3. Software Engineering | 4 |
| 3. Measure a given model or analysis and report one limit | 6. Building and Judging AI Systems | 4 |
| 4. Viva: questions about what the student did in the tasks | all the tasks | 5 |
| Total | 20 |
Continuous assessment
30 marks, given by the school through the year; there is nothing to practise for it here except the book itself.
| Capstone (Unit 9): the checkpoints the teacher signed through the year 5; the product and its tests 5; the viva with a live change 10 | 20 |
| Term tests: two of 50 marks, averaged and scaled | 5 |
| Participation: attendance, classwork and homework | 5 |
| Total | 30 |
These are practice papers made by Science Playground for its own course. Every program in them has been run, and every fact checked, but they have not yet been reviewed by teachers who have taught the course. If you find a mistake, please tell us.
