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

4 questions · 6 marks

Pick again
Print
1Multiple choice1 markSound Swap Remove

Identify the term used for the number of bits used to record each sample of a sound.

[1 mark]
  • AAmplitude
  • BBit depth
  • CSample interval
  • DSample rate
Mark scheme
  • B Bit depth (1)
  • The only correct answer is B. The correct answer is bit depth.
  • A is not correct because amplitude is the height of the sound wave at the point it is sampled
  • C is not correct because the sample interval is the time between each sample
  • D is not correct because the sample rate is the number of samples taken each second
Example answers and how they were marked
Full marks1/1

B Bit depth

Why: Selects the only correct option (1).

No marks0/1

D Sample rate

Why: Near miss: this is the number of samples taken each second, not the number of bits per sample (0).

No marks0/1

A Amplitude

Why: Typical confusion: amplitude is what is measured at a sample, not the number of bits used to store it (0).

2Short recall1 markSecondary Memory Swap Remove

Data is stored on optical discs as pits and lands.

Name the component in an optical disc drive that reads this data.

[1 mark]
Mark scheme

Award one mark for:

  • Laser (1)

Allow laser beam

Do not accept read/write head

Do not accept pits

Do not accept lands

Do not accept reflective surface

Do not accept magnet/magnetic

Example answers and how they were marked
Full marks1/1

Laser

Why: Laser is the creditworthy answer (1).

No marks0/1

A read/write head

Why: Read/write head is not accepted by the mark scheme; it reads magnetic media, not optical discs, so no marks are awarded.

No marks0/1

Pits and lands

Why: Pits and lands are what the laser reads, not the component that reads the data, so the mark scheme does not accept them.

3Short recall2 marksCompression Swap Remove

Files can be compressed before they are stored.

Define the term lossless compression.

[2 marks]
Mark scheme

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

  • Reduces/makes the size of a file smaller (1)
  • No data is lost/removed (during compression) (1)
  • The original file/data can be recreated/restored exactly (1)

Allow 'the compressed file takes up less storage space' for the first mark.

The second and third bullets are two ways of making the same point: award a maximum of one mark for them, so a response that says no data is lost and that the original file can be restored, but does not say the file is smaller, scores one mark.

Do not accept descriptions of lossy compression, e.g. 'it removes data that is not needed to make the file smaller'.

Ignore reference to download/transmission times, bandwidth and streaming, as these are benefits of compression and not part of the definition.

Example answers and how they were marked
Full marks2/2

Lossless compression reduces the size of a file without permanently removing any data, so the original file can be restored exactly.

Why: Reduces the size of a file (1) and no data is lost, so the original can be restored exactly (1); maximum of two marks reached.

Some marks1/2

It makes a file smaller so it downloads more quickly.

Why: Reduces the size of a file (1); the faster download is ignored as a benefit, not part of the definition.

No marks0/2

It removes data that is not needed to make the file smaller.

Why: Describes lossy compression, which the do-not-accept line rules out, so the mention of making the file smaller is not credited.

4Calculate2 marksBinary Shifts Swap Remove

Computers manipulate binary patterns.

Complete the table with the result of applying the shift to the binary pattern.

[2 marks]
Binary patternShift8-bit binary result
1000 0001Logical shift right by 1
Mark scheme

Award one mark for each correct nibble in the correct order:

  • 0100 (1)
  • 0000 (1)

0 marks if the response is not 8-bit binary.

Example answers and how they were marked
Full marks2/2

0100 0000

Why: Every bit moves 1 place right, with 0s in from the left: both nibbles are correct (2).

Some marks1/2

0100 0001

Why: A slip in the last bit. The first nibble is correct (1); the second is not.

No marks0/2

0000 0010

Why: Shifts the bits the wrong way. Neither nibble is correct.

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.