Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 659 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

5 questions · 7 marks

Pick again
Print
1Multiple choice1 markCharacter Sets Swap Remove

Characters are encoded using 7-bit ASCII.

Identify the number of different characters that can be represented using 7-bit ASCII.

[1 mark]
  • A64
  • B127
  • C128
  • D256
Mark scheme
  • C 128 (1)
  • The only correct answer is C. The correct answer is 128.
  • A is not correct because 6 bits give only 64 different combinations
  • B is not correct because 127 is the largest 7-bit value, not the number of characters that 7 bits can represent
  • D is not correct because 256 characters need 8 bits, as used by 8-bit extended ASCII
Example answers and how they were marked
Full marks1/1

C 128

Why: Selects the only correct option (1): 7 bits give 2 to the power of 7, which is 128 different characters.

No marks0/1

D 256

Why: Near miss scoring 0: 256 is the number of characters that 8 bits give in extended ASCII, not 7-bit ASCII.

No marks0/1

B 127

Why: Misconception scoring 0, the off-by-one error the examiners' report describes: 127 is the largest 7-bit value, but 7 bits give 128 different characters.

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

4Explain2 marksCharacter Sets Swap Remove

A computer system uses a 4-bit code to represent the characters typed on its keyboard.

Explain one limitation of using 4 bits to represent characters.

[2 marks]
Mark scheme

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

  • Only 16 different characters can be represented (1) so there are not enough characters codes for every letter of the alphabet (1)
  • 4 bits give only 16 different combinations (1) which is not enough for the uppercase letters, lowercase letters, digits and symbols on a keyboard (1)
  • More than 16 characters are needed on a keyboard (1) so some letters, digits or symbols cannot be represented (1)
  • The number of character codes available is limited to 16 (1) because 4 bits give 2 to the power of 4 combinations (1)

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

Calculating that 4 bits give 2 to the power of 4 = 16 combinations can earn either the point or the linked reason, provided the other half of the answer says what this means (too few characters/codes).

Allow an expansion that names only the letters of the alphabet, e.g. there are not enough character codes for the 26 letters (1).

Do not accept '4 bits can only store 4 characters' (the number of bits is not the number of characters).

Do not accept 'it can only store 16 bits' (16 is the number of character codes/combinations, not the number of bits).

Do not accept 'not enough memory/storage' (the limitation is the number of character codes, not the amount of storage).

Do not accept 'it is limited/smaller' without saying how many characters/codes are available or what cannot be represented.

Example answers and how they were marked
Full marks2/2

Only 16 different characters can be represented, so there are not enough character codes for all 26 letters.

Why: Gives the point that only 16 characters can be represented (1) and links it to the reason that this is fewer than the letters needed (1).

Some marks1/2

Only 16 different characters can be represented.

Why: Gives the point that only 16 characters can be represented (1) but does not explain what cannot be represented.

No marks0/2

It can only store 4 characters because there are 4 bits.

Why: Misconception that the number of bits equals the number of characters, which the mark scheme says not to accept; no creditworthy point.

5Explain2 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; this value is used to look up the pixel's colour in a palette.

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.

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 65
Data Protection Act 17 questions Impact of AI 18 questions Intellectual Property 18 questions Software Licences 12 questions

5.3 Cybersecurity

Malware 8 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.