Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 514 exam-style questions, each with its mark scheme and example answers. Print it, or answer it on paper and then open the mark schemes. Or browse the questions by topic.

Build a paper

Topics (none ticked: all of them)
Question types (none ticked: all of them)

Practice paper

3 questions · 9 marks

Pick again
Print
1Multiple choice1 markUnits & Conversion Swap Remove

A computer stores data in binary.

Identify the number of bits in one kibibyte.

[1 mark]
  • A1024
  • B8000
  • C8192
  • D8 388 608
Mark scheme
  • C 8192 (1)
  • The only correct answer is C. The correct answer is 8192.
  • A is not correct because 1024 is the number of bytes in a kibibyte
  • B is not correct because 8000 is the number of bits in 1000 bytes
  • D is not correct because 8 388 608 is the number of bits in a mebibyte
Example answers and how they were marked
Full marks1/1

C 8192

Why: Correct: one kibibyte is 1024 bytes and 1024 × 8 = 8192 bits (1).

No marks0/1

A 1024

Why: Near miss: 1024 is the number of bytes in a kibibyte, not the number of bits (0).

No marks0/1

B 8000

Why: Typical misconception: uses 1000 bytes for a kibibyte, giving 1000 × 8 = 8000 bits (0).

2Explain2 marksCompression Swap Remove

A software company distributes its programs as compressed files.

Explain why lossless compression is used for the program files.

[2 marks]
Mark scheme

Award up to two marks for a linked explanation such as:

  • No data/instructions are removed (1) so the program still works/runs correctly after decompression (1)
  • The original file can be recreated exactly (1) so all the code/instructions are present when the program is run (1)
  • Lossy compression would permanently remove some data (1) so the program would not execute correctly/could crash (1)
  • Every instruction is needed for the program to run (1) so the code must not be changed/lost (1)

For both marks, the expansion must follow/associate with the statement.

Allow 'no data/instructions are removed/lost' on its own as the point mark (1); the second mark needs the consequence for the program, e.g. it still works/runs correctly, or all the instructions are present.

Award credit for a contrast with lossy compression only when the loss of data is linked to the program failing/not running correctly.

Do not accept 'lossless is better quality'/keeps the quality without saying that data/instructions are not lost.

Do not accept 'it makes the file smaller'/'downloads faster'/'transmits faster' as a reason for using lossless, as both types of compression reduce file size.

Example answers and how they were marked
Full marks2/2

No instructions are removed so the program still works after it has been decompressed.

Why: No data/instructions removed (1) and linked reason that the program still works correctly (1).

Some marks1/2

Lossless compression does not lose any data.

Why: Point mark for 'no data/instructions are lost' on its own (1); no consequence for the program is given, so the second mark is not awarded.

No marks0/2

Lossless compression makes the file smaller so it downloads faster.

Why: File size and download speed apply to both types of compression, so this does not explain why lossless is used for the program files.

3Discuss6 marksCompression Swap Remove

A software company stores the source code of its programs and large text documents on its file server. The company decides to use lossless compression on these files.

Discuss the use of lossless compression for the company's files.

Your answer should include:

  • why lossless compression is suitable for these files
  • how lossless compression makes a file smaller
  • the benefits to the company
[6 marks]
Mark scheme

Indicative content

Why lossless compression is suitable

  • No data is removed, so the original file can be restored exactly when it is decompressed.
  • Source code must be reproduced exactly, because a single missing or changed character would stop the program working when it is run.
  • A text document must keep every character, so that the meaning of the document is not changed.

How lossless compression makes a file smaller

  • Run length encoding stores a repeated value once, together with a count of how many times it appears, so long runs of the same character are held in less space.
  • Dictionary encoding finds patterns or words that are repeated in the text, stores each one once in a dictionary and replaces every occurrence with a short code.
  • The more repetition there is in a file, the greater the reduction in size that can be achieved.

Benefits to the company

  • The compressed files take up less space on the file server, so more programs and documents can be stored.
  • There is less data to transfer, so backing the files up to another location finishes sooner.
  • The company does not need to keep a separate uncompressed copy as well, because the compressed file can be restored exactly, which saves more storage space.
  • The files must be decompressed before they are used, which takes time each time a file is opened.

Levels

  • Level 0 (0 marks): No rewardable content.
  • Level 1 (1–2 marks): Basic, independent points are made, showing elements of understanding of key concepts/principles of computer science. (AO1) The discussion will contain basic information with little linkage between points made or application to the context. (AO2)
  • Level 2 (3–4 marks): Demonstrates adequate understanding of key concepts/principles of computer science. (AO1) The discussion shows some linkages and lines of reasoning with some structure and application to the context. (AO2)
  • Level 3 (5–6 marks): Demonstrates comprehensive understanding of key concepts/principles of computer science to support the discussion being presented. (AO1) The discussion is well developed, with sustained lines of reasoning that are coherent and logically structured, and which clearly apply to the context. (AO2)

Level 3 responses must cover both why lossless compression is suitable and how it makes a file smaller.

Do not accept the idea that lossless compression removes data that is not needed.

Example answers and how they were marked
Full marks6/6

Lossless compression is suitable because no data is removed, so the source code can be restored exactly. If even one character were lost or changed the program would not run correctly, and a text document would no longer mean the same thing. Run length encoding can store a run of the same character once with a count of how many times it appears, and dictionary encoding stores each repeated word once in a dictionary and replaces every occurrence with a short code, so a document with lots of repetition becomes much smaller. The compressed files take up less room on the file server, so more programs and documents can be stored, and there is less data to send when the company backs the files up, so the backup finishes sooner.

Why: Explains suitability with a consequence for source code, describes two lossless methods, and applies the benefits to the company's server and backups, so Level 3.

Some marks3/6

Lossless compression does not lose any data, so the file can be decompressed back to the original. This is good for source code because the code will still work. It also saves space on the file server.

Why: Correct definition applied to the code plus one benefit (AO1/AO2), but the method of compression is not described and the benefits are not developed, so Level 2.

Some marks1/6

Lossless compression removes the parts of the file that are not needed so it becomes smaller. The company should use it because the files will be smaller on the server.

Why: One basic point about the files being smaller; the explanation of lossless compression is wrong because data is not removed, so Level 1.

Questions by topic

More ways to revise Edexcel GCSE Computer Science (1CP2)

Teachers: build a paper, print it with the mark schemes at the end, and sign your school up to set your classes activities on every topic.

Fetch Decode Explain isn't affiliated with or endorsed by Pearson Edexcel.