Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 604 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

10 questions · 25 marks

Pick again
Print
1Multiple choice1 markImages Swap Remove

Identify the smallest identifiable area of a bitmap image.

[1 mark]
  • AColour depth
  • BFile size
  • CPixel
  • DResolution
Mark scheme
  • C Pixel (1)
  • The only correct answer is C. The correct answer is pixel.
  • A is not correct because colour depth is the number of bits used to store the colour of each pixel
  • B is not correct because file size is the amount of storage an image takes up, not an area of the image
  • D is not correct because resolution is a measure of the number of pixels in an image (such as its width × height), not the smallest identifiable area
Example answers and how they were marked
Full marks1/1

C Pixel

Why: Correct option; a pixel is the smallest identifiable area of a bitmap image (1).

No marks0/1

D Resolution

Why: Resolution is a measure of the number of pixels in an image, not the smallest identifiable area; no mark.

No marks0/1

A Colour depth

Why: Colour depth is the number of bits used to store each pixel's colour, not the smallest identifiable area; no mark.

2Multiple choice1 markImages Swap Remove

Two images are displayed at the same physical size. Image A has a higher resolution than image B.

Identify what this means.

[1 mark]
  • AImage A has more bits per pixel
  • BImage A has more colours
  • CImage A has more pixels per inch
  • DImage A uses less storage
Mark scheme
  • C Image A has more pixels per inch (1)
  • The only correct answer is C. The correct answer is more pixels per inch.
  • A is not correct because bits per pixel is the colour depth
  • B is not correct because more colours is caused by a higher colour depth, not a higher resolution
  • D is not correct because a higher resolution usually needs more storage, not less
Example answers and how they were marked
Full marks1/1

C Image A has more pixels per inch

Why: Correct option; resolution is the concentration of pixels, such as pixels per inch (1).

No marks0/1

B Image A has more colours

Why: More colours is an effect of colour depth, not resolution; no mark.

No marks0/1

A Image A has more bits per pixel

Why: Bits per pixel is the colour depth, not the resolution; no mark.

3Short recall1 markCharacter Sets Swap Remove

ASCII uses 7 bits to store each character. A system has only 6 bits available to store each character.

State the number of different characters the system can represent.

[1 mark]
Mark scheme

Award one mark for:

  • 64 (1)
  • 2^6 (1)
  • 2 × 2 × 2 × 2 × 2 × 2 (1)

Allow 64 characters / sixty-four.

Allow 2 to the power of 6 for 2^6.

Do not accept 128, which is the number of characters that can be represented using 7 bits.

Do not accept 63, the largest value that can be represented using 6 bits, rather than the number of different characters.

Do not accept 12 (2 × 6), ie the number of bits multiplied by 2.

Example answers and how they were marked
Full marks1/1

64

Why: Correct: 2^6 = 64 different characters (1).

No marks0/1

128

Why: Scores 0: 128 is the number of characters that 7 bits can represent, not the 6 bits the system has; the Do not accept line applies.

No marks0/1

63

Why: Scores 0: 63 is the largest value 6 bits can hold, not the number of different characters; the Do not accept line applies.

4Short recall2 marksImages Swap Remove

Bitmap images are stored as a grid of pixels.

Define the term pixel.

[2 marks]
Mark scheme

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

  • The smallest element/area of a bitmap image (1)
  • The smallest identifiable part of an image (1)
  • Stores/represents a single colour as a binary value (1)
  • Stores/represents a single colour using a number of bits/colour depth (1)

Allow 'picture element' for element/part in the first two bullets, but not on its own

Allow 'bit depth' for colour depth

Do not accept 'picture element'/'pixel' on its own

Do not accept 'a group of pixels' or 'a dot' on its own; allow 'dot' only when it is described as the smallest element/area of the image

Do not accept 'single colour' on its own for the second mark; it must be linked to a binary value/number of bits

Do not accept 'lots of coloured dots' (it contradicts a single colour)

Example answers and how they were marked
Full marks2/2

The smallest identifiable area of a bitmap image, which has one colour stored as a binary value.

Why: Smallest identifiable area (1) and single colour stored as a binary value (1)

Some marks1/2

The smallest part of a bitmap image, made of one colour.

Why: Smallest part (1); no credit for the second mark because the single colour is not linked to a binary value or number of bits

