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

Pick again
Print
1Short 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

2Describe2 marksImages Swap Remove

A bitmap image of a logo is stored in binary.

Describe how the pixels in the logo are represented in binary, and how the number of bits available for each pixel can limit the image.

[2 marks]
Mark scheme

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

  • Each pixel is a single colour (1) that is stored/given as a binary value (1)
  • Each pixel is represented by a binary value (1) which gives/represents its colour (1)
  • The pixels are stored in order/rows (1) so the binary values can be read back to recreate the image (1)
  • Each pixel uses a fixed number of bits/colour depth (1) so only a limited number of colours can be represented (1)
  • The number of bits available for each pixel is fixed (1) so some colours cannot be stored/shown (1)

Allow '1s and 0s' for binary value.

For the first mark, accept a statement that a pixel is stored/represented by a binary value; do not award the first mark for 'grid of pixels' or 'a pixel is a single colour' alone unless it is linked to a binary value.

Do not accept 'a pixel is a small dot' alone.

Do not accept responses that only describe file size or resolution.

Example answers and how they were marked
Full marks2/2

Each pixel is a single colour and its colour is stored as a binary value. The number of bits for each pixel is fixed, so only a limited number of colours can be represented.

Why: Linked point (1) that each pixel is a single colour and development (1) that its colour is stored as a binary value; the colour-depth limitation is also creditworthy but the answer is capped at 2.

Some marks1/2

Each pixel is stored as a binary value.

Why: Point (1) that each pixel is stored as a binary value, but no linked development about the colour it represents.

No marks0/2

A bitmap image is made of lots of dots called pixels.

Why: No credit: 'a pixel is a small dot' alone is not accepted because it does not link a pixel to a binary value.

3Explain2 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 because two bits give four possible binary values.

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.

4Explain2 marksCharacter Sets Swap Remove

ASCII uses a fixed number of bits to represent each character.

Explain one reason why ASCII uses 7 bits to represent each character.

[2 marks]
Mark scheme

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

  • 7 bits give 128 different codes/combinations (1) which is enough to represent all the characters on a keyboard (1)
  • 7 bits allow 128 unique characters (1) so uppercase and lowercase letters, digits and punctuation can all be represented (1)
  • 6 bits give only 64 combinations (1) which is not enough for the number of characters on a keyboard (1)
  • A keyboard needs to represent more than 64 different characters (1) so 7 bits are needed to give the 128 combinations required (1)
  • A fixed number of 7 bits gives 128 possible codes (1) which is enough for the characters ASCII represents, so more bits are not needed (1)

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

Do not accept 'because ASCII is 7-bit' or 'because 7 bits is enough' as these repeat the question without giving the number of combinations or saying what they allow.

Do not accept '7 bits give 256 characters'; 256 combinations come from 8 bits (extended ASCII).

Allow 'ASCII has 128 characters/codes' for the 128 point.

Example answers and how they were marked
Full marks2/2

7 bits give 128 different codes, which is enough for every letter, digit and punctuation symbol on a keyboard.

Why: Gives the point that 7 bits give 128 codes (1) and links it to the reason that this is enough for all the characters on a keyboard (1).

Some marks1/2

7 bits give 128 different combinations.

Why: Gives the point that 7 bits give 128 combinations (1) but does not say what this number of combinations allows, so the linked reason (1) is not earned.

No marks0/2

Because ASCII uses 7 bits so it can store 256 characters.

Why: Repeats the question and gives the wrong number of characters (256 is 8-bit extended ASCII), so there is no creditworthy 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.