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 · 4 marks

Pick again
Print
1Multiple choice1 markCompression Swap Remove

Identify the statement that describes lossless compression.

[1 mark]
  • AData is encrypted so that it cannot be read by others
  • BData is permanently removed to make the file smaller
  • CNo data is lost and the original file can be recreated
  • DThe file is split into packets that are sent separately
Mark scheme
  • C No data is lost and the original file can be recreated (1)
  • The only correct answer is C. The correct answer is no data is lost and the original file can be recreated.
  • A is not correct because encryption hides data and does not make the file smaller
  • B is not correct because permanently removing data is lossy compression
  • D is not correct because splitting a file into packets is part of transmission, not compression
Example answers and how they were marked
Full marks1/1

C No data is lost and the original file can be recreated

Why: Correct option (1).

No marks0/1

B Data is permanently removed to make the file smaller

Why: Near miss: this is lossy compression, not lossless, so no mark.

No marks0/1

D The file is split into packets that are sent separately

Why: Misconception that compression is packet switching; no mark.

2Short recall1 markImages Swap Remove

Each pixel in a bitmap image is stored using a number of bits.

Define the term colour depth.

[1 mark]
Mark scheme

Award one mark for any of the following:

  • The number of bits per pixel (1)
  • The number of bits used to represent/store the colour of each pixel (1)

Allow bit depth

Do not accept the number of colours a pixel can have on its own

Do not accept the number of pixels in the image (this is the resolution/image size)

Example answers and how they were marked
Full marks1/1

The number of bits used to store the colour of one pixel.

Why: Gives the number of bits per pixel (1)

No marks0/1

The number of colours that each pixel can use.

Why: Gives the number of colours, not the number of bits; the mark scheme does not accept this on its own

No marks0/1

The number of pixels in the image.

Why: Confuses colour depth with resolution/image size, which the mark scheme does not accept

3Convert2 marksDenary to Binary Conversion Swap Remove

Computers manipulate binary patterns.

Convert the denary number 184 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1011 (1)
  • 1000 (1)

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

Example answers and how they were marked
Full marks2/2

1011 1000

Why: 184 = 128 + 32 + 16 + 8: both nibbles are correct (2).

Some marks1/2

1011 1001

Why: Converts 185 instead (a slip in adding up the place values). The first nibble is correct (1); the second is not.

No marks0/2

0001 1101

Why: The bits are written in reverse, smallest place value first. 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.