Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

3 questions · 4 marks

Pick again
Print
1Multiple choice1 markCharacter Sets Swap Remove

A new character set must be able to represent 70 different characters.

Identify the minimum number of bits needed to represent each character.

[1 mark]
  • A6
  • B7
  • C8
  • D70
Mark scheme
  • B 7 (1)
  • The only correct answer is B. The correct answer is 7.
  • A is not correct because 6 bits give only 64 combinations, which is not enough for 70 characters
  • C is not correct because 7 bits already give 128 combinations, so 8 bits is not the minimum needed
  • D is not correct because 70 is the number of characters needed, not a number of bits
Example answers and how they were marked
Full marks1/1

B 7

Why: The only correct answer: 7 bits give 128 combinations, enough for 70 characters, and it is the smallest number of bits that does (1).

No marks0/1

C 8

Why: Distractor, no credit: a single-tick item has no partial credit, and 8 bits is not the minimum because 7 bits already give 128 combinations, so the scheme's C line gives no mark.

No marks0/1

A 6

Why: Misconception, no credit: 6 bits give only 64 combinations, which cannot represent 70 different characters, so the scheme's A line gives no mark.

2Short 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

3Explain2 marksImages Swap Remove

A bitmap image uses a colour depth of 8 bits. Each pixel is stored as a binary value.

Explain how the colour of a pixel is represented in a bitmap image.

[2 marks]
Mark scheme

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

  • Each pixel is stored as a binary value/code (1) which represents/maps to a colour (1)
  • The binary value is used to look up a colour in a palette (1) so the pixel can be displayed in that colour (1)
  • A bit pattern is assigned to each colour (1) and each pixel stores the bit pattern for its colour (1)
  • The number of bits per pixel sets how many different colour codes exist (1) so each code can represent a different colour (1)

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

Do not accept 'pixels are binary' or 'the image is made of 1s and 0s' without saying a pixel's colour is represented by a binary value.

Do not accept RGB values stored as denary or hexadecimal.

Example answers and how they were marked
Full marks2/2

Each pixel stores a binary value; this value is used to look up the pixel's colour in a palette.

Why: Linked point (1) and reason (1): a binary value is stored for each pixel and maps to a colour.

Some marks1/2

A bit pattern is assigned to each colour.

Why: One mark for stating that colours have bit patterns; it does not say that each pixel stores the pattern for its colour.

No marks0/2

Each pixel stores the RGB colour as denary numbers between 0 and 255.

Why: Bitmap pixels are stored in binary, not as denary values; this common misconception earns no mark.

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.