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

6 questions · 8 marks

Pick again
Print
1Multiple choice1 markCompression Swap Remove

Identify one reason for using data compression.

[1 mark]
  • ATo increase the number of packets sent
  • BTo reduce the time taken to transmit a file
  • CTo improve the quality of the file
  • DTo make the file harder to open
Mark scheme
  • B To reduce the time taken to transmit a file (1)
  • The only correct answer is B. The correct answer is to reduce the time taken to transmit a file.
  • A is not correct because compression reduces file size, which can reduce the number of packets sent
  • C is not correct because lossy compression can reduce the quality of a file
  • D is not correct because encryption, not compression, can make a file harder to open
Example answers and how they were marked
Full marks1/1

B To reduce the time taken to transmit a file

Why: Correct option (1).

No marks0/1

A To increase the number of packets sent

Why: Near miss: compression reduces the number of packets sent, so no mark.

No marks0/1

C To improve the quality of the file

Why: Misconception that compression improves quality; no mark.

2Multiple choice1 markCompression Swap Remove

Identify the definition of lossy compression.

[1 mark]
  • AData is removed only while the file is being transmitted
  • BData is permanently removed to reduce the file size
  • CData is restored exactly when it is decompressed
  • DData is stored using a dictionary of repeated patterns
Mark scheme
  • B Data is permanently removed to reduce the file size (1)
  • The only correct answer is B. The correct answer is data is permanently removed to reduce the file size.
  • A is not correct because the data removed by a lossy algorithm is not restored after transmission
  • C is not correct because that describes lossless compression, where the original file is rebuilt exactly
  • D is not correct because dictionary encoding is a lossless method that records repeated patterns once
Example answers and how they were marked
Full marks1/1

B Data is permanently removed to reduce the file size

Why: Correct option (1).

No marks0/1

C Data is restored exactly when it is decompressed

Why: Near miss: this describes lossless compression, so no mark.

No marks0/1

A Data is removed only while the file is being transmitted

Why: Misconception that compression only applies during transmission; the data is removed permanently, so no mark.

3Multiple 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.

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

5Describe2 marksCompression Swap Remove

Data can be compressed using lossy or lossless compression.

Describe one difference between lossy compression and lossless compression.

[2 marks]
Mark scheme

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

  • Lossy compression permanently removes/discards some of the data (1) whereas lossless compression keeps all of the original data so the file can be restored/rebuilt exactly (1)
  • Lossy compression cannot reproduce/recreate the original file exactly (1) whereas lossless compression can decompress the file back to its original form (1)
  • Lossy compression can make a file smaller than lossless compression (1) because more of the original data is removed/discarded (1)
  • Lossy compression is used for images/sound/video (1) whereas lossless compression is used where all the original data must be kept, such as program files (1)

Allow one mark for a correct statement about one type of compression only, e.g. 'lossy compression permanently removes some data', with no comparison or development.

Do not accept 'lossy compression loses quality' on its own unless it states that data/information is removed or lost permanently.

Do not accept 'lossy is better' or 'lossless is safer' with no described difference.

Do not award a smaller file size on its own; it must be linked to data being removed or to no data being lost.

Example answers and how they were marked
Full marks2/2

Lossy compression permanently removes some of the data, whereas lossless compression keeps all of the original data so the file can be restored exactly.

Why: Linked difference: lossy permanently removes data (1) and lossless keeps all data so the file is restored exactly (1).

Some marks1/2

Lossy compression permanently removes some of the data.

Why: A correct statement about one type only (1), with no comparison to lossless or development, so the second mark is not earned.

No marks0/2

Lossless compression removes the data that is not needed so the file is smaller, but lossy compression keeps every bit of the data.

Why: The two types are the wrong way round; no creditworthy point, so no marks.

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