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

7 questions · 11 marks

Pick again
Print
1Multiple choice1 markCompression Swap Remove

A student downloads a compressed music file and then decompresses it.

Identify what is meant by decompression.

[1 mark]
  • AData is encrypted so that it cannot be read
  • BData is permanently removed to reduce the file size
  • CData is restored to its original format
  • DData is stored using fewer bits
Mark scheme
  • C Data is restored to its original format (1)
  • The only correct answer is C. The correct answer is data is restored to its original format.
  • A is not correct because encryption changes data so that it cannot be read without a key; it does not restore the data
  • B is not correct because permanently removing data to reduce the file size is lossy compression, not decompression
  • D is not correct because storing data using fewer bits is compression, not decompression
Example answers and how they were marked
Full marks1/1

C Data is restored to its original format

Why: Correct option (1).

No marks0/1

D Data is stored using fewer bits

Why: Near miss: this describes compression, not decompression.

No marks0/1

B Data is permanently removed to reduce the file size

Why: Misconception: this describes lossy compression, not decompression.

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

3Short recall1 markUnits & Conversion Swap Remove

A file has a size of 2 kibibytes.

State the number of bytes in the file.

[1 mark]
Mark scheme

Award one mark for:

  • 2048 (1)
  • 2 × 1024 (1)
  • 2^11 (1)

Allow 2048 bytes.

Do not accept 2000, which is the number of bytes in two decimal kilobytes.

Do not accept 1024, which is the number of bytes in one kibibyte.

Do not accept 16, which is the number of bits in two bytes.

Example answers and how they were marked
Full marks1/1

2048

Why: 2048 is 2 × 1024, the number of bytes in 2 kibibytes (1).

No marks0/1

2000

Why: 2000 uses the decimal kilobyte, not the binary kibibyte; the mark scheme does not accept it.

No marks0/1

16

Why: 16 is the number of bits in two bytes, confusing bits with bytes; the mark scheme does not accept it.

4Short recall2 marksUnits & Conversion Swap Remove

A solid state drive has a capacity of 5 gibibytes.

Give an expression to calculate the number of bits in 5 gibibytes. You do not need to do the calculation.

[2 marks]
Mark scheme

Award one mark for each of:

  • 5 × 1024^3 / 5 × 1024 × 1024 × 1024 / 5 × 2^30, for the number of bytes (1)
  • A fully correct expression with × 8 to convert bytes to bits, in any order, e.g. 5 × 1024^3 × 8, 8 × 5 × 2^30 (1)

Accept 5 × 1 073 741 824 × 8.

Accept 5 × 2^33 or 42 949 672 960 as a fully correct expression (2 marks).

Do not accept 5 × 1000^3 × 8, which uses decimal multiples.

Do not accept ÷ 8, which converts bits to bytes.

Example answers and how they were marked
Full marks2/2

8 × 5 × 2^30

Why: 5 × 2^30 is the number of bytes (1) and × 8 converts bytes to bits (1).

Some marks1/2

5 × 2^30

Why: Correct number of bytes using the binary multiple 2^30 (1), but no conversion to bits.

No marks0/2

5 × 1000^3 × 8

Why: Uses decimal 1000^3 instead of binary 1024^3, so the expression is not fully correct; no creditworthy point.

5Describe2 marksCompression Swap Remove

A video streaming service stores many hours of video.

Describe one reason why the streaming service compresses its video files.

[2 marks]
Mark scheme

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

  • Makes each file smaller (1) so less secondary storage is needed for the videos (1)
  • Uses less bandwidth (1) so the video streams without buffering (1)
  • Reduces the amount of data sent (1) so users use less of their data allowance (1)
  • Can be streamed (1) because the data can be sent as fast as the user watches it (1)

Award one mark for a valid point on its own; the second mark is only awarded when the development is linked to that point.

Do not award a second mark for a development that repeats the point made.

Allow "takes less time to transmit/upload/download" as the development for a smaller file.

Do not accept responses that say compression saves memory/RAM (the videos are stored in secondary storage).

Do not accept compression makes the video more secure or improves its quality.

Example answers and how they were marked
Full marks2/2

It makes each video file smaller (1) so the service needs less storage space for its library (1).

Why: Linked point: smaller file (1) and linked development: less storage needed (1).

Some marks1/2

It reduces the size of the video files.

Why: States that files are made smaller (1); no linked development is given, so the second mark is not awarded (0).

No marks0/2

It encrypts the video so it is safer to send.

Why: Gives security, which the mark scheme does not accept, not a reason for compression; no creditworthy point.

6Explain2 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.

7Explain2 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.