Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 693 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

4 questions · 7 marks

Pick again
Print
1Multiple 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.

2Short recall2 marksUnits & Conversion Swap Remove

Data storage is measured in binary multiples.

Define the term bit.

[2 marks]
Mark scheme

Award one mark for any of the following up to a maximum of two marks:

  • A binary digit (1)
  • Has the value 0 or 1 (1)
  • The smallest unit of data storage (1)
  • A single 0 or 1 (1)

Allow binary digit/binary place value for binary digit

Allow a single binary digit for a single 0 or 1

Do not accept a group of 8 bits/half a nibble of 4 bits, which describe a byte or a nibble

Do not accept a binary number/binary on its own

Example answers and how they were marked
Full marks2/2

A binary digit that can have the value 0 or 1.

Why: A binary digit (1) and has the value 0 or 1 (1).

Some marks1/2

It is the smallest unit of data storage.

Why: Smallest unit of data storage (1), but does not state that it is a binary digit or that it has the value 0 or 1.

No marks0/2

A group of 8 bits.

Why: Describes a byte, not a bit; no creditworthy point and named in the Do not accept line.

3Explain2 marksCompression Swap Remove

A solicitor sends large documents to clients by email.

Explain one reason why the solicitor compresses the documents before sending them.

[2 marks]
Mark scheme

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

  • The file size is reduced (1) so the documents take less time to transmit/send (1)
  • The compressed files are smaller (1) so they are more likely to be within the email attachment size limit (1)
  • Less data is sent (1) so less bandwidth/data allowance is used (1)
  • Fewer packets are needed (1) so the documents are received more quickly (1)

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

Do not accept 'it saves storage space' on its own without linking to sending the documents.

Do not accept 'it makes the file smaller' as both the point and the reason.

Example answers and how they were marked
Full marks2/2

The documents take up less space so they are quicker to send by email.

Why: File size reduced (1) and linked reason that transmission is quicker (1).

Some marks1/2

It makes the documents smaller.

Why: File size reduced (1) but no linked reason about sending or transmission.

No marks0/2

It reduces the amount of storage space the documents use on the client's computer.

Why: Storage space alone is not a reason for compressing before sending, so no linked explanation point is credited.

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