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

Pick again
Print
1Describe2 marksUtility Software Swap Remove

A computer can lose power while a file is being saved.

Describe what file repair software does.

[2 marks]
Mark scheme

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

  • Attempts to repair/rebuild the corrupted file (1) so that it can be opened by its program again (1)
  • Recovers/retrieves the parts of the file that can still be read (1) so that the user does not lose all of the data in the file (1)
  • Reconstructs the file from data held in other parts of the disk (1) because part of the file/the disk is corrupted (1)
  • Saves a new/repaired copy of the file (1) as some of the data in it may not be recoverable (1)

Do not accept 'it repairs the file' on its own, as this repeats the question.

Do not accept responses about restoring a backup/previous version of the file, as this is backup software.

Do not accept responses about scanning for or removing malware.

Example answers and how they were marked
Full marks2/2

It recovers the parts of the file that can still be read (1) so that the user does not lose everything that was saved in it (1).

Why: The point (1) and a linked development giving the effect (1).

Some marks1/2

It rebuilds the damaged file from other parts of the disk.

Why: A valid point is made (1) but there is no development of what this achieves, so the second mark is not awarded.

No marks0/2

It restores the last backup of the file so the user gets the data back.

Why: This describes backup software, which the mark scheme does not accept for this question.

2Describe2 marksTranslators Swap Remove

A high-level program must be translated into machine code before it can be run.

Describe how a compiler and an interpreter differ in when the translated code is executed.

[2 marks]
Mark scheme

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

  • The interpreter executes each line as soon as it has been translated (1) so translation and execution happen together/at the same time (1)
  • The compiler translates the whole program first (1) and the machine code is run later/separately (1)
  • The interpreter translates the code and runs it while the program is running (1) whereas the compiler does not run the code it produces (1)
  • The compiler produces translated code that is executed only after all the translation has finished (1) but the interpreter executes each line immediately (1)

Allow 'translates one line at a time' where it is linked to executing each line immediately.

Do not accept answers that only state that a compiler is faster/an interpreter is slower, without reference to when execution happens.

Do not accept answers that only give object code, error reporting or portability, without reference to when execution happens.

Do not accept the compiler executing the program as it translates it.

Example answers and how they were marked
Full marks2/2

The compiler translates the code first and the program is executed afterwards, but the interpreter executes each line as soon as it has been translated.

Why: Compiler translates the whole program first and it is executed afterwards (1) and interpreter executes each line as soon as it is translated (1).

Some marks1/2

The interpreter executes each line immediately after translating it.

Why: Correct interpreter timing (1); no comparison with when the compiler's translated code is executed.

No marks0/2

The compiler executes the program line by line as it translates it.

Why: Reverses the two translators; a compiler does not execute the program it translates, so no mark.

3Calculate2 marksBinary Shifts Swap Remove

Computer systems manipulate bit patterns.

Complete the table with the result of applying the shift to the binary pattern.

[2 marks]
Binary patternShift8-bit binary result
1000 0111Logical shift right by 1
Mark scheme

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

  • 0100 (1)
  • 0011 (1)

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

Example answers and how they were marked
Full marks2/2

0100 0011

Why: Every bit moves 1 place right, with 0s in from the left: both nibbles are correct (2).

Some marks1/2

0100 0010

Why: A slip in the last bit. The first nibble is correct (1); the second is not.

No marks0/2

0000 1110

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.