Edexcel GCSE Computer Science (1CP2) Exam Questions

• 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

• 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

• 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

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.

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

• Reduces/makes the size of a file smaller (1)
• No data is lost/removed (during compression) (1)
• The original file/data can be recreated/restored exactly (1)

Allow 'the compressed file takes up less storage space' for the first mark.

The second and third bullets are two ways of making the same point: award a maximum of one mark for them, so a response that says no data is lost and that the original file can be restored, but does not say the file is smaller, scores one mark.

Do not accept descriptions of lossy compression, e.g. 'it removes data that is not needed to make the file smaller'.

Ignore reference to download/transmission times, bandwidth and streaming, as these are benefits of compression and not part of the definition.

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

• Some data is removed permanently (1) choosing detail that people are least likely to notice (1)
• Small changes in colour/shade are discarded (1) so fewer different values need to be stored (1)
• Similar pixels are stored as one value (1) so there are fewer values in the file (1)
• Fine detail is removed (1) so fewer bits are needed to store each area (1)

Do not accept answers that say repeated patterns are stored once / no data is lost.

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.

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.