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

2Short recall1 markImages Swap Remove

Each pixel in a bitmap image is stored using a number of bits.

Define the term colour depth.

[1 mark]
Mark scheme

Award one mark for any of the following:

  • The number of bits per pixel (1)
  • The number of bits used to represent/store the colour of each pixel (1)

Allow bit depth

Do not accept the number of colours a pixel can have on its own

Do not accept the number of pixels in the image (this is the resolution/image size)

Example answers and how they were marked
Full marks1/1

The number of bits used to store the colour of one pixel.

Why: Gives the number of bits per pixel (1)

No marks0/1

The number of colours that each pixel can use.

Why: Gives the number of colours, not the number of bits; the mark scheme does not accept this on its own

No marks0/1

The number of pixels in the image.

Why: Confuses colour depth with resolution/image size, which the mark scheme does not accept

3Describe2 marksLow and High Level Languages Swap Remove

A programmer has written a program in assembly language.

Describe why it is necessary to translate the program into machine code before it can be run.

[2 marks]
Mark scheme

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

  • The processor/CPU can only execute machine code/binary instructions (1) so the assembly instructions must be converted into machine code before the program can run (1)
  • Each assembly instruction/mnemonic matches/corresponds to one machine code instruction (1) so each line must be replaced with the machine code the processor executes (1)
  • The program is written using mnemonics (1) that must be translated into machine code for the processor to carry out the instructions (1)
  • The hardware/processor does not understand assembly language directly (1) so it must be translated into machine code that the processor can execute (1)

Do not accept 'assembly language is a low-level language'.

Do not accept 'it is hard to understand' or 'it is not English'.

Do not accept benefits, such as 'machine code runs faster' or 'the program will run more quickly'.

Do not accept 'an assembler/a translator converts it' on its own, with no reference to the processor only being able to execute machine code/binary.

Do not accept responses about high-level languages or about compilers/interpreters.

Example answers and how they were marked
Full marks2/2

The processor can only execute machine code, so the assembly instructions must be converted into machine code before the program can run.

Why: States what the processor can execute (1) and links it to converting the program's instructions into machine code (1).

Some marks1/2

Each assembly instruction matches one machine code instruction.

Why: Correct point about the one-to-one match (1) but no development saying that this is because the processor only executes machine code.

No marks0/2

Because an assembler translates assembly language into machine code.

Why: Names the translator but gives no reason tied to the processor only being able to execute machine code, so no mark; this is in the 'Do not accept' guidance.

4Convert2 marksDenary to Binary Conversion Swap Remove

Computers manipulate binary patterns.

Convert the denary number 184 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1011 (1)
  • 1000 (1)

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

Example answers and how they were marked
Full marks2/2

1011 1000

Why: 184 = 128 + 32 + 16 + 8: both nibbles are correct (2).

Some marks1/2

1011 1001

Why: Converts 185 instead (a slip in adding up the place values). The first nibble is correct (1); the second is not.

No marks0/2

0001 1101

Why: The bits are written in reverse, smallest place value first. 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 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.