Compression, encryption and hashing: OCR A‑Level Computer Science questions
Every OCR A-Level Computer Science exam question on 1.3.1 Compression, encryption and hashing, 2021–2025, with its mark scheme and examiner’s report.
Find questions593
Calculations
Q7(b)
The whole paper ↗
Q3(c)
The whole paper ↗
Q4(c)
The whole paper ↗
Q2(f)
The whole paper ↗
All 4 questions on Compression, encryption and hashing, as a list
- June 2025, Paper 1, Q7(b) (4 marks): OCR Photo uses run length encoding to compress the generated photographs. A black and white photograph is encoded using B for the colour black and W for the col
- June 2024, Paper 1, Q3(c) (3 marks): The thin client computer needs to send data that is input by the user to the server so that the virtual machine can process it. For example, it will send text e
- June 2023, Paper 1, Q4(c) (9 marks): A team of programmers create a robot that will be used in a factory. The robot will be able to do the work of multiple humans. The programmers discuss whether t
- June 2022, Paper 1, Q2(f) (5 marks): All videos that are streamed are compressed. Customers have the option to choose from watching the videos with lossy compression or lossless compression. Explai
Questions, mark schemes and examiner’s reports are © OCR, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Full past papers.
Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.