Menu
Exam Questions

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

Pick again
Print
1Multiple choice1 markPrimary Memory Swap Remove

Identify what is fetched from RAM during the fetch stage.

[1 mark]
  • AThe next instruction
  • BThe data at a memory address
  • CThe decoded instruction
  • DThe address of the next instruction
Mark scheme
  • A The next instruction (1)
  • The only correct answer is A. The correct answer is the next instruction.
  • B is not correct because data is fetched during the execute stage
  • C is not correct because an instruction is decoded after it is fetched
  • D is not correct because the program counter holds the address used to fetch the instruction
Example answers and how they were marked
Full marks1/1

A The next instruction

Why: The next instruction is fetched from RAM during the fetch stage (1).

No marks0/1

B The data at a memory address

Why: Near miss: data is not fetched during the fetch stage; data is used during the execute stage.

No marks0/1

C The decoded instruction

Why: Misconception: an instruction is decoded after it is fetched, in the decode stage.

2Multiple choice1 markCharacter Sets Swap Remove

A new character set must be able to represent 70 different characters.

Identify the minimum number of bits needed to represent each character.

[1 mark]
  • A6
  • B7
  • C8
  • D70
Mark scheme
  • B 7 (1)
  • The only correct answer is B. The correct answer is 7.
  • A is not correct because 6 bits give only 64 combinations, which is not enough for 70 characters
  • C is not correct because 7 bits already give 128 combinations, so 8 bits is not the minimum needed
  • D is not correct because 70 is the number of characters needed, not a number of bits
Example answers and how they were marked
Full marks1/1

B 7

Why: The only correct answer: 7 bits give 128 combinations, enough for 70 characters, and it is the smallest number of bits that does (1).

No marks0/1

C 8

Why: Distractor, no credit: a single-tick item has no partial credit, and 8 bits is not the minimum because 7 bits already give 128 combinations, so the scheme's C line gives no mark.

No marks0/1

A 6

Why: Misconception, no credit: 6 bits give only 64 combinations, which cannot represent 70 different characters, so the scheme's A line gives no mark.

3Short recall3 marksStored Program Computers Swap Remove

The CPU contains several components.

Name three components of the CPU.

[3 marks]
Mark scheme

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

  • Control unit / CU (1)
  • Arithmetic logic unit / ALU (1)
  • Register(s) (1)
  • Clock (1)

Do not accept main memory / RAM.

Do not accept cache.

Marks can be awarded in any order.

Example answers and how they were marked
Full marks3/3

Control unit, arithmetic logic unit and registers.

Why: Names three creditworthy CPU components (control unit, ALU, registers), one mark each.

Some marks2/3

Control unit, clock and main memory.

Why: Control unit (1) and clock (1) are creditworthy; main memory is not a component of the CPU, a common misconception seen in the June 2023 question.

No marks0/3

Main memory, RAM and cache.

Why: None are CPU components named in the specification; candidates often confuse main memory with CPU components.

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

4.2 Network security

Build a paper on this topic 36
Network Security Risks 18 questions Preventing Network Security Risks 18 questions

5.1 Environmental

Build a paper on this topic 36
E-waste 17 questions Manufacturing Technology 19 questions

5.2 Ethical and legal

Build a paper on this topic 18
Data Protection Act 14 questions Impact of AI 4 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.