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

Some programs can be run on different types of processor with few or no changes to the program.

Identify the term used to describe a programming language that can be used on different types of processor with few or no changes to the program.

[1 mark]
  • AMachine independent
  • BLow level
  • CObject code
  • DProcessor specific
Mark scheme
  • A Machine independent (1)
  • The only correct answer is A. The correct answer is machine independent.
  • B is not correct because low-level languages are processor specific, so their programs cannot easily be moved to another processor
  • C is not correct because object code is the machine code output produced by a translator
  • D is not correct because processor specific describes code that only runs on one type of processor
Example answers and how they were marked
Full marks1/1

A Machine independent

Why: Correct option: a machine independent language allows the same program to run on different types of processor (1).

No marks0/1

D Processor specific

Why: Near miss: processor specific is the opposite, meaning the code only runs on one type of processor, so no mark is awarded.

No marks0/1

B Low level

Why: Misconception: low-level languages are not portable between processors, so no mark.

2Describe2 marksLow and High Level Languages Swap Remove

A programmer writes a program in a high-level language.

Describe why the program can be run on computers with different processors.

[2 marks]
Mark scheme

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

  • The same source code can be run on different types/makes of processor (1) with few or no changes being made to the program (1)
  • A compiler/interpreter is available for each type of processor (1) to translate the source code into the machine code for that processor (1)
  • The statements are not tied to one processor's instruction set (1) so the program is portable between different computers (1)

Do not accept 'it is translated by a compiler' on its own.

Do not accept 'the program does not need to be translated' or 'it is easier to use'.

Example answers and how they were marked
Full marks2/2

A compiler exists for each type of processor to translate the source code into the machine code for that processor.

Why: Names the translator for each processor (1) and links it to producing that processor's machine code (1).

Some marks1/2

The same program can be run on different computers.

Why: States that the same code runs on different machines (1) but does not develop it by saying that few or no changes are needed.

No marks0/2

Because it is translated by a compiler.

Why: A compiler on its own does not explain machine independence; the answer does not say that a translator exists for each type of processor.

3Explain2 marksTranslators Swap Remove

An interpreter translates and executes high-level code.

Explain why an interpreted program must be translated again each time it is run.

[2 marks]
Mark scheme

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

  • No object code/machine code file is stored/saved (1) so there is no translated program to run on the next occasion (1)
  • The translation is only temporary/is lost when the program ends (1) because each line is translated as the program runs (1)
  • No executable file is created/saved (1) so the whole program has to be translated again every time it is run (1)
  • The interpreter translates each line while the program is running (1) so nothing is kept that could be run without the interpreter (1)

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

Do not accept 'it is interpreted' or 'it is not compiled' without saying that no object code/executable is stored/saved.

Do not accept 'the source code is high-level so it must be translated' or 'the source code has to be turned into machine code' on its own, as this is true of any translation.

Do not accept answers about the source code being deleted.

Example answers and how they were marked
Full marks2/2

The interpreter does not store an object code file, so there is no machine code file to run on the next occasion.

Why: No object code stored (1) linked to no translated program for the next run (1).

Some marks1/2

No object code is saved.

Why: Point that nothing is stored (1) but no linked reason saying why this means the program must be translated again.

No marks0/2

It has to be translated again because the interpreter deletes the source code after each run.

Why: Incorrect: the interpreter does not delete the source code; no mark scheme point.

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.