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

Pick again
Print
1Short recall2 marksStored Program Computers Swap Remove

Computers use the von Neumann stored program concept.

Define the term stored program concept.

[2 marks]
Mark scheme

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

  • Program instructions are stored in main memory/RAM (1)
  • The data used by the program is stored in main memory/RAM (1)
  • The CPU fetches/reads instructions from main memory to execute them (1)
  • The program can be run without the instructions being input again (1)

Allow 'the program is stored in memory' for one mark.

Do not accept answers about programs being stored on secondary storage, such as a hard disk or USB memory stick.

Do not accept answers that only describe the von Neumann architecture (e.g. having a CPU and memory) without stating that instructions are stored in main memory.

Example answers and how they were marked
Full marks2/2

Both the program instructions and the data the program uses are held in the same main memory, and the CPU fetches these instructions from memory to execute them.

Why: Instructions stored in main memory (1) and the CPU fetches instructions from memory to execute them (1).

Some marks1/2

Program instructions are stored in main memory.

Why: Instructions stored in main memory (1). No second point about data being stored in the same memory or about the CPU fetching instructions.

No marks0/2

The program is saved on the hard disk so that it can be loaded into RAM when the user runs it.

Why: A near-miss about secondary storage, which the mark scheme says not to accept; the stored program concept is about instructions being held in main memory.

2Describe2 marksFile Management Swap Remove

File management is one function of an operating system.

Describe what the operating system does to the folder structure when a file is moved to a different folder.

[2 marks]
Mark scheme

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

  • Updates/changes the location/path stored for the file (1) so the file can be found in its new folder/location (1)
  • Removes the file's entry/reference from the old folder (1) so the file no longer appears/is listed there (1)
  • Adds/creates an entry/reference for the file in the new folder (1) so the file appears/is listed in its new location (1)
  • Updates the folder/directory listing/structure (1) to show the file's new location/path (1)

Do not accept descriptions of copying the file or leaving a duplicate in the old folder.

Do not accept deleting and recreating the file, or moving the file's data to a different physical location on the disk; the marks are for updating the folder/directory structure.

Example answers and how they were marked
Full marks2/2

It updates the location stored for the file so the file can be found in its new folder.

Why: Linked point (1) and development/outcome (1).

Some marks1/2

It removes the file's entry from the old folder.

Why: Creditworthy point (1) but no linked development.

No marks0/2

It deletes the file from the old folder and saves it again in the new folder.

Why: Describes deleting and recreating the file, which the mark scheme does not accept.

3Describe2 marksTranslators Swap Remove

A compiler and an interpreter both translate source code.

Describe one difference between what a compiler produces and what an interpreter produces.

[2 marks]
Mark scheme

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

  • A compiler produces object code/machine code/an executable (file) (1) whereas an interpreter produces no object code/translated file (1)
  • A compiler produces a machine code file (1) that can be run on its own/without the compiler/translator being present (1)
  • An interpreter produces no object code/file (1) because it translates and executes each line instead of saving translated code (1)
  • The compiler's output can be saved/stored (1) and run again later, while interpreted code has to be translated again each time it is run (1)

Allow binary for machine code.

Allow executable/an executable for object code.

Do not accept responses about translating the whole program, reporting errors or the speed of execution.

Do not accept 'the interpreter translates/executes one line at a time' on its own: this is how it translates, not what it produces. It earns the development only when linked to no object code/translated file being produced.

Do not accept the interpreter producing object code/an executable.

Example answers and how they were marked
Full marks2/2

A compiler produces object code, which is saved as a file, whereas an interpreter does not produce a file because it translates and executes each line.

Why: Compiler produces object code (1) contrasted with the interpreter producing no object code/translated file (1).

Some marks1/2

The compiler produces machine code.

Why: Machine code/object code produced (1); there is no contrast with the interpreter, so the development is not earned.

No marks0/2

The interpreter produces object code for each line it translates.

Why: Reverses the translators' outputs: the interpreter produces no object code, so nothing is creditworthy.

4Calculate2 marksBinary Shifts Swap Remove

Binary, denary and hexadecimal patterns represent numbers.

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

[2 marks]
Binary patternShift8-bit binary result
1010 1100Arithmetic shift right by 1
Mark scheme

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

  • 1101 (1)
  • 0110 (1)

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

Example answers and how they were marked
Full marks2/2

1101 0110

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

Some marks1/2

0101 0110

Why: Fills the gap on the left with 0s, as a logical shift would, instead of copying the sign bit. The second nibble is correct (1); the first is not.

No marks0/2

0101 1000

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.