Edexcel GCSE Computer Science (1CP2) Exam Questions

• 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

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

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.

Indicative content

Why lossless compression is suitable

• No data is removed, so the original file can be restored exactly when it is decompressed.
• Source code must be reproduced exactly, because a single missing or changed character would stop the program working when it is run.
• A text document must keep every character, so that the meaning of the document is not changed.

How lossless compression makes a file smaller

• Run length encoding stores a repeated value once, together with a count of how many times it appears, so long runs of the same character are held in less space.
• Dictionary encoding finds patterns or words that are repeated in the text, stores each one once in a dictionary and replaces every occurrence with a short code.
• The more repetition there is in a file, the greater the reduction in size that can be achieved.

Benefits to the company

• The compressed files take up less space on the file server, so more programs and documents can be stored.
• There is less data to transfer, so backing the files up to another location finishes sooner.
• The company does not need to keep a separate uncompressed copy as well, because the compressed file can be restored exactly, which saves more storage space.
• The files must be decompressed before they are used, which takes time each time a file is opened.

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 why lossless compression is suitable and how it makes a file smaller.

Do not accept the idea that lossless compression removes data that is not needed.