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

A user closes a program that is running on a computer.

Describe how the operating system manages the main memory that the program was using.

[2 marks]
Mark scheme

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

  • The memory (that was) used by the program is freed/released/marked as free (1) so it can be allocated/reused by another program/process (1)
  • The operating system's memory allocation table/record (of memory in use) is updated (1) to show that the program's memory locations/blocks are now free/available (1)
  • The program's instructions/data are removed/overwritten in main memory (1) so the space they used is no longer reserved for that program (1)
  • The memory pages/blocks allocated to the program are returned to the list of free pages/blocks (1) that can be used when the next program is loaded (1)

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

Do not award two marks for the same idea described twice (e.g. the memory is freed and added to a list of free blocks); the two marks must come from two different linked descriptions.

Do not accept responses about closing the program window, stopping/terminating the program/process, saving the file or deleting the program from secondary storage/the hard disk.

Ignore statements that main memory is 'managed'/'cleaned up' with no development.

Example answers and how they were marked
Full marks2/2

The operating system updates its memory allocation table to show that the memory locations the program was using are now free, so another program can be loaded into them.

Why: The memory allocation table/record is updated (1) linked to showing the program's memory locations are now free/available (1).

Some marks1/2

The operating system frees up the memory the program was using.

Why: The memory used by the program is freed/released (1), but there is no linked development of what this allows.

No marks0/2

The operating system deletes the program from the hard disk to free up memory.

Why: This confuses main memory with secondary storage; deleting the program from secondary storage is named in the 'Do not accept' line, so no creditworthy point is made.

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.

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.