No marks0/2

A picture element made from lots of coloured dots.

Why: 'Picture element' on its own is not accepted and 'lots of coloured dots' contradicts a single colour

5Describe2 marksCharacter Sets Swap Remove

A computer uses 7-bit ASCII to store text.

Describe why 7 bits are needed to represent each character, rather than 6 bits.

[2 marks]
Mark scheme

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

  • 6 bits give only 64 different codes (1) which is fewer than the number of letters, digits and symbols that must be represented (1)
  • 7 bits give 128 different codes (1) which is enough to represent every letter, digit and symbol that is needed (1)
  • Adding a bit doubles the number of different codes from 64 to 128 (1) so that every character needed can have its own code (1)
  • There are more than 64 characters that must be represented (letters, digits and symbols) (1) so 6 bits cannot give each one a different code (1)

A statement of the number of codes without a development can earn one mark only; the development must be linked to the statement for the second mark.

Do not accept responses that only say computers use binary (1s and 0s).

Do not accept that 7 bits are needed because 7 is a bigger number than 6, with no reference to the number of codes or characters.

Do not accept responses about 8 bits, extended ASCII or Unicode.

Example answers and how they were marked
Full marks2/2

6 bits can only give 64 different codes, which is not enough for all the letters, digits and symbols that have to be represented.

Why: Gives the number of codes 6 bits can make (1) linked to the number of characters that must be represented (1).

Some marks1/2

7 bits give 128 different codes.

Why: States the number of codes available from 7 bits (1) but gives no linked development, so the second mark is not earned (0).

No marks0/2

Because computers only use binary and 7 is a bigger number than 6.

Why: Says only that computers use binary and compares the numbers, which the mark scheme tells markers not to accept; no creditworthy point about codes or characters.

6Describe2 marksCharacter Sets Swap Remove

Uppercase letters are represented in a computer using 7-bit ASCII codes.

Describe how the ASCII codes for the uppercase letters A to Z are arranged.

[2 marks]
Mark scheme

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

  • The codes run in alphabetical order/consecutively (1) so each letter has a code one more than the letter before it (1)
  • A has the code 65 and Z has the code 90 (1) so the codes for the letters in between increase by 1 each time (1)
  • The letters are stored in sequence (1) so B is A + 1, C is B + 1 and so on (1)

Accept the codes given in denary (65, 90) or as 7-bit binary (1000001, 1011010).

Do not accept 'the codes go up' or 'the codes are in order' on its own, as neither gives the step of 1 or links one letter to the next.

Do not accept 'each uppercase letter has a different code' on its own, as this does not describe the arrangement.

Example answers and how they were marked
Full marks2/2

The codes are in alphabetical order, so B is one more than A and C is one more than B.

Why: Codes are consecutive/in order (1) with the linked step of one more for each letter (1).

Some marks1/2

A is 65 and Z is 90.

Why: Gives the first half of the linked pair, the start and end codes (1), but does not give the linked development, the increase of 1 between letters (0).

No marks0/2

The ASCII codes for uppercase letters go up.

Why: 'Codes go up' on its own gives no step of 1 and no link to the next letter, so it is not creditworthy (0) under the 'Do not accept' line.

7Describe2 marksSound Swap Remove

A computer stores a digitised sound.

Describe how the sample rate affects the accuracy of the binary representation of a sound.

[2 marks]
Mark scheme

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

  • A higher sample rate means more samples are taken each second (1) so more binary values are stored to represent the sound (1)
  • A higher sample rate records the wave more frequently (1) so the binary representation follows the shape of the analogue wave more closely/is more accurate (1)
  • A lower sample rate records fewer samples (1) so the binary representation is less detailed/less accurate (1)

A statement about the effect of sample rate on sampling (e.g. more/fewer samples) without a link to the binary representation scores a maximum of one mark.

A definition of sample rate on its own, with no effect on sampling, scores no marks.

Accept 'more accurate' for the second mark only when linked to more samples or binary values being stored, for example by 'so', 'which means' or 'because'.

Do not accept responses that describe sample interval or bit depth instead of sample rate.

Do not accept 'a higher sample rate means more bits per sample' or 'higher resolution', as these describe bit depth.

