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 · 6 marks

Pick again
Print
1Short recall2 marksCharacter Sets Swap Remove

A computer uses a character set to represent text.

Define the term character set.

[2 marks]
Mark scheme

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

  • A set/collection of characters (1)
  • (Characters such as) letters, digits and symbols/punctuation (1)
  • Each character is represented by a unique code/binary value (1)
  • A standard set of characters so that text can be exchanged between computer systems (1)

Allow 'a list of characters that a computer can represent' for the first mark.

Do not accept a program/software that converts text into binary.

Do not accept 'a set of binary codes' on its own.

Example answers and how they were marked
Full marks2/2

A set of characters, such as letters, digits and punctuation, where each character is represented by a unique binary code.

Why: Set/collection of characters with examples (1) and each character has a unique code (1).

Some marks1/2

A set of letters and symbols that a computer can use to represent text.

Why: Awarded for the set/collection of characters (1); no creditworthy point saying each character has its own unique code (0).

No marks0/2

A program that converts the keys pressed on a keyboard into binary.

Why: Describes software that converts text, not a set of characters; the Do not accept line applies.

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.

3Convert2 marksDenary to Binary Conversion Swap Remove

Binary patterns can represent numbers.

Convert the denary number 199 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1100 (1)
  • 0111 (1)

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

Example answers and how they were marked
Full marks2/2

1100 0111

Why: 199 = 128 + 64 + 4 + 2 + 1: both nibbles are correct (2).

Some marks1/2

1100 1000

Why: Converts 200 instead (a slip in adding up the place values). The first nibble is correct (1); the second is not.

No marks0/2

1110 0011

Why: The bits are written in reverse, smallest place value first. 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.