Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 693 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 markLow and High Level Languages Swap Remove

Programming languages can be either high-level or low-level.

Identify the low-level programming language.

[1 mark]
  • AAssembly language
  • BC#
  • CJava
  • DPython
Mark scheme
  • A Assembly language (1)
  • The only correct answer is A. The correct answer is assembly language.
  • B is not correct because C# is a high-level language
  • C is not correct because Java is a high-level language
  • D is not correct because Python is a high-level language
Example answers and how they were marked
Full marks1/1

A Assembly language

Why: Correct option: assembly language uses mnemonics and is a low-level language (1).

No marks0/1

D Python

Why: Near miss: Python is a high-level language, so no mark is awarded.

No marks0/1

C Java

Why: Misconception: Java is a high-level language because it uses statements that look like English, so no mark.

2Explain2 marksLow and High Level Languages Swap Remove

Device drivers are programs that allow the operating system to communicate with hardware.

Explain one reason why a device driver is often written in a low-level language.

[2 marks]
Mark scheme

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

  • The programmer can control/manipulate the hardware directly (1) because low-level instructions can access registers/memory addresses/hardware features (1)
  • The code can be made to work efficiently with a specific device (1) because low-level languages are processor/chipset specific, so the instructions match that hardware (1)
  • The code produced is fast to execute (1) because it is optimised for the specific processor/uses few instructions (1)
  • The code produced is small (1) so it fits in the limited memory/ROM available in the device (1)

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

Fast execution and small code size are typical advantages of low-level languages; award them only where the linked reason relates to the device.

Do not accept 'it is easier to write/learn/understand' or 'it is faster to write' as a point or as the expansion, because low-level languages are not easier for these.

Do not accept 'it is close to the hardware' or 'it works with hardware' without expansion of what that allows the program to do.

Do not accept 'because it is low-level' as the expansion; the answer must say what the language/hardware allows.

Example answers and how they were marked
Full marks2/2

It can control the hardware directly because the instructions can read and write to the device's registers and memory addresses.

Why: Linked point (1) of direct hardware control and reason (1) that low-level instructions access registers and memory addresses.

Some marks1/2

It runs quickly because it is a low-level language.

Why: Point (1) of fast execution, but 'because it is a low-level language' is not accepted as the linked reason.

No marks0/2

Because it is easier to write programs for a particular device.

Why: Misconception that low-level languages are easier to write; no creditworthy point or linked reason about hardware control or efficiency.

3Explain2 marksTranslators Swap Remove

A program can be translated by a compiler or by an interpreter.

Explain why a compiled program usually runs faster than an interpreted program.

[2 marks]
Mark scheme

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

  • The compiler translates the whole program into machine code before it is run (1) so no translation is needed while the program is executing (1)
  • The machine code/object code is already produced before execution (1) so the CPU can carry out the instructions directly without translating them (1)
  • The compiled program does not need an interpreter at run time (1) so no time is spent translating each line before it is executed (1)

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

A statement that translation happens before execution, with no linked reason for faster running, earns 1 mark only.

Do not accept 'faster to run' or 'quicker' on its own without a reason linked to translation before/during execution.

Do not accept 'compiled code is optimised' or 'compilation takes less time' without linking this to translation before execution/at run time.

Do not accept answers about the compiler being installed or available.

The question asks why a compiled program usually runs faster, so answers must refer to when translation happens, not just general performance claims.

Example answers and how they were marked
Full marks2/2

The compiler translates the whole program into machine code before it is run, so the CPU does not have to translate each line during execution.

Why: Translation before execution (1) linked to no translation needed during the run, so faster (1).

Some marks1/2

The compiler translates the whole program first.

Why: Pre-translation point (1) but no link to faster running.

No marks0/2

A compiled program runs faster because the compiler is installed on the computer.

Why: Compiler being installed does not make execution faster; no credit.

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 71
Data Protection Act 17 questions Impact of AI 18 questions Intellectual Property 18 questions Software Licences 18 questions

5.3 Cybersecurity

Build a paper on this topic 36
Malware 18 questions Social Engineering 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.