Do not accept a larger file size unless it is linked to more samples/binary values being stored.

For both marks, the expansion must follow/associate with the statement.

Example answers and how they were marked
Full marks2/2

A higher sample rate takes more samples each second, so more binary values are stored and the digital representation is more accurate.

Why: Linked points: more samples each second (1) leading to more binary values and a more accurate representation (1).

Some marks1/2

A higher sample rate records the wave more often.

Why: Correct statement about the effect on sampling (1) but no link to the binary representation.

No marks0/2

A higher sample rate uses more bits for each sample, so each sample is more accurate.

Why: Confuses sample rate with bit depth; 'more bits per sample' is not accepted.

8Explain2 marksImages Swap Remove

Two versions of the same bitmap image are saved. The second version has a higher colour depth.

Explain why the second version may have a larger file size.

[2 marks]
Mark scheme

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

  • More binary data is stored for each pixel (1) because a higher colour depth uses more bits per pixel (1)
  • Each pixel has a longer binary code (1) so more storage is needed to hold the image (1)
  • More colours can be represented (1) so more bits are needed for each pixel (1)
  • The file contains more bits in total (1) because colour depth is the number of bits per pixel (1)

For both marks, the expansion must follow/associate with the statement.

Allow 'more bits per pixel' for one mark.

Do not accept 'more pixels' or 'higher resolution' as the reason, because changing colour depth does not change the number of pixels.

Example answers and how they were marked
Full marks2/2

The second version stores more binary data for each pixel (1) because a higher colour depth uses more bits per pixel (1).

Why: Linked point (1) and reason (1): more data per pixel because more bits per pixel.

Some marks1/2

The second version uses more bits for each pixel.

Why: One mark for identifying that more bits are stored per pixel; no linked statement about more data or file size.

No marks0/2

The second version has more pixels, so there is more data to store.

Why: A common misconception; colour depth does not change the number of pixels, so no creditworthy point is given.

9Discuss6 marksImages Swap Remove

A handheld games console displays sprites. The console stores each pixel of a sprite using 4 bits. Designers want sprites that contain many shades of green and blue.

Discuss the limitations of using 4 bits to store each pixel of a sprite on the console.

Your answer should include:

  • the number of colours that can be represented
  • the effect on the appearance of the sprite
  • how the limitation could be managed.
[6 marks]
Mark scheme

Indicative content

Number of colours

  • 4 bits give 2^4 = 16 different binary values, so at most 16 colours can be stored for each pixel.
  • The console cannot store every shade that the designers want; colours outside the 16 must be approximated or left out.
  • Adding more bits per pixel would allow more colours, but this may not be possible on the console's hardware.

Effect on appearance

  • The sprite may show banding where a smooth change from green to blue should be.
  • A sprite that needs many shades, such as a detailed landscape, will look unrealistic or have blocks of colour.
  • Simple sprites with flat colours, such as a retro character, can still look acceptable.
  • The limitation is in the number of colours, not the number of pixels; resolution is a separate issue.

Managing the limitation

  • Designers can choose a palette of 16 colours that includes the most important greens and blues for the game.
  • They can design sprites with flat colours rather than smooth gradients.
  • They can use more bits per pixel for important sprites if the console allows it.
  • They can accept that some shades will be approximated and check that the sprite still looks clear on the console's screen.

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 the number of colours and the effect on appearance.

Do not accept 4 bits give 4 colours or 8 colours.

Example answers and how they were marked
Full marks6/6

4 bits per pixel gives 2^4 = 16 different binary values, so each pixel can be only one of 16 colours. The designers want many shades of green and blue, but most of these cannot be stored exactly and must be approximated or left out. This can cause banding where a smooth change from green to blue should be, so a detailed sprite may look unrealistic. A simple sprite with flat colours could still look acceptable. The designers could choose a palette of 16 colours that includes the most important greens and blues, and design sprites with flat colours instead of gradients. Using more bits per pixel would allow more colours, but the console's hardware may not support this.

Why: Explains 2^4 = 16 colours and the limitation on shades, links this to banding and realism, and gives suitable ways to manage it in the console context. Sustained reasoning, so Level 3.

Some marks4/6

4 bits can store 16 colours. This means the sprite cannot have many colours. It might look bad if it needs lots of shades of green and blue. The designers could use fewer colours in the sprite.

