Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 573 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

5 questions · 14 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 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.

3Explain2 marksPacket Switching Swap Remove

A file is sent across the internet in packets.

Explain why packets from the same file may take different routes.

[2 marks]
Mark scheme

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

  • Each router chooses the best route at the time (1) so when a route becomes busy/congested or fails, later packets are forwarded along a different path (1)
  • Routers forward each packet separately (1) so the path a packet takes depends on the traffic conditions when that packet arrives (1)
  • A router may send a packet to a different next router (1) if its routing table shows a better/less congested route for that packet (1)
  • Traffic on the internet changes (1) so no single path is kept for the file and each packet can use whichever route is best when it is sent (1)

For both marks, the expansion must follow/associate with the statement.

Allow reference to a routing table, or to how a router decides the route, as part of the linked reason.

Do not accept 'the packets have different IP addresses' because all packets from the same file have the same destination IP address, even though their routes can differ.

Do not accept 'the internet is busy' or 'there is a lot of traffic' on its own without linking this to the router choosing a different route.

Do not accept 'different routers send the packets' on its own without a reason why a different router/route is chosen.

Do not accept an answer that only says the packets take different routes without explaining why.

Example answers and how they were marked
Full marks2/2

Each router chooses the best route at the time, so if one route becomes busy or fails, later packets are sent a different way.

Why: Linked point (1) that each router chooses the best route at the time and reason (1) that a busy or failed route means later packets take a different path.

Some marks1/2

Routers send packets along the least congested route.

Why: States that a router chooses the least congested route (1) but gives no linked reason why this makes the packets from the file take different routes.

No marks0/2

Because each packet is given a different IP address so they go to different places.

Why: Misconception named in the mark scheme: all packets from the same file share the same destination IP address, even though their routes can differ.

4Calculate2 marksBinary Shifts Swap Remove

Computers manipulate binary patterns.

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

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

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

  • 0100 (1)
  • 0000 (1)

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

Example answers and how they were marked
Full marks2/2

0100 0000

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

Some marks1/2

0100 0001

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

No marks0/2

0000 0010

Why: Shifts the bits the wrong way. Neither nibble is correct.

5Discuss6 marksLow and High Level Languages Swap Remove

A company is developing the firmware for a robotic vacuum cleaner. The firmware must read the distance sensors and control the motors. The vacuum cleaner has a small amount of memory.

Discuss the characteristics of a low-level programming language that make it suitable for writing the firmware.

Your answer should include:

  • control of the hardware
  • the efficiency of the code
  • the link between the language and the processor.
[6 marks]
Mark scheme

Indicative content

Control of the hardware

  • Low-level languages can read and write the contents of registers and memory addresses directly, so the firmware can take the values from the distance sensors without calling a library routine.
  • Assembly language instructions can read from and write to specific input/output ports on the vacuum cleaner's processor, so the motors can be switched on and off directly.
  • The programmer decides exactly which processor operations are carried out and in which order, which matters when the vacuum must reverse away from a step or an obstacle.
  • A low-level language puts nothing between the program and the hardware, so the programmer can control the hardware of the vacuum cleaner precisely.

Efficiency of the code

  • Assembly language code can be hand-optimised instruction by instruction, so the code that checks a sensor is as short as possible.
  • The programmer can choose which registers hold values that are used again and again, which cuts down the number of memory accesses the firmware needs.
  • A hand-written low-level program can be made compact, so it is more likely to fit in the small amount of memory the vacuum cleaner has.
  • Because each instruction does one defined job, the time taken to react to a sensor reading is predictable, which suits firmware that must not overrun.

Link between the language and the processor

  • Low-level languages are processor-specific, so the instructions used are those of the exact processor in the vacuum cleaner rather than general statements that need translating.
  • Each assembly language instruction maps to one machine code instruction, so the programmer knows precisely which processor operation will be carried out by each line of code.
  • An assembler turns each mnemonic into its machine code equivalent, so the machine code running on the vacuum cleaner's processor is exactly what the programmer wrote.
  • Code written for a different processor would have to be rewritten, which is acceptable here because the vacuum cleaner always uses the same processor.

Levels

  • Level 0 (0 marks): No rewardable content.
  • Level 1 (1–2 marks): Basic, independent points are made, showing elements of understanding of key concepts/principles of computer science. (AO1) The discussion will contain basic information with little linkage between points made or application to the context. (AO2)
  • Level 2 (3–4 marks): Demonstrates adequate understanding of key concepts/principles of computer science. (AO1) The discussion shows some linkages and lines of reasoning with some structure and application to the context. (AO2)
  • Level 3 (5–6 marks): Demonstrates comprehensive understanding of key concepts/principles of computer science to support the discussion being presented. (AO1) The discussion is well developed, with sustained lines of reasoning that are coherent and logically structured, and which clearly apply to the context. (AO2)

Within Level 1, award 1 mark for a single basic point and 2 marks for two or more independent basic points; Level 2 requires the points to be linked to the vacuum cleaner; Level 3 requires both control of the hardware and efficiency of the code, and a few concise, linked sentences can reach Level 3, so extra length is not required.

Accept registers, memory addresses, input/output ports, machine code and mnemonics as ways of describing access to the hardware, and accept 'a low-level language is faster' as a basic point on its own. Do not award 'binary is a low-level language' (machine code is written in binary, but binary is not a language), or characteristics of high-level languages such as being easy to read or portable, as characteristics of a low-level language.

Example answers and how they were marked
Full marks6/6

A low-level language can read and write to registers and to input/output ports directly, so the firmware can take the distance sensor readings and switch the motors without needing library routines. It can be hand-optimised instruction by instruction, so the code that checks a sensor is short and the time it takes is predictable, and a compact program is more likely to fit in the vacuum cleaner's small memory. The language is processor-specific and each assembly instruction maps to one machine code instruction, so the programmer knows exactly which operation the vacuum's processor will carry out, and the assembled machine code is exactly what they wrote.

Why: Covers all three bullets: direct control of registers and ports applied to the sensors and motors, hand-optimised compact code with predictable timing applied to the small memory, and the one-to-one link to the processor's own instruction set. Linked and applied throughout, so Level 3.

Some marks2/6

A low-level language can control the hardware directly. It can read the sensors and control the motors. It is also faster than a high-level language, so the vacuum responds quickly. This is useful because it has little memory.

Why: Three basic, independent points: direct control of the hardware applied to the sensors and motors, faster execution, and suitability for limited memory. They are asserted without development (no registers, ports or predictable timing) and the link between the language and the processor is missing, so Level 1, two or more basic points (2).

Some marks1/6

A low-level language is written in binary, so the computer can understand it directly. It is faster than a high-level language.

Why: 'Faster than a high-level language' is a creditworthy basic point (1). 'Written in binary' is not awarded, as binary itself is not a language and the do-not-award rule applies. Only one undeveloped point with no application to the vacuum cleaner, so Level 1, single basic point (1).

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.