Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 514 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 · 7 marks

Pick again
Print
1Multiple choice1 markEmbedded Systems Swap Remove

Identify the term for a computer that forms part of another device and performs a specific task.

[1 mark]
  • AEmbedded system
  • BGeneral purpose computer
  • CNetworked computer
  • DServer computer
Mark scheme
  • A Embedded system (1)
  • The only correct answer is A. The correct answer is embedded system.
  • B is not correct because a general purpose computer can run many different application programs
  • C is not correct because a networked computer is connected to other computers to share resources
  • D is not correct because a server computer provides services or resources to other computers on a network
Example answers and how they were marked
Full marks1/1

A Embedded system

Why: Correct option: an embedded system forms part of another device and performs a specific task (1).

No marks0/1

B General purpose computer

Why: Near miss: a general purpose computer can run many different application programs; it is not built into another device to perform a specific task, so no mark.

No marks0/1

D Server computer

Why: Misconception: a server provides services or resources to other computers on a network and is not an embedded system, so no mark.

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

3Describe2 marksLow and High Level Languages Swap Remove

A programmer has written a program in assembly language.

Describe why it is necessary to translate the program into machine code before it can be run.

[2 marks]
Mark scheme

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

  • The processor/CPU can only execute machine code/binary instructions (1) so the assembly instructions must be converted into machine code before the program can run (1)
  • Each assembly instruction/mnemonic matches/corresponds to one machine code instruction (1) so each line must be replaced with the machine code the processor executes (1)
  • The program is written using mnemonics (1) that must be translated into machine code for the processor to carry out the instructions (1)
  • The hardware/processor does not understand assembly language directly (1) so it must be translated into machine code that the processor can execute (1)

Do not accept 'assembly language is a low-level language'.

Do not accept 'it is hard to understand' or 'it is not English'.

Do not accept benefits, such as 'machine code runs faster' or 'the program will run more quickly'.

Do not accept 'an assembler/a translator converts it' on its own, with no reference to the processor only being able to execute machine code/binary.

Do not accept responses about high-level languages or about compilers/interpreters.

Example answers and how they were marked
Full marks2/2

The processor can only execute machine code, so the assembly instructions must be converted into machine code before the program can run.

Why: States what the processor can execute (1) and links it to converting the program's instructions into machine code (1).

Some marks1/2

Each assembly instruction matches one machine code instruction.

Why: Correct point about the one-to-one match (1) but no development saying that this is because the processor only executes machine code.

No marks0/2

Because an assembler translates assembly language into machine code.

Why: Names the translator but gives no reason tied to the processor only being able to execute machine code, so no mark; this is in the 'Do not accept' guidance.

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

Questions by topic

2.1 Binary

Build a paper on this topic 58
Adding Binary Numbers 6 questions Binary and Hexadecimal Basics 10 questions Binary Shifts 6 questions Binary to Denary Conversion 6 questions Binary to Hexadecimal Conversion 6 questions Denary to Binary Conversion 6 questions Denary to Hexadecimal Conversion 6 questions Denary to Negative Binary Conversion 6 questions Hexadecimal to Binary Conversion 6 questions

2.2 Data representation

Build a paper on this topic 56
Character Sets 18 questions Images 19 questions Sound 19 questions

2.3 Data storage and compression

Build a paper on this topic 24
Compression 18 questions Units & Conversion 6 questions

3.1 Hardware

Build a paper on this topic 77
Embedded Systems 17 questions Fetch Decode Execute Cycle 15 questions Primary Memory 15 questions Secondary Memory 15 questions Stored Program Computers 15 questions

3.2 Software

Build a paper on this topic 124
File Management 18 questions Memory Management 16 questions Peripheral Management 11 questions Process Management 12 questions Purpose & Function of Operating Systems 17 questions Software Basics 13 questions User Management 18 questions Utility Software 19 questions

3.3 Programming languages

Build a paper on this topic 37
Low and High Level Languages 19 questions Translators 18 questions

4.1 Networks

Build a paper on this topic 138
Addressing 16 questions LANs & WANs 16 questions Network Speed 5 questions Packet Switching 16 questions Protocols & Layers 17 questions The Internet 16 questions Topologies 17 questions Wired Connections 17 questions Wireless Connections 18 questions

More ways to revise Edexcel GCSE Computer Science (1CP2)

Activities Flashcards Revision notes

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.