Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 597 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 · 7 marks

Pick again
Print
1Multiple choice1 markSound Swap Remove

A sound wave is sampled and the amplitude of each sample is stored using 2 bits.

Identify the number of different amplitude values that can be stored for each sample.

[1 mark]
  • A2
  • B4
  • C8
  • D16
Mark scheme
  • B 4 (1)
  • The only correct answer is B. The correct answer is 4 (2 bits give 2^2 = 4 values).
  • A is not correct because 2 is the number of bits used to store each sample
  • C is not correct because 8 different amplitude values would need 3 bits
  • D is not correct because 16 different amplitude values would need 4 bits
Example answers and how they were marked
Full marks1/1

B 4

Why: Selects the only correct option (1).

No marks0/1

C 8

Why: Near miss: 8 values would need 3 bits, one more than this recording uses (0).

No marks0/1

A 2

Why: Typical misconception: 2 is the number of bits, not the number of amplitude values those bits can store (0).

2Short recall2 marksUnits & Conversion Swap Remove

A solid state drive has a capacity of 5 gibibytes.

Give an expression to calculate the number of bits in 5 gibibytes. You do not need to do the calculation.

[2 marks]
Mark scheme

Award one mark for each of:

  • 5 × 1024^3 / 5 × 1024 × 1024 × 1024 / 5 × 2^30, for the number of bytes (1)
  • A fully correct expression with × 8 to convert bytes to bits, in any order, e.g. 5 × 1024^3 × 8, 8 × 5 × 2^30 (1)

Accept 5 × 1 073 741 824 × 8.

Accept 5 × 2^33 or 42 949 672 960 as a fully correct expression (2 marks).

Do not accept 5 × 1000^3 × 8, which uses decimal multiples.

Do not accept ÷ 8, which converts bits to bytes.

Example answers and how they were marked
Full marks2/2

8 × 5 × 2^30

Why: 5 × 2^30 is the number of bytes (1) and × 8 converts bytes to bits (1).

Some marks1/2

5 × 2^30

Why: Correct number of bytes using the binary multiple 2^30 (1), but no conversion to bits.

No marks0/2

5 × 1000^3 × 8

Why: Uses decimal 1000^3 instead of binary 1024^3, so the expression is not fully correct; no creditworthy point.

3Describe2 marksTranslators Swap Remove

A compiler and an interpreter both translate source code.

Describe one difference between what a compiler produces and what an interpreter produces.

[2 marks]
Mark scheme

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

  • A compiler produces object code/machine code/an executable (file) (1) whereas an interpreter produces no object code/translated file (1)
  • A compiler produces a machine code file (1) that can be run on its own/without the compiler/translator being present (1)
  • An interpreter produces no object code/file (1) because it translates and executes each line instead of saving translated code (1)
  • The compiler's output can be saved/stored (1) and run again later, while interpreted code has to be translated again each time it is run (1)

Allow binary for machine code.

Allow executable/an executable for object code.

Do not accept responses about translating the whole program, reporting errors or the speed of execution.

Do not accept 'the interpreter translates/executes one line at a time' on its own: this is how it translates, not what it produces. It earns the development only when linked to no object code/translated file being produced.

Do not accept the interpreter producing object code/an executable.

Example answers and how they were marked
Full marks2/2

A compiler produces object code, which is saved as a file, whereas an interpreter does not produce a file because it translates and executes each line.

Why: Compiler produces object code (1) contrasted with the interpreter producing no object code/translated file (1).

Some marks1/2

The compiler produces machine code.

Why: Machine code/object code produced (1); there is no contrast with the interpreter, so the development is not earned.

No marks0/2

The interpreter produces object code for each line it translates.

Why: Reverses the translators' outputs: the interpreter produces no object code, so nothing is creditworthy.

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.