Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 631 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 · 8 marks

Pick again
Print
1Short recall2 marksSound Swap Remove

A sound wave is sampled and the amplitude of each sample is stored using a small number of bits.

Give two limitations of storing the sound in binary when only a small number of bits is available for each sample.

[2 marks]
Mark scheme

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

  • Only a limited/fixed number of amplitude values can be stored (1)
  • The amplitude of each sample is rounded/approximated to the nearest value that can be stored (1)
  • The recording is less accurate than the original analogue sound/does not match the analogue wave exactly (1)
  • Sounds louder than the highest amplitude that can be stored are clipped/distorted (1)
  • Sounds quieter than the lowest amplitude that can be stored cannot be represented/are lost (1)

Allow quantisation error/noise for the amplitude being rounded to the nearest value that can be stored, but do not award a second mark for the same idea

Allow a stated consequence as a separate mark only when it is a different point from the list, e.g. fewer amplitude values can be stored (1) so very quiet sounds are lost (1)

Do not accept 'lower quality'/'poorer sound' on its own; the answer must say the recording is less accurate than the original/does not match the analogue wave

Do not accept sample rate/sample interval/number of channels (stereo/mono), as these are not limited by the number of bits available for each sample

Do not accept remedies such as 'a larger bit depth would make it more accurate', as these do not describe a limitation

Do not accept answers about file size, compression or playback method

Do not accept a statement that repeats the stem, e.g. 'the sound is stored in binary using a fixed number of bits'

Example answers and how they were marked
Full marks2/2

The amplitude of each sample has to be rounded to the nearest value that can be stored, and very quiet sounds cannot be represented.

Why: Amplitude rounded to the nearest stored value (1) and quiet sounds cannot be represented (1): two different points from the list.

Some marks1/2

The recording is less accurate than the original sound.

Why: The recording is less accurate than the original analogue sound (1); a second, different limitation is not given.

No marks0/2

The sample rate is too low, so parts of the wave are missed.

Why: Sample rate is not limited by the number of bits per sample, so it is not accepted.

2Explain2 marksImages Swap Remove

Two versions of the same bitmap image are saved. The second version has a higher colour depth.

Explain why the second version may have a larger file size.

[2 marks]
Mark scheme

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

  • More binary data is stored for each pixel (1) because a higher colour depth uses more bits per pixel (1)
  • Each pixel has a longer binary code (1) so more storage is needed to hold the image (1)
  • More colours can be represented (1) so more bits are needed for each pixel (1)
  • The file contains more bits in total (1) because colour depth is the number of bits per pixel (1)

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

Allow 'more bits per pixel' for one mark.

Do not accept 'more pixels' or 'higher resolution' as the reason, because changing colour depth does not change the number of pixels.

Example answers and how they were marked
Full marks2/2

The second version stores more binary data for each pixel (1) because a higher colour depth uses more bits per pixel (1).

Why: Linked point (1) and reason (1): more data per pixel because more bits per pixel.

Some marks1/2

The second version uses more bits for each pixel.

Why: One mark for identifying that more bits are stored per pixel; no linked statement about more data or file size.

No marks0/2

The second version has more pixels, so there is more data to store.

Why: A common misconception; colour depth does not change the number of pixels, so no creditworthy point is given.

3Explain2 marksImages Swap Remove

A bitmap image uses a colour depth of 8 bits. Each pixel is stored as a binary value.

Explain how the colour of a pixel is represented in a bitmap image.

[2 marks]
Mark scheme

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

  • Each pixel is stored as a binary value/code (1) which represents/maps to a colour (1)
  • The binary value is used to look up a colour in a palette (1) so the pixel can be displayed in that colour (1)
  • A bit pattern is assigned to each colour (1) and each pixel stores the bit pattern for its colour (1)
  • The number of bits per pixel sets how many different colour codes exist (1) so each code can represent a different colour (1)

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

Do not accept 'pixels are binary' or 'the image is made of 1s and 0s' without saying a pixel's colour is represented by a binary value.

Do not accept RGB values stored as denary or hexadecimal.

Example answers and how they were marked
Full marks2/2

Each pixel stores a binary value (1); this value is used to look up the pixel's colour in a palette (1).

Why: Linked point (1) and reason (1): a binary value is stored for each pixel and maps to a colour.

Some marks1/2

A bit pattern is assigned to each colour.

Why: One mark for stating that colours have bit patterns; it does not say that each pixel stores the pattern for its colour.

No marks0/2

Each pixel stores the RGB colour as denary numbers between 0 and 255.

Why: Bitmap pixels are stored in binary, not as denary values; this common misconception earns no mark.

4Explain2 marksImages Swap Remove

An image uses a colour depth of 2 bits per pixel. The original image contains 12 different colours.

Explain why the image cannot be represented accurately at this colour depth.

[2 marks]
Mark scheme

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

  • Only 4 colours can be represented (1) because 2 bits give 2^2 = 4 possible values (1)
  • Some of the 12 colours cannot be stored (1) so they are lost/replaced with a colour that can be represented (1)
  • The image will not match the original exactly (1) because there are fewer colour codes than the number of colours needed (1)
  • Many colours will share the same binary value (1) so the image will lose colour detail (1)

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

Allow 'four colours' or '2^2'.

Do not accept 'only two colours' (confusing the number of bits with the number of values) or 'resolution is too low'.

Example answers and how they were marked
Full marks2/2

Only four colours can be represented (1) because two bits give four possible binary values (1).

Why: Linked point (1) and reason (1): 2 bits give 2^2 = 4 colour codes.

Some marks1/2

Only four colours can be represented.

Why: One mark for identifying that four colours can be represented; the linked reason about two bits giving four values is missing.

No marks0/2

Only two colours can be represented because each pixel has two bits.

Why: A common misconception: two bits give four possible values, not two, so no creditworthy point is given.

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 45
Data Protection Act 17 questions Impact of AI 16 questions Intellectual Property 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.