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

3 questions · 5 marks

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

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.

3Describe2 marksCharacter Sets Swap Remove

A computer uses 7-bit ASCII to store text.

Describe why 7 bits are needed to represent each character, rather than 6 bits.

[2 marks]
Mark scheme

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

  • 6 bits give only 64 different codes (1) which is fewer than the number of letters, digits and symbols that must be represented (1)
  • 7 bits give 128 different codes (1) which is enough to represent every letter, digit and symbol that is needed (1)
  • Adding a bit doubles the number of different codes from 64 to 128 (1) so that every character needed can have its own code (1)
  • There are more than 64 characters that must be represented (letters, digits and symbols) (1) so 6 bits cannot give each one a different code (1)

A statement of the number of codes without a development can earn one mark only; the development must be linked to the statement for the second mark.

Do not accept responses that only say computers use binary (1s and 0s).

Do not accept that 7 bits are needed because 7 is a bigger number than 6, with no reference to the number of codes or characters.

Do not accept responses about 8 bits, extended ASCII or Unicode.

Example answers and how they were marked
Full marks2/2

6 bits can only give 64 different codes, which is not enough for all the letters, digits and symbols that have to be represented.

Why: Gives the number of codes 6 bits can make (1) linked to the number of characters that must be represented (1).

Some marks1/2

7 bits give 128 different codes.

Why: States the number of codes available from 7 bits (1) but gives no linked development, so the second mark is not earned (0).

No marks0/2

Because computers only use binary and 7 is a bigger number than 6.

Why: Says only that computers use binary and compares the numbers, which the mark scheme tells markers not to accept; no creditworthy point about codes or characters.

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.