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

4 questions · 7 marks

Pick again
Print
1Multiple choice1 markFetch Decode Execute Cycle Swap Remove

Identify the CPU component that decodes instructions during the fetch-decode-execute cycle.

[1 mark]
  • AArithmetic logic unit
  • BControl unit
  • CMain memory
  • DRegister
Mark scheme
  • B Control unit (1)
  • The only correct answer is B. The correct answer is control unit.
  • A is not correct because the arithmetic logic unit performs arithmetic and logical operations, not decoding
  • C is not correct because main memory stores instructions and data, not decoding
  • D is not correct because a register holds data or addresses temporarily, not decoding
Example answers and how they were marked
Full marks1/1

B Control unit

Why: Correct option: the control unit decodes instructions (1).

No marks0/1

D Register

Why: Near-miss: a register holds data or addresses temporarily, it does not decode instructions (0).

No marks0/1

A Arithmetic logic unit

Why: Misconception: the arithmetic logic unit performs arithmetic and logical operations; it does not decode (0).

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.

3Describe2 marksTranslators Swap Remove

High-level code can be translated by a compiler or by an interpreter.

Describe how a compiler translates high-level code differently from an interpreter.

[2 marks]
Mark scheme

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

  • The compiler translates the whole program/complete source code in one go (1) whereas the interpreter translates one line/statement at a time (1)
  • The compiler translates all of the source code before any of it is run/executed (1) but the interpreter translates each line/statement as it reads it (1)
  • The interpreter translates one line/statement at a time (1) and the compiler translates the whole program/source code together (1)

Accept the compiler point and the interpreter point in either order.

Do not accept responses about object code/executable files, when the translated code is executed, how errors are reported, or speed/memory use.

Do not accept 'the interpreter executes/runs each line' on its own, without saying that it translates one line/statement at a time.

Example answers and how they were marked
Full marks2/2

A compiler translates the whole program in one go, while an interpreter translates one line at a time.

Why: Whole program translated in one go (1) and interpreter translates one line at a time (1).

Some marks1/2

A compiler translates the whole program in one go.

Why: Whole program translated in one go (1); no linked point about the interpreter translating a line at a time.

No marks0/2

A compiler produces an executable file, but an interpreter does not.

Why: Describes the output, not the amount translated at a time; object code/executable files are not accepted.

4Calculate3 marksAdding Binary Numbers Swap Remove

Computers manipulate binary patterns.

(a)

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

[2 marks]
1286432168421
10111001
10111100
Mark scheme

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

  • 0111 (1)
  • 0101 (1)

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

Ignore a carry shown beyond the eighth bit.

Example answers and how they were marked
Full marks2/2

0111 0101

Why: 185 + 188 = 373, which needs 9 bits; the 8 bits that are kept are both correct (2).

Some marks1/2

0000 0101

Why: Forgets to carry the 1s. The second nibble is correct (1); the first is not.

No marks0/2

1011 1101

Why: Never carries. Neither nibble is correct.

(b)

State the name of the error that occurs when this addition is carried out.

[1 mark]
Mark scheme

Award one mark for:

  • overflow (error) (1)
Example answers and how they were marked
Full marks1/1

Overflow

Why: The result needs more bits than are available (1).

No marks0/1

Underflow

Why: A near miss: the result is too big for 8 bits, not too small.

No marks0/1

A syntax error

Why: A syntax error is a mistake in a program's code, not in arithmetic.

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.