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

Pick again
Print
1Multiple choice1 markCompression Swap Remove

Identify the definition of lossy compression.

[1 mark]
  • AData is removed only while the file is being transmitted
  • BData is permanently removed to reduce the file size
  • CData is restored exactly when it is decompressed
  • DData is stored using a dictionary of repeated patterns
Mark scheme
  • B Data is permanently removed to reduce the file size (1)
  • The only correct answer is B. The correct answer is data is permanently removed to reduce the file size.
  • A is not correct because the data removed by a lossy algorithm is not restored after transmission
  • C is not correct because that describes lossless compression, where the original file is rebuilt exactly
  • D is not correct because dictionary encoding is a lossless method that records repeated patterns once
Example answers and how they were marked
Full marks1/1

B Data is permanently removed to reduce the file size

Why: Correct option (1).

No marks0/1

C Data is restored exactly when it is decompressed

Why: Near miss: this describes lossless compression, so no mark.

No marks0/1

A Data is removed only while the file is being transmitted

Why: Misconception that compression only applies during transmission; the data is removed permanently, so no mark.

2Describe2 marksFile Management Swap Remove

A user saves a new file into a folder that already contains files.

Describe how the operating system prevents a new file overwriting an existing file.

[2 marks]
Mark scheme

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

  • Checks/compares the new file (name)/filename against the names of files already in the folder/directory (1) to see if the name is already in use (1)
  • Refuses to save/allow the new file when the (file) name already exists (1) so the existing file is not replaced/overwritten (1)
  • Prompts/asks the user to choose/enter a different (file) name (1) so both files can be saved without one replacing the other (1)

A point without a linked development can earn one mark.

For both marks, the development must follow/associate with the point.

Do not accept responses about defragmentation.

Do not accept the operating system making a backup copy, or warning the user that a file may be overwritten, without saying that the (file) name is checked or the new file is not saved.

Do not accept responses about process management or saving files to RAM.

Do not award a second mark for repeating the question, e.g. 'it stops the new file overwriting the existing file'.

Example answers and how they were marked
Full marks2/2

It checks the new file name against the names of files already in the folder to see whether the name is already in use.

Why: Linked point (1) and development (1).

Some marks1/2

It checks the file name against the names already in the folder.

Why: Creditworthy point (1) on its own; no linked development, so one mark.

No marks0/2

It defragments the disk so there is room for the new file.

Why: Defragmentation is not accepted by the mark scheme.

3Discuss6 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.