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 markCharacter Sets Swap Remove

A new character set must be able to represent 70 different characters.

Identify the minimum number of bits needed to represent each character.

[1 mark]
  • A6
  • B7
  • C8
  • D70
Mark scheme
  • B 7 (1)
  • The only correct answer is B. The correct answer is 7.
  • A is not correct because 6 bits give only 64 combinations, which is not enough for 70 characters
  • C is not correct because 7 bits already give 128 combinations, so 8 bits is not the minimum needed
  • D is not correct because 70 is the number of characters needed, not a number of bits
Example answers and how they were marked
Full marks1/1

B 7

Why: The only correct answer: 7 bits give 128 combinations, enough for 70 characters, and it is the smallest number of bits that does (1).

No marks0/1

C 8

Why: Distractor, no credit: a single-tick item has no partial credit, and 8 bits is not the minimum because 7 bits already give 128 combinations, so the scheme's C line gives no mark.

No marks0/1

A 6

Why: Misconception, no credit: 6 bits give only 64 combinations, which cannot represent 70 different characters, so the scheme's A line gives no mark.

2Short recall1 markCharacter Sets Swap Remove

A computer can store a maximum of 80 bits for a text message. Each character is stored using 7-bit ASCII.

State the maximum number of whole characters that can be stored in the message.

[1 mark]
Mark scheme

Award one mark for:

  • 11 (characters) (1)

Allow 11 remainder 3.

Allow 80 ÷ 7 = 11.428... rounded down to 11.

Do not accept 11.4 or 12 (rounding up or giving a decimal answer).

Do not award an unevaluated calculation such as 80 ÷ 7 with no answer.

Example answers and how they were marked
Full marks1/1

11

Why: Correct: 80 ÷ 7 = 11 remainder 3, so 11 whole characters can be stored (1).

No marks0/1

11.4

Why: Near miss: gives a decimal result rather than the number of whole characters; the mark scheme does not accept 11.4.

No marks0/1

12

Why: Rounds up to 12, but 12 characters would need 84 bits, more than the 80 available; the mark scheme does not accept 12.

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

4Describe2 marksSound Swap Remove

Sound is converted into binary using a limited bit depth.

Describe one limitation of representing a sound sample with a limited bit depth.

[2 marks]
Mark scheme

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

  • Only a fixed number of amplitude values/levels can be represented (1) so the amplitude is rounded to the nearest available value/level (1)
  • Fewer amplitude values/levels are available to choose from (1) so similar/close amplitudes cannot be stored as different values (1)
  • The exact amplitude often falls between available values/levels (1) so the stored amplitude is not exact/less accurate (1)

Answers must relate to the number of bits per sample (bit depth) and the amplitude values/levels it can represent.

Do not accept answers about the sample rate, sample interval or the number of samples taken, or that confuse bit depth with the number of samples.

Do not award 'lower quality'/'more detail'/'less detail' unless it is linked to the number of amplitude values/levels.

Do not accept 'the sound cannot be played/stored' without a linked limitation.

Example answers and how they were marked
Full marks2/2

Only a fixed number of amplitude values can be represented, so the amplitude is rounded to the nearest available value and some detail is lost.

Why: Linked points: fixed number of amplitude values (1) and rounding to the nearest available value (1).

Some marks1/2

Only a fixed number of amplitude values can be represented.

Why: Gives the first linked point only (1); it does not develop what this limitation leads to.

No marks0/2

A lower bit depth means fewer samples are taken, so parts of the sound are missed.

Why: Confuses bit depth with the number of samples/sample rate; no creditworthy point about amplitude values is given.

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.