How to Set KS3 Computing Cover Work With No Computers
A step-by-step guide to setting one-hour KS3 Computing cover lessons that need no computers, slides or specialist knowledge. It includes a complete binary lesson that a cover supervisor can run straight from the page.
Computing cover goes wrong in a few familiar ways. The computer room is booked. The network is down. Or the cover supervisor isn't confident running a lesson on PCs. If the work you set needs a login, a slide deck or a website, it can fall apart in the first five minutes.
You can fix this by building Computing cover work that only needs paper, pens and a printed script. This guide covers which topics work without a computer, what every cover lesson needs, and a complete one-hour lesson you can print today.
Step 1: Pick topics that work on paper
Large parts of the KS3 Computing curriculum are about ideas, not software, so they work well "unplugged." These topics are a good fit for cover:
- Binary and number representation. Converting between denary and binary, and the place values 128, 64, 32, 16, 8, 4, 2, 1.
- Algorithms and flowcharts. Writing precise instructions, using flowchart symbols, and tracing an algorithm by hand.
- Sequence, selection and iteration. Reading short paper pseudocode, predicting output and spotting bugs.
- Images and pixels. Colouring a grid from binary (1 = black, 0 = white) to see how a computer stores a bitmap.
- Cryptography. Caesar ciphers, decoding messages and talking about why modern encryption uses keys.
- Networks and online safety. How data travels in packets, what a digital footprint is, and safe choices online.
Some topics don't suit no-computer cover: anything that needs students to type and run code, use a particular piece of software, or finish coursework saved on the network. Keep those for when the class teacher is back.
Step 2: Use the same structure for every cover lesson
Cover runs more smoothly when every lesson follows the same pattern. Students know what's coming and the supervisor doesn't have to make anything up. A one-hour structure that works:
- Settle task (5 minutes). Something students can start in silence as they come in, written at the top of the sheet.
- Read-through (5–10 minutes). The supervisor reads a short explanation aloud from the script, or students read it on their sheet.
- Main task (25–30 minutes). Graded questions that get harder. Number them so you can see how far each student got.
- Challenge (10 minutes). An extension for fast finishers, so nobody sits idle.
- Check and wrap-up (5 minutes). Students mark a few answers using an answer key the supervisor reads out.
Step 3: Write the script for a non-specialist
The cover supervisor might not know what binary is, and that's fine. Your script should mean they never have to explain anything they don't understand. A one-page script should include:
- Timings for each section, written as clock-free durations ("first 5 minutes").
- Exact words to say, in quotation marks, for the introduction and each change of task.
- The answer key, so they can check work and answer "is this right?" without guessing.
- What to do if students say "we don't do this" or "sir/miss lets us go on the computers." A simple line works: "Today's work is on paper, and your teacher will be checking it."
- What to collect and where to leave it.
- One sentence on behaviour: which school system to follow and who to call. Always point to your school's own cover and behaviour policy rather than inventing new rules.
Step 4: Make it genuinely print-and-go
Before you leave the work, check that:
- Everything fits on as few A4 sides as possible and prints clearly in black and white.
- Nothing refers to a slide, video, website or QR code.
- Students write answers on the sheet itself, or the script tells them clearly to use exercise books.
- The answer key is on a separate page so it doesn't go out with the student copies.
- The class name, room and number of copies are written on the front.
Worked example: a complete one-hour binary cover lesson
You can copy this lesson as it is. It suits Year 7 or Year 8.
Settle task (5 minutes)
Write on the sheet: "Computers only understand two states: on and off. List as many things as you can that have only two states (for example, a light switch)."
Read-through (5–10 minutes)
Script for the supervisor to read aloud:
"Computers store everything using just two digits: 1 and 0. This is called binary. Each digit is called a bit, and 8 bits make a byte. In binary, each column is worth double the one to its right. For 8 bits, the columns are worth 128, 64, 32, 16, 8, 4, 2 and 1. To turn binary into a normal number, add up the column values wherever there's a 1."
Worked example on the sheet:
- Binary 00001101 has a 1 in the 8, 4 and 1 columns.
- 8 + 4 + 1 = 13.
Main task (25–30 minutes)
Part A: Binary to denary
- 00000011
- 00000101
- 00001010
- 00010111
- 01000001
- 11111111
Part B: Denary to binary (8 bits)
Tip on the sheet: start at the 128 column. If the number is at least that big, write 1 and subtract that column's value. If it isn't, write 0. Move right and repeat.
- 6
- 13
- 25
- 42
- 100
Challenge (10 minutes)
- What is the biggest number you can make with 8 bits? Explain how you know.
- Count from 0 to 15 in binary, writing each number with 4 bits.
- Write your age in binary, then your door number.
Answer key (separate page for the supervisor)
- 3
- 5
- 10
- 23 (16 + 4 + 2 + 1)
- 65 (64 + 1)
- 255
- 00000110
- 00001101
- 00011001
- 00101010
- 01100100
- 255, because every column is 1: 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = 255. Counting 0, that gives 256 different values.
- 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111
- Answers will vary. Check that the column values add up to the right number.
Wrap-up (5 minutes)
The supervisor reads out answers 1–11 and students tick or correct their own work in a different colour. Collect the sheets.
A quick second example: a Caesar cipher starter
If you need a short task for a different lesson or a filler, this one works with no preparation:
- Explain on the sheet: "A Caesar cipher shifts each letter along the alphabet. With a shift of 3, A becomes D, B becomes E, and so on. At the end, X becomes A, Y becomes B and Z becomes C."
- Task 1: Encrypt HELLO with a shift of 3. Answer: KHOOR.
- Task 2: Decrypt FRPSXWHU (shift of 3). Answer: COMPUTER.
- Discussion question: "Why would a Caesar cipher be easy for a computer to crack?" A good answer: there are only 25 useful shifts, so a computer can try them all almost instantly.
Cover work checklist
Run through this before you leave any Computing cover:
- [ ] Needs no computers, slides, logins or internet
- [ ] One-hour structure: settle, read-through, main task, challenge, wrap-up
- [ ] Script tells the supervisor exactly what to say
- [ ] Answer key on a separate page
- [ ] Extension task for fast finishers
- [ ] Prints clearly in black and white
- [ ] Class, room, copies and collection instructions on the front
- [ ] Points to the school's own behaviour and cover policy
Build a bank before you need it
The best time to write cover work is before the day you're off sick. If you keep a folder with five or six lessons like the one above, one per topic from Step 1 and each with its own script and answer key, the cover manager can print one for any KS3 class at short notice. Topics like binary, algorithms and cryptography also fit at different points in the year, so the work is useful rather than just something to keep students busy.
Browse the Quillwork shop