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

3 questions · 7 marks

Pick again
Print
1Short recall2 marksStored Program Computers Swap Remove

The central processing unit (CPU) contains an arithmetic logic unit (ALU).

State two types of operation carried out by the ALU.

[2 marks]
Mark scheme

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

  • An arithmetic operation, e.g. addition/subtraction/multiplication/division (1)
  • A logical operation, e.g. comparing two values (is A > B?) / using AND, OR, NOT (1)

Do not accept decoding instructions, fetching instructions or controlling the timing of the CPU, as these are carried out by the control unit.

Example answers and how they were marked
Full marks2/2

It carries out arithmetic operations such as addition and subtraction, and logical operations such as comparing two values to see if one is greater than the other.

Why: Arithmetic operation (1) and logical operation (1).

Some marks1/2

It adds numbers together and works out the result.

Why: Arithmetic operation, addition (1). No logical operation.

No marks0/2

It decodes the instructions that have been fetched from main memory.

Why: Decoding and fetching are the control unit's role; the mark scheme's do-not-accept line covers this.

2Describe2 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.

3Calculate3 marksAdding Binary Numbers Swap Remove

Computers manipulate binary patterns.

(a)

Complete the table to show the 8-bit result of the binary addition.

[2 marks]
1286432168421
10111001
10111100
Mark scheme

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

  • 0111 (1)
  • 0101 (1)

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

Ignore a carry shown beyond the eighth bit.

Example answers and how they were marked
Full marks2/2

0111 0101

Why: 185 + 188 = 373, which needs 9 bits; the 8 bits that are kept are both correct (2).

Some marks1/2

0000 0101

Why: Forgets to carry the 1s. The second nibble is correct (1); the first is not.

No marks0/2

1011 1101

Why: Never carries. Neither nibble is correct.

(b)

State the name of the error that occurs when this addition is carried out.

[1 mark]
Mark scheme

Award one mark for:

  • overflow (error) (1)
Example answers and how they were marked
Full marks1/1

Overflow

Why: The result needs more bits than are available (1).

No marks0/1

Underflow

Why: A near miss: the result is too big for 8 bits, not too small.

No marks0/1

A syntax error

Why: A syntax error is a mistake in a program's code, not in arithmetic.

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.