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

4 questions · 11 marks

Pick again
Print
1Short recall1 markTopologies Swap Remove

A bus topology uses terminators at each end of the main cable.

State the purpose of terminators in a bus topology.

[1 mark]
Mark scheme

Award one mark for:

  • Absorb signals (at the ends of the bus cable) / prevent signals reflecting (back along the cable) (1)

Allow 'stop data/signals bouncing back' for prevent signals reflecting

Do not accept 'terminate the cable' / 'close the end of the cable' on its own

Do not accept boost/repeat/strengthen the signal

Example answers and how they were marked
Full marks1/1

To absorb signals so that they do not reflect back along the bus cable.

Why: Absorbing signals and preventing reflection are alternatives within the one creditworthy point (1).

No marks0/1

To terminate the cable at each end.

Why: Near miss: this is rejected by the 'terminate the cable' guidance because it does not say signals are absorbed or prevented from reflecting.

No marks0/1

To make the signal stronger at the end of the cable.

Why: Misconception: terminators absorb signals; they do not boost, repeat or strengthen them.

2Short recall2 marksImages Swap Remove

Bitmap images are stored as a grid of pixels.

Define the term pixel.

[2 marks]
Mark scheme

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

  • The smallest element/area of a bitmap image (1)
  • The smallest identifiable part of an image (1)
  • Stores/represents a single colour as a binary value (1)
  • Stores/represents a single colour using a number of bits/colour depth (1)

Allow 'picture element' for element/part in the first two bullets, but not on its own

Allow 'bit depth' for colour depth

Do not accept 'picture element'/'pixel' on its own

Do not accept 'a group of pixels' or 'a dot' on its own; allow 'dot' only when it is described as the smallest element/area of the image

Do not accept 'single colour' on its own for the second mark; it must be linked to a binary value/number of bits

Do not accept 'lots of coloured dots' (it contradicts a single colour)

Example answers and how they were marked
Full marks2/2

The smallest identifiable area of a bitmap image, which has one colour stored as a binary value.

Why: Smallest identifiable area (1) and single colour stored as a binary value (1)

Some marks1/2

The smallest part of a bitmap image, made of one colour.

Why: Smallest part (1); no credit for the second mark because the single colour is not linked to a binary value or number of bits

No marks0/2

A picture element made from lots of coloured dots.

Why: 'Picture element' on its own is not accepted and 'lots of coloured dots' contradicts a single colour

3Describe2 marksLow and High Level Languages Swap Remove

A program can be written in a high-level language such as Python.

Describe one characteristic of a high-level programming language.

[2 marks]
Mark scheme

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

  • Statements are written using words/phrases that look like English or maths (1) so the code is easier to read/understand/write (1)
  • One statement is translated into several machine code instructions (1) so programs are shorter to write than in a low-level language (1)
  • High-level languages provide built-in data structures such as arrays/lists/records (1) so a collection of data items can be stored and accessed under one name (1)

Do not accept responses that only give a benefit or drawback, such as 'it is easier to learn', with no characteristic.

Do not accept 'it is easier than a low-level language' without saying what the characteristic is.

Example answers and how they were marked
Full marks2/2

Statements are written using words that look like English or maths so the program is easier to read and understand.

Why: Characteristic of the statements (1) with a linked development (1).

Some marks1/2

It has built-in data structures such as arrays.

Why: A correct characteristic (1) but no development of what it allows the programmer to do.

No marks0/2

It is easier to learn than a low-level language.

Why: Gives only a benefit compared with a low-level language; no characteristic of the language itself, so no mark.

4Discuss6 marksFetch Decode Execute Cycle Swap Remove

A small robotics company is designing a new robot. The robot's computer uses von Neumann architecture. The engineers are explaining how programs are stored and run.

Discuss how the von Neumann stored program concept and main memory (RAM) are used during the fetch-decode-execute cycle.

Your answer should include:

  • what is meant by the stored program concept
  • the role of RAM in the cycle
  • why the stored program concept is useful.
[6 marks]
Mark scheme

Indicative content

Stored program concept

  • Instructions and data are stored together in the same main memory (RAM).
  • Instructions are fetched one at a time from memory and executed in sequence.
  • The program can be changed by loading different instructions into RAM.
  • The CPU can only execute instructions that are in main memory.

Role of RAM

  • RAM holds the program instructions and the data being used.
  • The address of the next instruction is held in the program counter (PC).
  • The instruction is fetched from RAM using the address bus.
  • The data bus carries the instruction from RAM to the CPU.
  • RAM is volatile, so programs are lost when power is off.
  • RAM is directly accessible by the CPU, unlike secondary storage.

Benefits

  • The same hardware can run many different programs.
  • Programs can be loaded and changed quickly.
  • No need to rewire the computer for a new task.
  • Makes general-purpose computers possible.

Levels

  • Level 0 (0 marks): No rewardable content.
  • Level 1 (1–2 marks): Basic, independent points are made, showing elements of understanding of key concepts/principles of computer science. (AO1) The discussion will contain basic information with little linkage between points made or application to the context. (AO2)
  • Level 2 (3–4 marks): Demonstrates adequate understanding of key concepts/principles of computer science. (AO1) The discussion shows some linkages and lines of reasoning with some structure and application to the context. (AO2)
  • Level 3 (5–6 marks): Demonstrates comprehensive understanding of key concepts/principles of computer science to support the discussion being presented. (AO1) The discussion is well developed, with sustained lines of reasoning that are coherent and logically structured, and which clearly apply to the context. (AO2)
Example answers and how they were marked
Full marks6/6

The von Neumann stored program concept means that both the program instructions and the data are stored together in the same main memory, RAM. During the fetch-decode-execute cycle, the CPU fetches an instruction from RAM, decodes it in the control unit, and then executes it. The program counter holds the address of the next instruction, and this address is sent along the address bus to RAM. RAM then returns the instruction along the data bus to the CPU. RAM is volatile, so it only holds the program while the robot is powered on. The stored program concept is useful because the robot's computer can run different programs without changing any hardware; new instructions can simply be loaded into RAM. This makes the computer general-purpose and flexible.

Why: Comprehensive understanding: defines stored program concept, explains RAM role with PC, address bus and data bus, applies to robot, and gives benefits. Sustained lines of reasoning. Level 3.

Some marks3/6

The stored program concept is when instructions and data are stored in RAM. The CPU fetches instructions from RAM. The program counter keeps the address of the next instruction. RAM holds the program. The benefit is that you can change the program without rewiring the computer.

Why: Adequate understanding: correct basic points about stored program concept and RAM, with some linkage, but little development or application to the robot's fetch-decode-execute cycle. Level 2.

Some marks1/6

The von Neumann stored program concept is that the CPU uses RAM to store the program. The fetch-decode-execute cycle fetches, decodes and executes. RAM is random access memory. The benefit is that it is fast.

Why: Basic independent points only; no real linkage or application to the robot. Level 1.

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.