Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

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

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 30
Malware 18 questions Social Engineering 12 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.