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

3 questions · 3 marks

Pick again
Print
1Short recall1 markSound Swap Remove

Digital sound is made up of samples.

Define the term 'bit depth'.

[1 mark]
Mark scheme

Award one mark for:

  • The number of bits used per sample (1)

Allow bits per sample

Allow the number of bits used to record/store each sample

Do not accept the number of samples taken per second (sample rate)

Do not accept the number of bits used to store the whole sound file

Do not accept the number of levels/amplitude values a sample can take

Example answers and how they were marked
Full marks1/1

The number of bits used to record each sample.

Why: States the number of bits per sample (1).

No marks0/1

The number of samples taken each second.

Why: Defines sample rate, not bit depth; do not accept.

No marks0/1

The number of amplitude values each sample can take.

Why: Gives the number of levels/amplitude values, not the number of bits per sample; do not accept.

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

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

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.