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

2Describe2 marksCharacter Sets Swap Remove

A computer uses 7-bit ASCII to represent characters.

The character M has the ASCII code 77. Describe how the character M is represented in the computer.

[2 marks]
Mark scheme

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

  • The denary code 77 is converted to binary (1) to give the 7-bit pattern 1001101 (1)
  • The character M is represented by a unique ASCII code/number (1) that is stored as a 7-bit binary pattern (1)
  • 7 bits are used to store the code for M (1) so 128 different characters can be represented (1)
  • The binary pattern 1001101 is stored in memory (1) using one 7-bit code for each character (1)

Do not accept answers that only state the ASCII code 77, as this is given in the question.

Do not accept 01001101, as this is an 8-bit pattern.

Do not accept ASCII described as a programming language or a method of encryption.

Example answers and how they were marked
Full marks2/2

77 is converted to binary, giving 1001101. This is stored using 7 bits for the character M.

Why: Linked description: converts the code to binary (1) to give the 7-bit pattern 1001101 (1).

Some marks1/2

77 is changed into binary so it can be stored.

Why: Gives the conversion of 77 to binary (1) but does not give the 7-bit pattern 1001101 (0).

No marks0/2

ASCII is a programming language that stores letters as numbers.

Why: Describes ASCII as a programming language, which the mark scheme says is not creditworthy; no linked description of how M is represented.

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