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

Pick again
Print
1Short recall3 marksFetch Decode Execute Cycle Swap Remove

The fetch-decode-execute cycle is used by the CPU.

State three things that happen during the fetch stage.

[3 marks]
Mark scheme

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

  • The address (of the next instruction) is sent from the CPU to main memory / placed on the address bus (1)
  • The (next) instruction is fetched/read from main memory (RAM) (1)
  • The instruction is brought/copied into the CPU / received into the MDR (1)
  • The program counter (PC) is incremented/updated to hold the address of the next instruction (1)

Allow 'the PC/MAR is placed on the address bus' for the address being sent to main memory.

Allow 'the MDR receives the instruction' for the instruction being brought into the CPU.

Do not award a second mark for the instruction being fetched from main memory and the instruction being brought into the CPU; these are the same point.

Do not award 'the instruction is transferred along the data bus' on its own; this is the same point as the instruction being fetched from main memory.

Do not accept answers about decoding the instruction, e.g. 'the instruction is fetched from RAM and decoded', as decoding happens in the decode stage.

Do not accept answers about the execute stage, e.g. 'the ALU carries out the calculation' or 'the result of a calculation is stored in a register', as these happen in the execute stage.

Example answers and how they were marked
Full marks3/3

The address of the next instruction is sent to main memory, the instruction is fetched from RAM, and the program counter is incremented.

Why: Address sent to main memory (1), instruction fetched from RAM (1) and program counter incremented (1).

Some marks1/3

The instruction is fetched from main memory and then decoded.

Why: Fetching the instruction from main memory (1); decoding happens in the decode stage, so it is not creditworthy in the fetch stage.

No marks0/3

The ALU carries out the calculation and the result is stored in a register.

Why: The ALU carrying out a calculation and storing a result happen in the execute stage, not the fetch stage, so no point is creditworthy.

2Explain2 marksThe Internet Swap Remove

Routers on the internet choose a route for each packet.

Explain one benefit of a router being able to choose a different route for a packet.

[2 marks]
Mark scheme

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

  • Data can avoid a busy/congested link (1) because the router can choose another path (1)
  • Data can still arrive if a link fails (1) because the router sends it another way (1)
  • Data can take the shortest/fastest path (1) because the router compares the routes and chooses the one with the fewest hops/least traffic (1)

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

Allow other valid benefits with a linked reason, e.g. traffic can be shared across routes/load balanced (1) because the router can send some packets by another path (1)

Do not accept 'the route is always the same' as this is not a benefit of choosing a route.

Do not accept 'routers are fast' or 'packets are sent faster' on its own: the reason must say how the route is chosen, e.g. avoiding congestion or using a routing table.

Example answers and how they were marked
Full marks2/2

If one route is busy, the data can still get there (1) because the router can choose a different path (1).

Why: Linked point (1) and reason (1): a different path avoids the busy route.

Some marks1/2

It can choose the fastest route (1) because routers are quick (1).

Why: Point (1) for choosing the fastest route, but 'routers are quick' is a speed statement that does not say how the route is chosen, so it does not earn the second mark.

No marks0/2

It means more devices can connect to the internet.

Why: No link to choosing a route for a packet; does not answer the question.

3Calculate2 marksAdding Binary Numbers Swap Remove

Computers manipulate binary patterns.

Complete the table to show the result of the 8-bit binary addition.

[2 marks]
1286432168421
10010101
01001111
Mark scheme

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

  • 1110 (1)
  • 0100 (1)

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

Example answers and how they were marked
Full marks2/2

1110 0100

Why: 149 + 79 = 228, carrying where a column adds to 2: both nibbles are correct (2).

Some marks1/2

1110 0101

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

No marks0/2

1101 1111

Why: Writes 1 in every column with a 1 and never carries. 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.