Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

4 questions · 5 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.

2Short recall1 markImages Swap Remove

A bitmap image has a resolution.

State what is meant by the resolution of an image.

[1 mark]
Mark scheme

Award one mark for any of the following:

  • The concentration/density of pixels in an area (1)
  • The number of pixels per inch (PPI) / pixels per unit area (1)
  • The width and height/dimensions of the image in pixels (1)

Do not accept the number of pixels in the image on its own, without dimensions or an area, e.g. 'the total number of pixels'

Do not accept colour depth / the number of bits used per pixel / the number of colours

Do not accept file size in bytes / the amount of storage the image uses / screen size / image quality

Example answers and how they were marked
Full marks1/1

The concentration of pixels in an area, such as the number of pixels per inch.

Why: Gives the density/concentration of pixels in an area, and pixels per inch (1)

No marks0/1

The number of pixels in the image.

Why: A bare total pixel count is not accepted without dimensions or an area

No marks0/1

The number of bits used to store each pixel's colour.

Why: Describes colour depth, not resolution, and colour depth is not accepted

3Short recall1 markImages Swap Remove

A bitmap image uses one bit per pixel.

State the limitation this places on the number of colours in the image.

[1 mark]
Mark scheme

Award one mark for any of the following:

  • Only two different colours can be represented/stored (1)
  • Each pixel can only be one of two values (1)
  • The image can only be shown in black and white (1)

Allow answers that give the number of colours, e.g. two colours, 2 colours

Allow any pair of two colours, e.g. black and white, black and grey

Do not accept low resolution/poor quality/lower quality

Do not accept only one colour/can only show black

Do not accept 2 bits/2^1 without a statement about the number of colours that can be represented

Example answers and how they were marked
Full marks1/1

Only two colours can be represented, such as black and white.

Why: States that only two different colours can be represented (1)

No marks0/1

The image will have a low resolution.

Why: Confuses colour depth with resolution; low resolution is not accepted

No marks0/1

The image can only show black.

Why: One colour is all a single value can give; the limitation is that only two colours can be represented, so this is not accepted

4Explain2 marksCharacter Sets Swap Remove

A computer system uses a 4-bit code to represent the characters typed on its keyboard.

Explain one limitation of using 4 bits to represent characters.

[2 marks]
Mark scheme

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

  • Only 16 different characters can be represented (1) so there are not enough characters codes for every letter of the alphabet (1)
  • 4 bits give only 16 different combinations (1) which is not enough for the uppercase letters, lowercase letters, digits and symbols on a keyboard (1)
  • More than 16 characters are needed on a keyboard (1) so some letters, digits or symbols cannot be represented (1)
  • The number of character codes available is limited to 16 (1) because 4 bits give 2 to the power of 4 combinations (1)

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

Calculating that 4 bits give 2 to the power of 4 = 16 combinations can earn either the point or the linked reason, provided the other half of the answer says what this means (too few characters/codes).

Allow an expansion that names only the letters of the alphabet, e.g. there are not enough character codes for the 26 letters (1).

Do not accept '4 bits can only store 4 characters' (the number of bits is not the number of characters).

Do not accept 'it can only store 16 bits' (16 is the number of character codes/combinations, not the number of bits).

Do not accept 'not enough memory/storage' (the limitation is the number of character codes, not the amount of storage).

Do not accept 'it is limited/smaller' without saying how many characters/codes are available or what cannot be represented.

Example answers and how they were marked
Full marks2/2

Only 16 different characters can be represented, so there are not enough character codes for all 26 letters.

Why: Gives the point that only 16 characters can be represented (1) and links it to the reason that this is fewer than the letters needed (1).

Some marks1/2

Only 16 different characters can be represented.

Why: Gives the point that only 16 characters can be represented (1) but does not explain what cannot be represented.

No marks0/2

It can only store 4 characters because there are 4 bits.

Why: Misconception that the number of bits equals the number of characters, which the mark scheme says not to accept; 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.