Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 687 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 · 5 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.

2Multiple choice1 markCompression Swap Remove

A student downloads a compressed music file and then decompresses it.

Identify what is meant by decompression.

[1 mark]
  • AData is encrypted so that it cannot be read
  • BData is permanently removed to reduce the file size
  • CData is restored to its original format
  • DData is stored using fewer bits
Mark scheme
  • C Data is restored to its original format (1)
  • The only correct answer is C. The correct answer is data is restored to its original format.
  • A is not correct because encryption changes data so that it cannot be read without a key; it does not restore the data
  • B is not correct because permanently removing data to reduce the file size is lossy compression, not decompression
  • D is not correct because storing data using fewer bits is compression, not decompression
Example answers and how they were marked
Full marks1/1

C Data is restored to its original format

Why: Correct option (1).

No marks0/1

D Data is stored using fewer bits

Why: Near miss: this describes compression, not decompression.

No marks0/1

B Data is permanently removed to reduce the file size

Why: Misconception: this describes lossy compression, not decompression.

3Short recall1 markUnits & Conversion Swap Remove

A file has a size of 2 kibibytes.

State the number of bytes in the file.

[1 mark]
Mark scheme

Award one mark for:

  • 2048 (1)
  • 2 × 1024 (1)
  • 2^11 (1)

Allow 2048 bytes.

Do not accept 2000, which is the number of bytes in two decimal kilobytes.

Do not accept 1024, which is the number of bytes in one kibibyte.

Do not accept 16, which is the number of bits in two bytes.

Example answers and how they were marked
Full marks1/1

2048

Why: 2048 is 2 × 1024, the number of bytes in 2 kibibytes (1).

No marks0/1

2000

Why: 2000 uses the decimal kilobyte, not the binary kibibyte; the mark scheme does not accept it.

No marks0/1

16

Why: 16 is the number of bits in two bytes, confusing bits with bytes; the mark scheme does not accept it.

4Describe2 marksCompression Swap Remove

A school compresses its text documents before backing them up.

Describe how lossless compression reduces the size of a text file.

[2 marks]
Mark scheme

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

  • Repeated words/patterns are found (1) and stored once in a dictionary with a code (1)
  • Each repeated word/pattern is replaced by a shorter code (1) so fewer bits are needed to store the text (1)
  • No data is removed (1) so the original text can be recreated exactly (1)
  • The compressed file is smaller (1) but all the original characters can still be restored (1)

Do not accept answers that say data is permanently removed or quality is reduced.

Example answers and how they were marked
Full marks2/2

It finds repeated words in the document and stores them once in a dictionary with a code.

Why: Linked point: repeated words found (1) and development: stored once in a dictionary (1).

Some marks1/2

It makes the file smaller without losing any of the data.

Why: States that no data is lost (1); no linked method or exact restoration is given (1).

No marks0/2

It removes repeated characters permanently so the file takes up less space.

Why: Describes permanent removal, which is lossy, not lossless; no credit.

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 30
Malware 18 questions Social Engineering 12 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.