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 definition of lossy compression.

[1 mark]
  • AData is removed only while the file is being transmitted
  • BData is permanently removed to reduce the file size
  • CData is restored exactly when it is decompressed
  • DData is stored using a dictionary of repeated patterns
Mark scheme
  • B Data is permanently removed to reduce the file size (1)
  • The only correct answer is B. The correct answer is data is permanently removed to reduce the file size.
  • A is not correct because the data removed by a lossy algorithm is not restored after transmission
  • C is not correct because that describes lossless compression, where the original file is rebuilt exactly
  • D is not correct because dictionary encoding is a lossless method that records repeated patterns once
Example answers and how they were marked
Full marks1/1

B Data is permanently removed to reduce the file size

Why: Correct option (1).

No marks0/1

C Data is restored exactly when it is decompressed

Why: Near miss: this describes lossless compression, so no mark.

No marks0/1

A Data is removed only while the file is being transmitted

Why: Misconception that compression only applies during transmission; the data is removed permanently, so 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

3Describe2 marksLow and High Level Languages Swap Remove

A programmer writes a program in a high-level language.

Describe why the program can be run on computers with different processors.

[2 marks]
Mark scheme

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

  • The same source code can be run on different types/makes of processor (1) with few or no changes being made to the program (1)
  • A compiler/interpreter is available for each type of processor (1) to translate the source code into the machine code for that processor (1)
  • The statements are not tied to one processor's instruction set (1) so the program is portable between different computers (1)

Do not accept 'it is translated by a compiler' on its own.

Do not accept 'the program does not need to be translated' or 'it is easier to use'.

Example answers and how they were marked
Full marks2/2

A compiler exists for each type of processor to translate the source code into the machine code for that processor.

Why: Names the translator for each processor (1) and links it to producing that processor's machine code (1).

Some marks1/2

The same program can be run on different computers.

Why: States that the same code runs on different machines (1) but does not develop it by saying that few or no changes are needed.

No marks0/2

Because it is translated by a compiler.

Why: A compiler on its own does not explain machine independence; the answer does not say that a translator exists for each type of processor.

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.