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 markTranslators Swap Remove

An interpreter translates high-level code differently from a compiler.

Identify what an interpreter does immediately after translating a line of code.

[1 mark]
  • AExecutes the line
  • BProduces the object code
  • CSaves the line to a file
  • DTranslates the next line
Mark scheme
  • A Executes the line (1)
  • The only correct answer is A. The correct answer is that the interpreter executes the line.
  • B is not correct because an interpreter does not produce object code; that is what a compiler does
  • C is not correct because an interpreter does not save the translated code to a file
  • D is not correct because the interpreter executes the current line before it translates the next line
Example answers and how they were marked
Full marks1/1

A Executes the line

Why: Selected the line being executed straight after translation, which is how an interpreter works (1).

No marks0/1

D Translates the next line

Why: Near miss: the interpreter executes the translated line first and only then moves on to translate the next line, so no mark.

No marks0/1

B Produces the object code

Why: Confuses interpretation with compilation: object code is produced by a compiler, not an interpreter, so no mark.

2Short recall1 markTranslators Swap Remove

A compiler translates programs written in a high-level language.

State how much of a program a compiler translates before the program is run.

[1 mark]
Mark scheme

Award one mark for:

  • The whole program (before it is run) (1)

Allow all of the code/the entire program/the whole program in one go

Do not accept one line/statement at a time or each line as it is executed

Do not accept translating only the lines that contain errors

Example answers and how they were marked
Full marks1/1

The whole program, before it is run.

Why: Whole program translated before it is run (1).

No marks0/1

It translates the program one line at a time.

Why: Describes an interpreter; the scheme does not accept line-by-line translation.

No marks0/1

It translates only the lines that contain errors.

Why: Not a compiler behaviour; the scheme does not accept translating only error lines.

3Short recall2 marksLow and High Level Languages Swap Remove

Programs can be written in high-level or low-level programming languages.

Define the term high-level programming language.

[2 marks]
Mark scheme

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

  • Uses statements/instructions that look like English/maths (1)
  • Does not depend on one type of processor / can be run on different types of computer with few or no changes (machine independent) (1)
  • A single statement is translated into several machine code instructions (1)
  • Provides data structures such as arrays and records (1)
  • Provides built-in/library subprograms (1)
  • Is translated by a compiler or an interpreter (1)

Allow portable/platform independent for machine independent.

Allow easier to read/write/understand/debug only when linked to the English-like statements, e.g. uses words that look like English so it is easier to understand.

Do not accept a high-level language / not a low-level language with no other detail.

Do not accept written in binary/machine code.

Do not accept faster to run / uses less memory, as these are characteristics of low-level languages.

Example answers and how they were marked
Full marks2/2

A language that uses statements that look like English and a program written in it can be run on different types of computer without being rewritten.

Why: English-like statements (1) and machine independent/portable (1).

Some marks1/2

A language that provides data structures such as arrays and records.

Why: Creditworthy point: provides data structures (1). No second part of the definition given.

No marks0/2

A language that is written in binary so the computer can understand it.

Why: Misconception: binary is machine code, not a high-level language; the mark scheme's do-not-accept line covers this.

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.