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 · 4 marks

Pick again
Print
1Multiple choice1 markCompression Swap Remove

Identify the statement that describes lossless compression.

[1 mark]
  • AData is encrypted so that it cannot be read by others
  • BData is permanently removed to make the file smaller
  • CNo data is lost and the original file can be recreated
  • DThe file is split into packets that are sent separately
Mark scheme
  • C No data is lost and the original file can be recreated (1)
  • The only correct answer is C. The correct answer is no data is lost and the original file can be recreated.
  • A is not correct because encryption hides data and does not make the file smaller
  • B is not correct because permanently removing data is lossy compression
  • D is not correct because splitting a file into packets is part of transmission, not compression
Example answers and how they were marked
Full marks1/1

C No data is lost and the original file can be recreated

Why: Correct option (1).

No marks0/1

B Data is permanently removed to make the file smaller

Why: Near miss: this is lossy compression, not lossless, so no mark.

No marks0/1

D The file is split into packets that are sent separately

Why: Misconception that compression is packet switching; no mark.

2Multiple 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).

3Explain2 marksCompression Swap Remove

A text file contains the same phrase many times.

Explain how lossless compression can reduce the size of this text file.

[2 marks]
Mark scheme

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

  • The repeated phrase is stored once (1) along with a count of the number of times it occurs (1)
  • The repeated phrase is replaced by a shorter code/reference (1) and the original phrase is held in a dictionary/lookup table (1)
  • A shorter code is used in place of each repeated phrase (1) so fewer characters/bits are needed to store the file (1)
  • Groups of repeated characters are replaced by a count and a single value (1) so the file stores less data (1)

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

Allow naming of a suitable method, e.g. run-length encoding or dictionary coding, in place of a description of that method.

Award the marks once only where the same method (run-length encoding) is described more than once.

Do not accept 'it makes the file smaller' on its own without a method of compression.

Do not accept answers that describe lossy compression, e.g. that data/detail is removed or lost permanently, because lossless compression keeps all of the original data.

Do not accept 'it removes the repeated words/duplicates' on its own, as this suggests data is lost; credit only where the answer says the phrase is stored once with a count or code.

Example answers and how they were marked
Full marks2/2

The repeated phrase is stored once and a count of how many times it occurs is stored with it.

Why: Phrase stored once (1) with the linked reason that a count of the repeats is also stored (1).

Some marks1/2

It finds the repeated patterns in the text and replaces them with a shorter code.

Why: Shorter code used in place of the repeated phrase (1) but no linked reason about fewer characters/bits being stored.

No marks0/2

It permanently removes the repeated words so there is less data to store.

Why: Describes lossy compression; the Do not accept line rejects removal of data because lossless compression keeps all of the original data.

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.