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

Pick again
Print
1Multiple choice1 markImages Swap Remove

Identify the term for the number of bits used to store the colour of each pixel.

[1 mark]
  • AColour depth
  • BImage size
  • CResolution
  • DStorage size
Mark scheme
  • A Colour depth (1)
  • The only correct answer is A. The correct answer is colour depth.
  • B is not correct because image size is the width and height of the image in pixels
  • C is not correct because resolution is the number of pixels per unit length, such as pixels per inch
  • D is not correct because storage size is the amount of storage the image file uses
Example answers and how they were marked
Full marks1/1

A Colour depth

Why: Correct option; colour depth is the number of bits used to store the colour of each pixel (1).

No marks0/1

B Image size

Why: Image size is the width and height of the image in pixels, not the number of bits used per pixel; no mark.

No marks0/1

D Storage size

Why: Storage size is the amount of storage the image file uses, not the colour depth; no mark.

2Short recall1 markCharacter Sets Swap Remove

ASCII uses 7 bits to store each character. A system has only 6 bits available to store each character.

State the number of different characters the system can represent.

[1 mark]
Mark scheme

Award one mark for:

  • 64 (1)
  • 2^6 (1)
  • 2 × 2 × 2 × 2 × 2 × 2 (1)

Allow 64 characters / sixty-four.

Allow 2 to the power of 6 for 2^6.

Do not accept 128, which is the number of characters that can be represented using 7 bits.

Do not accept 63, the largest value that can be represented using 6 bits, rather than the number of different characters.

Do not accept 12 (2 × 6), ie the number of bits multiplied by 2.

Example answers and how they were marked
Full marks1/1

64

Why: Correct: 2^6 = 64 different characters (1).

No marks0/1

128

Why: Scores 0: 128 is the number of characters that 7 bits can represent, not the 6 bits the system has; the Do not accept line applies.

No marks0/1

63

Why: Scores 0: 63 is the largest value 6 bits can hold, not the number of different characters; the Do not accept line applies.

3Short recall2 marksCharacter Sets Swap Remove

ASCII is a character set that uses 7 bits to represent each character.

Give two limitations of 7-bit ASCII when it is used to represent text.

[2 marks]
Mark scheme

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

  • (Only) 128 different characters can be represented / 7 bits give 2^7 = 128 different codes (1)
  • It cannot represent characters from languages other than English / non-English alphabets, e.g. Greek, Chinese (1)
  • It cannot represent accented characters, e.g. é, ñ (1)
  • It cannot represent symbols or emoji that are not in the ASCII character set (1)

Award a maximum of one mark for the last three bullets, as they are all examples of characters that fall outside the 128 ASCII codes.

Allow 'it can only represent 128 characters, so some characters are missing' for the first bullet.

Do not accept 'it uses 7 bits' / 'it only uses 7 bits' on its own, without saying what this limits.

Do not accept 'it can only store a limited amount of text' / 'it can only store short messages', as 7 bits limits the number of characters available, not the length of a message.

Do not accept 'it can only represent the characters in the ASCII character set', as this repeats the question.

Do not accept 'it is old/out of date' or 'it cannot store numbers'.

Example answers and how they were marked
Full marks2/2

Only 128 different characters can be represented, so it cannot store characters from other languages such as Greek.

Why: 128 character limit (1) and characters from other languages (1); two separate creditworthy limitations.

Some marks1/2

It cannot show accented characters like é and it only uses 7 bits.

Why: Accented characters (1); 'only uses 7 bits' is not qualified, so scores 0.

No marks0/2

It only uses 7 bits, so it can only store a small amount of text.

Why: Scores 0: text length is not a limitation of 7-bit ASCII, and 'only uses 7 bits' is unqualified; both Do not accept lines apply.

4Short recall1 markImages Swap Remove

A bitmap image uses one bit per pixel.

State the limitation this places on the number of colours in the image.

[1 mark]
Mark scheme

Award one mark for any of the following:

  • Only two different colours can be represented/stored (1)
  • Each pixel can only be one of two values (1)
  • The image can only be shown in black and white (1)

Allow answers that give the number of colours, e.g. two colours, 2 colours

Allow any pair of two colours, e.g. black and white, black and grey

Do not accept low resolution/poor quality/lower quality

Do not accept only one colour/can only show black

Do not accept 2 bits/2^1 without a statement about the number of colours that can be represented

Example answers and how they were marked
Full marks1/1

Only two colours can be represented, such as black and white.

Why: States that only two different colours can be represented (1)

No marks0/1

The image will have a low resolution.

Why: Confuses colour depth with resolution; low resolution is not accepted

No marks0/1

The image can only show black.

Why: One colour is all a single value can give; the limitation is that only two colours can be represented, so this is not accepted

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.