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

Pick again
Print
1Short recall2 marksFetch Decode Execute Cycle Swap Remove

Von Neumann architecture uses the stored program concept.

Define the term stored program concept.

[2 marks]
Mark scheme

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

  • Instructions/programs are held/stored in main memory (RAM) (1)
  • The data the program uses is stored in the same memory as the instructions (1)
  • Instructions are fetched (one at a time) from main memory by the CPU (1)
  • Instructions (fetched from main memory) are decoded and executed (1)

Allow 'memory' for main memory/RAM.

Do not award two marks for a single statement that only says the program/instructions are stored in memory.

Do not accept answers that state the program is stored in secondary storage (such as a hard disk).

Example answers and how they were marked
Full marks2/2

The program instructions and the data it uses are both held in main memory, and the CPU fetches each instruction from main memory in turn to decode and execute it.

Why: Instructions/programs are held/stored in main memory (RAM) (1) and the data the program uses is stored in the same memory as the instructions (1). The fetching and executing points are also present but the maximum is two marks.

Some marks1/2

The instructions of a program are stored in main memory.

Why: Instructions/programs are held/stored in main memory (RAM) (1). Only one part of the definition is given, so one mark.

No marks0/2

The program is kept on the hard disk and is loaded when it is needed.

Why: The answer places the program in secondary storage, which the mark scheme says not to accept, so no creditworthy point is given.

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 (1) to see whether the name is already in use (1).

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.

3Calculate2 marksAdding Binary Numbers Swap Remove

Binary patterns can represent numbers.

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

[2 marks]
1286432168421
10010110
01011100
Mark scheme

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

  • 1111 (1)
  • 0010 (1)

0 marks if the response is not 8-bit binary.

Example answers and how they were marked
Full marks2/2

1111 0010

Why: 150 + 92 = 242, carrying where a column adds to 2: both nibbles are correct (2).

Some marks1/2

1111 0011

Why: A slip in the last bit. The first nibble is correct (1); the second is not.

No marks0/2

1101 1110

Why: Writes 1 in every column with a 1 and never carries. Neither nibble is correct.

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.