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

Pick again
Print
1Multiple choice1 markUnits & Conversion Swap Remove

Units of data storage can be binary or decimal.

Identify the unit of storage that is equivalent to 1024 gibibytes.

[1 mark]
  • AGibibyte
  • BMebibyte
  • CTebibyte
  • DTerabyte
Mark scheme
  • C Tebibyte (1)
  • The only correct answer is C. The correct answer is tebibyte.
  • A is not correct because a gibibyte is 1024 mebibytes
  • B is not correct because a mebibyte is 1024 kibibytes
  • D is not correct because a terabyte is 1000 gigabytes
Example answers and how they were marked
Full marks1/1

C Tebibyte

Why: Correct: 1024 gibibytes make one tebibyte (1).

No marks0/1

A Gibibyte

Why: Near miss: a gibibyte is 1024 mebibytes, not 1024 gibibytes (0).

No marks0/1

D Terabyte

Why: Typical misconception: uses the decimal terabyte (1000 gigabytes) instead of the binary tebibyte (0).

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

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

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.

7Discuss6 marksCompression Swap Remove

A company runs a website advertising holiday cottages. Each page shows photographs of a cottage and has a short audio guide that visitors can play. The company uses lossy compression for the photographs and the audio.

Discuss the use of lossy compression on the company's website.

Your answer should include:

  • how lossy compression makes the files smaller
  • the effect this has on the photographs and audio
  • the benefits to the company and its visitors
[6 marks]
Mark scheme

Indicative content

How lossy compression makes the files smaller

  • Some of the data in the file is permanently removed, so the file that is stored is smaller.
  • The data that is removed is the data that a person is least likely to notice, such as sounds outside the range of human hearing or small differences in colour in a photograph.
  • Removing data means a much higher compression ratio is possible than with lossless compression.

The effect on the photographs and audio

  • The original file cannot be reproduced exactly when it is decompressed.
  • Photographs may show artefacts, such as blocks or noise where there are contrasting colours, so they are lower quality.
  • Some of the sound is lost, so parts of the audio guide may be less clear to listen to.
  • If the company later wants to use the photographs at a larger size, it cannot recover the lost detail.

The benefits to the company and its visitors

  • The smaller images load faster, so each page of the website appears more quickly for a visitor.
  • The audio can be streamed, so a visitor can play the guide without waiting for the whole file to download.
  • Less bandwidth is used by the web server, so it can cope with more visitors at the same time.
  • Less storage space is needed on the server for the photographs and audio files.

Levels

  • Level 0 (0 marks): No rewardable content.
  • Level 1 (1–2 marks): Basic, independent points are made, showing elements of understanding of key concepts/principles of computer science. (AO1) The discussion will contain basic information with little linkage between points made or application to the context. (AO2)
  • Level 2 (3–4 marks): Demonstrates adequate understanding of key concepts/principles of computer science. (AO1) The discussion shows some linkages and lines of reasoning with some structure and application to the context. (AO2)
  • Level 3 (5–6 marks): Demonstrates comprehensive understanding of key concepts/principles of computer science to support the discussion being presented. (AO1) The discussion is well developed, with sustained lines of reasoning that are coherent and logically structured, and which clearly apply to the context. (AO2)

Level 3 responses must cover both the effect on the files and the benefits.

Do not accept the idea that lossy compression keeps all of the original data.

Example answers and how they were marked
Full marks6/6

Lossy compression permanently removes some of the data, for example the parts of the sound that the human ear cannot hear, or small differences in colour in a photograph, so the file that is stored is much smaller than it would be with lossless compression. This means the original cannot be recreated exactly: parts of a photograph with contrasting colours may show blocks or noise, and parts of the audio guide may be less clear. However, the smaller images mean each page loads faster for a visitor, and the audio can be streamed so a visitor can play the guide without waiting for the whole file. Less bandwidth is used too, so the server can cope with more visitors at once.

Why: Explains how data is removed and its effect on the photographs and audio, then links the benefits to visitors and to the server, so Level 3.

Some marks3/6

Lossy compression makes the files smaller by removing some of the data. This means the photographs might not look as good as the original. The website pages will load faster for visitors because the files are smaller.

Why: Correct basic points about the method, the effect and a benefit (AO1/AO2), but the points are not developed and the audio is not considered, so Level 2.

Some marks1/6

Lossy compression does not lose any data, so the photographs can be decompressed back to the original picture. The web pages will load faster because the photographs are smaller.

Why: One basic point about faster loading; the description of lossy compression is the wrong way round because data is permanently removed, so Level 1.

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.