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

5 questions · 7 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 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 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).

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.

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

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.