KS3 Computing Cover Work With No Computers: A Step-by-Step Guide
How to set a one-hour KS3 Computing cover lesson that a non-specialist can run in an ordinary classroom with no devices. Includes a checklist, a fill-in cover note and a full scripted binary lesson with answers.
Computing cover often goes wrong for a simple reason. The lesson on the scheme of work needs computers, but the cover is happening in a classroom without them, or the network is down. The cover supervisor may also have no Computing background, so "carry on with your Python project" won't work.
This guide shows you how to set Computing cover that works on paper with any adult in the room. It has a planning checklist, a cover note template you can fill in and a complete worked lesson you can use today.
Step 1: Decide whether the lesson can follow the scheme of work
Ask yourself these three questions before you write anything:
- Will the class definitely have working devices? If you can't be sure, plan for paper.
- Can the cover adult fix a login problem or a crashed program? If not, the lesson must not depend on software.
- Would a pupil who missed the last lesson still be able to do the task? Cover classes often include pupils who were absent, and the adult can't re-teach.
If any answer is "no" or "not sure", set an unplugged lesson. Lots of KS3 Computing works well on paper:
- Data representation: binary numbers, how images are stored as pixels, character codes
- Algorithms: writing exact instructions, flowcharts, finding and fixing errors (debugging)
- Networks: how a message is split into packets and sent across the internet
- Online safety and cyber security: spotting phishing messages, strong passwords, personal data
- AI literacy: what training data is, and how a biased dataset gives biased results
Step 2: Choose a task with a right answer
Non-specialists find marking and supporting hard when the work is open-ended, like "research an inventor". Pick tasks where the answer can be checked against a key, such as converting numbers, tracing a flowchart or sorting messages into "safe" and "phishing". The supervisor can then tell pupils if they're right without needing to know the subject.
Step 3: Script the lesson, don't just describe it
"Pupils complete the binary worksheet" isn't enough. Write down what the adult should say, in what order and for how long. Read your script aloud once. If you find yourself explaining something that isn't on the page, add it to the page.
Step 4: Use this cover note template
Copy it and fill in the brackets.
Class: [Year group and set] Room: [Room] Period: [Time] Topic: [e.g. Binary numbers] Where pupils are up to: [One sentence, e.g. "They have not done binary before."] Resources in the pile: [e.g. 32 worksheets, answer key, spare pencils] Seating: [Seating plan location, or "free seating is fine"]
Timings and script:
- 0–5 min: [Do-now task written on the board]
- 5–15 min: [What to read out or demonstrate]
- 15–45 min: [Main task, and what to say if pupils get stuck]
- 45–55 min: [Extension for early finishers]
- 55–60 min: [Exit question and how to collect the work]
If pupils finish early: [Specific extension task] Pupils who need support: [Names and one practical adjustment each] Collect in: [Worksheets in the named tray / pupils keep in books] Behaviour contact: [Name and room of on-call or head of department]
Step 5: Run through the checklist before you leave
- [ ] Every printed sheet is in the pile, with 3–4 spares
- [ ] The answer key is a separate sheet that pupils can't see
- [ ] The starter is written down so the adult can copy it onto the board
- [ ] Nothing in the lesson needs a login, a website or a video
- [ ] The extension task is on paper, not "go on the computers"
- [ ] Any Computing vocabulary used has a one-line definition on the sheet
- [ ] The cover note says where the finished work goes
Worked Example: A Full One-Hour Binary Lesson
You can use this lesson as it is. It needs one worksheet per pupil and the answer key below.
Do-now (0–5 minutes)
Write on the board: "A light switch has only two positions. List three other things that have only two states."
Possible answers: on/off, yes/no, open/closed, true/false, heads/tails.
Explanation (5–15 minutes): script for the cover adult
Read this aloud:
"Computers are built from millions of tiny switches that can only be on or off. We write on as 1 and off as 0. This is called binary. To store a number, the computer uses a row of switches. Each position in the row has a value, and each value is double the one to its right."
Draw this on the board:
128 | 64 | 32 | 16 | 8 | 4 | 2 | 1
"To read a binary number, write it under the values. Wherever there's a 1, add that value. Ignore the 0s."
Work through this example on the board:
- Binary 00001101 goes under the values like this: 8 has a 1, 4 has a 1, 2 has a 0, 1 has a 1
- 8 + 4 + 1 = 13
"Each 1 or 0 is called a bit. A group of eight bits is called a byte."
Main task (15–45 minutes)
Part A: Binary to denary (ordinary numbers). Convert these:
- 00000011
- 00000101
- 00001010
- 00010000
- 00011001
- 00101010
- 01100100
- 11111111
Part B: Denary to binary. Script for the adult: "Start at 128. If the number is at least that big, write 1 and take the value away. If not, write 0. Move to the next value and repeat."
- 6
- 9
- 20
- 33
- 50
- 100
What to say if a pupil is stuck: "Write the eight values out first. Then, for each 1, put a tick above that value and add up the ticked ones." You don't need to explain it any other way.
Extension (45–55 minutes)
- What's the biggest number you can make with 4 bits? With 8 bits?
- Pupils write their age in binary, then the day of the month they were born.
- Challenge: what happens to a binary number when you add a 0 on the right-hand end and drop the left-hand digit? Try it with 00000101.
Exit question (55–60 minutes)
Pupils write their answer on the bottom of the sheet: "Why do computers use binary instead of the numbers 0 to 9?"
A good answer mentions that computer switches only have two states, on and off.
Answer key (for the adult only)
Part A
- 3
- 5
- 10
- 16
- 25
- 42
- 100
- 255
Part B
- 00000110
- 00001001
- 00010100
- 00100001
- 00110010
- 01100100
Extension
- With 4 bits the biggest number is 15 (1111). With 8 bits it is 255 (11111111).
- Answers will vary. Check by adding the values under each 1.
- 00000101 (5) becomes 00001010 (10). Shifting the bits one place to the left doubles the number, as long as no 1 drops off the left-hand end.
Making It Easier Next Time
The quickest fix for future absences is a standing cover folder kept in the department office. Fill it with five or six unplugged lessons like the one above, each with its script, worksheet and answer key. Label each lesson with the topics pupils need to have done first (most need none). Then whoever covers can take the next unused lesson, and you don't have to write cover from home when you're ill.
A good mix gives each year group something new. For example: binary, writing algorithms and debugging, spotting phishing, how packets travel across a network, pixel images and an introduction to AI and training data. All of these work with a pencil, a printed sheet and an adult reading from a script.
Browse the Quillwork shop