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

Pick again
Print
1Short 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.

2Describe2 marksMemory Management Swap Remove

The operating system is held in main memory while the computer is running.

Describe how the operating system stops a running program from overwriting memory that is not its own.

[2 marks]
Mark scheme

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

  • It keeps a record of which memory addresses/areas belong to each program and to the operating system (1) so it knows which addresses a program is allowed to use (1)
  • Each program is given its own area of main memory (1) so a program cannot write to the addresses used by another program or by the operating system (1)
  • The memory used by the operating system is marked as protected/reserved (1) so a program that tries to write to it is blocked/causes an error (1)
  • The address a program writes to is checked against the record of its allocated area (1) and the write is stopped if the address is outside that area (1)

Allow the memory being protected to be that of the operating system or of another program.

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

Do not award generic answers such as 'the operating system manages memory' or 'the operating system keeps track of memory'.

Do not award responses about stopping programs using too much memory or allocating memory, as these are not about protecting memory being overwritten.

Do not award responses about virtual memory, paging or moving processes to secondary storage.

Do not award responses about firewalls, antivirus software or passwords.

Example answers and how they were marked
Full marks2/2

The operating system gives each program its own area of main memory so that a program cannot write to the addresses used by another program or by the operating system.

Why: Each program is given its own area of main memory (1) linked to it not being able to write to the addresses used by another program or the operating system (1).

Some marks1/2

The operating system gives each program its own area of main memory.

Why: Each program is given its own area of main memory (1), but there is no linked development saying how this stops a program overwriting memory that is not its own.

No marks0/2

The operating system stops a program overwriting memory by moving it into virtual memory when it uses too much.

Why: This describes virtual memory and limiting how much memory a program uses, not protecting memory from being overwritten, so neither bullet applies and the Do not award lines rule it out.

3Calculate3 marksAdding Binary Numbers Swap Remove

Binary patterns can represent numbers.

(a)

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

[2 marks]
1286432168421
11011011
11011100
Mark scheme

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

  • 1011 (1)
  • 0111 (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

1011 0111

Why: 219 + 220 = 439, which needs 9 bits; the 8 bits that are kept are both correct (2).

Some marks1/2

0000 0111

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

No marks0/2

1101 1111

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.