Why: Correctly gives 16 colours and makes a simple link to the sprite's appearance and a way to manage it. There is little development of the effect or the management, so Level 2.

Some marks1/6

4 bits can store 16 colours. This means the sprite will have a low resolution, so it will look blocky. The designers should use a higher resolution to get more shades of green and blue.

Why: One correct point: 4 bits give 16 colours. The answer then confuses colour depth with resolution; increasing resolution would not provide more shades.

10Discuss6 marksSound Swap Remove

A toy company is designing an electronic keyboard. The keyboard can store and play back short recorded sounds. The memory chip in the keyboard has very little space, so each sample is stored using only 3 bits.

Discuss the limitations of storing the recorded sounds using only 3 bits per sample.

Your answer should include:

  • the range and number of amplitude values that can be stored
  • the accuracy of each sample that is stored
  • how the limitation could affect what the user hears.
[6 marks]
Mark scheme

Indicative content

Range and number of values

  • With a bit depth of 3, the keyboard can store only 2^3 = 8 different amplitude values.
  • The 3-bit codes run from 000 to 111, so the loudest and quietest amplitudes the keyboard can record are fixed by those codes.
  • Because only eight levels of loudness are available, the keyboard cannot store the full variation in amplitude of the original recording.
  • Any sound in between two of the eight values cannot be stored at all, so much of the detail of the original sound has no code to represent it.

Accuracy of the stored sample

  • Each true amplitude must be rounded to the nearest of the eight available values, so the stored sample is not the same as the amplitude that was measured.
  • The difference between the true amplitude and the rounded value is the quantisation error, which makes every stored sample less accurate.
  • The eight values are far apart, so there is a large step between one stored amplitude and the next and the stored sound rises and falls in big jumps rather than following the original wave.
  • A quiet sound whose amplitude is smaller than one step may be stored with the same code as silence, so that part of the recording is lost.

Effect on the user

  • When the keyboard plays back the recording, the large steps between stored amplitudes are heard as distortion or noise rather than a smooth copy of the original sound.
  • Quiet parts of the recording may not be heard at all, because they are stored as the same value as silence.
  • The reproduced sound may not be recognisable as the instrument or voice that was recorded.

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 explain that 3 bits gives only 8 amplitude values and link the large steps between those values to the distortion or the loss of quiet sounds that the user hears; an explicit binary range of 000 to 111 is not required for Level 3.

Level 2 requires one point to be developed with a reason, e.g. eight values means each amplitude is rounded to the nearest and the quantisation error is large enough to be heard; stating 8 values, reduced accuracy and distortion as separate basic points without a reason is Level 1. Do not accept bit depth described as the number of samples taken per second, or a bare statement that the quality is worse with no explanation.

Example answers and how they were marked
Full marks6/6

With only 3 bits per sample, the keyboard can store just 2^3 = 8 different amplitude values. Each recorded amplitude has to be rounded to the nearest of these eight values, so the stored sample is not the same as the original and a quantisation error is created. The eight values are far apart, so the stored sound moves in large steps instead of following the original wave. A quiet sound smaller than one step is stored as the same code as silence, so it is lost. When the keyboard plays the recording back, the user hears these large steps as distortion and noise, and quiet parts of the music may not be heard at all, so the sound is not a faithful copy of the original.

Why: Level 3 (6 marks): explains the 8 values from 3 bits, rounding creating quantisation error, the large steps between values, lost quiet sounds and the distortion the user hears, all applied to the keyboard.

Some marks2/6

With 3 bits, there are only 8 values that can be stored, so the amplitude is rounded to the nearest value. This makes the sound less accurate than the original recording. The user might hear distortion when the keyboard plays it back.

Why: Level 1 (2 marks): gives basic points (8 values, rounding to the nearest value, less accurate, possible distortion) but states them separately, without explaining why the eight far-apart values cause a large quantisation error or why that is heard as distortion, so it does not reach Level 2.

No marks0/6

3 bits means 3 samples per second, so the keyboard cannot store much sound. The quality will be low.

Why: Level 0 (0 marks): confuses bit depth with sample rate ('3 samples per second'), which the scheme says not to accept, and 'the quality will be low' is a bare statement with no explanation, so there is no creditworthy point.

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.