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 · 6 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 recall2 marksImages Swap Remove

Bitmap images are stored as a grid of pixels.

Define the term pixel.

[2 marks]
Mark scheme

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

  • The smallest element/area of a bitmap image (1)
  • The smallest identifiable part of an image (1)
  • Stores/represents a single colour as a binary value (1)
  • Stores/represents a single colour using a number of bits/colour depth (1)

Allow 'picture element' for element/part in the first two bullets, but not on its own

Allow 'bit depth' for colour depth

Do not accept 'picture element'/'pixel' on its own

Do not accept 'a group of pixels' or 'a dot' on its own; allow 'dot' only when it is described as the smallest element/area of the image

Do not accept 'single colour' on its own for the second mark; it must be linked to a binary value/number of bits

Do not accept 'lots of coloured dots' (it contradicts a single colour)

Example answers and how they were marked
Full marks2/2

The smallest identifiable area of a bitmap image, which has one colour stored as a binary value.

Why: Smallest identifiable area (1) and single colour stored as a binary value (1)

Some marks1/2

The smallest part of a bitmap image, made of one colour.

Why: Smallest part (1); no credit for the second mark because the single colour is not linked to a binary value or number of bits

No marks0/2

A picture element made from lots of coloured dots.

Why: 'Picture element' on its own is not accepted and 'lots of coloured dots' contradicts a single colour

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