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 markFetch Decode Execute Cycle Swap Remove

Identify the CPU component that decodes instructions during the fetch-decode-execute cycle.

[1 mark]
  • AArithmetic logic unit
  • BControl unit
  • CMain memory
  • DRegister
Mark scheme
  • B Control unit (1)
  • The only correct answer is B. The correct answer is control unit.
  • A is not correct because the arithmetic logic unit performs arithmetic and logical operations, not decoding
  • C is not correct because main memory stores instructions and data, not decoding
  • D is not correct because a register holds data or addresses temporarily, not decoding
Example answers and how they were marked
Full marks1/1

B Control unit

Why: Correct option: the control unit decodes instructions (1).

No marks0/1

D Register

Why: Near-miss: a register holds data or addresses temporarily, it does not decode instructions (0).

No marks0/1

A Arithmetic logic unit

Why: Misconception: the arithmetic logic unit performs arithmetic and logical operations; it does not decode (0).

2Short recall1 markUnits & Conversion Swap Remove

A file has a size of 2 kibibytes.

State the number of bytes in the file.

[1 mark]
Mark scheme

Award one mark for:

  • 2048 (1)
  • 2 × 1024 (1)
  • 2^11 (1)

Allow 2048 bytes.

Do not accept 2000, which is the number of bytes in two decimal kilobytes.

Do not accept 1024, which is the number of bytes in one kibibyte.

Do not accept 16, which is the number of bits in two bytes.

Example answers and how they were marked
Full marks1/1

2048

Why: 2048 is 2 × 1024, the number of bytes in 2 kibibytes (1).

No marks0/1

2000

Why: 2000 uses the decimal kilobyte, not the binary kibibyte; the mark scheme does not accept it.

No marks0/1

16

Why: 16 is the number of bits in two bytes, confusing bits with bytes; the mark scheme does not accept it.

3Describe2 marksTranslators Swap Remove

High-level code can be translated by a compiler or by an interpreter.

Describe how a compiler translates high-level code differently from an interpreter.

[2 marks]
Mark scheme

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

  • The compiler translates the whole program/complete source code in one go (1) whereas the interpreter translates one line/statement at a time (1)
  • The compiler translates all of the source code before any of it is run/executed (1) but the interpreter translates each line/statement as it reads it (1)
  • The interpreter translates one line/statement at a time (1) and the compiler translates the whole program/source code together (1)

Accept the compiler point and the interpreter point in either order.

Do not accept responses about object code/executable files, when the translated code is executed, how errors are reported, or speed/memory use.

Do not accept 'the interpreter executes/runs each line' on its own, without saying that it translates one line/statement at a time.

Example answers and how they were marked
Full marks2/2

A compiler translates the whole program in one go, while an interpreter translates one line at a time.

Why: Whole program translated in one go (1) and interpreter translates one line at a time (1).

Some marks1/2

A compiler translates the whole program in one go.

Why: Whole program translated in one go (1); no linked point about the interpreter translating a line at a time.

No marks0/2

A compiler produces an executable file, but an interpreter does not.

Why: Describes the output, not the amount translated at a time; object code/executable files are not accepted.

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.