Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

6 questions · 10 marks

Pick again
Print
1Multiple choice1 markStored Program Computers Swap Remove

Identify the function of the control unit in the fetch-decode-execute cycle.

[1 mark]
  • ADecodes instructions
  • BPerforms arithmetic operations
  • CStores data and instructions
  • DTemporarily stores data being processed
Mark scheme
  • A Decodes instructions (1)
  • The only correct answer is A. The correct answer is Decodes instructions.
  • B is not correct because the arithmetic logic unit performs arithmetic operations
  • C is not correct because main memory stores data and instructions
  • D is not correct because registers temporarily store data being processed
Example answers and how they were marked
Full marks1/1

A Decodes instructions

Why: Correct option: the control unit decodes instructions during the fetch-decode-execute cycle (1).

No marks0/1

C Stores data and instructions

Why: Main memory stores data and instructions, not the control unit; this is a common distractor, so no mark.

No marks0/1

B Performs arithmetic operations

Why: Arithmetic operations are performed by the ALU, not the control unit; a common confusion between CPU components, so no mark.

2Multiple choice1 markImages Swap Remove

Identify the smallest identifiable area of a bitmap image.

[1 mark]
  • AColour depth
  • BFile size
  • CPixel
  • DResolution
Mark scheme
  • C Pixel (1)
  • The only correct answer is C. The correct answer is pixel.
  • A is not correct because colour depth is the number of bits used to store the colour of each pixel
  • B is not correct because file size is the amount of storage an image takes up, not an area of the image
  • D is not correct because resolution is a measure of the number of pixels in an image (such as its width × height), not the smallest identifiable area
Example answers and how they were marked
Full marks1/1

C Pixel

Why: Correct option; a pixel is the smallest identifiable area of a bitmap image (1).

No marks0/1

D Resolution

Why: Resolution is a measure of the number of pixels in an image, not the smallest identifiable area; no mark.

No marks0/1

A Colour depth

Why: Colour depth is the number of bits used to store each pixel's colour, not the smallest identifiable area; no mark.

3Short 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.

4Describe2 marksUtility Software Swap Remove

A student has a large number of photographs stored on a computer.

Describe the purpose of data compression software.

[2 marks]
Mark scheme

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

  • Makes a file/files smaller (1) so less storage space is needed on the disk (1)
  • Reduces the size of the data (1) so it takes less time to upload/download/transfer the file (1)
  • Compresses files/folders into a single file (1) so an attachment is under the size limit for email (1)
  • Reduces the size of the files (1) so more of them fit onto a storage device/backup media (1)

Do not accept 'it compresses the files' on its own, as this repeats the question.

Do not accept responses about protecting files from malware/viruses or about deleting files.

Example answers and how they were marked
Full marks2/2

It makes the files smaller (1) so that they use less storage space on the computer and more of them fit on the disk (1).

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

Some marks1/2

It makes files smaller.

Why: This is the point (1) but there is no development of what the smaller size leads to, so only one mark.

No marks0/2

It protects the files from viruses so that they cannot be damaged.

Why: This describes anti-malware software, which the mark scheme does not accept; no creditworthy point is made.

5Explain2 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.

6Calculate2 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.