Edexcel GCSE Computer Science (1CP2) Exam Questions

• B To reduce the time taken to transmit a file (1)
• The only correct answer is B. The correct answer is to reduce the time taken to transmit a file.
• A is not correct because compression reduces file size, which can reduce the number of packets sent
• C is not correct because lossy compression can reduce the quality of a file
• D is not correct because encryption, not compression, can make a file harder to open

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

• 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 explanation such as:

• The capacity is easier to read/write (1) because a tebibyte is 1024^4 bytes so the same capacity in bytes would have many more digits (1)
• The number is shorter (1) because writing 16 TiB instead of 17 592 186 044 416 bytes uses far fewer digits (1)
• There is less chance of making a mistake when copying the value (1) because a long byte count of many digits is easy to mistype (1)

For both marks, the expansion must follow/associate with the statement and must refer to the number of digits/length of the value.

Allow 'fewer digits'/'shorter number'/'less chance of error' on its own for the first mark; the second mark needs the linked reason that a tebibyte is 1024^4 bytes, so the value in bytes would be very long/have many more digits.

Do not accept 'it is bigger'/'tebibytes are larger' on its own, as this does not give a benefit of using them.

Do not accept 'easier' on its own without saying what is easier, e.g. fewer digits/shorter number.

Do not accept 'because tebibytes are used for large storage' without a reason about the number of digits/readability.

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.

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.