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

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

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 recall2 marksCharacter Sets Swap Remove

A computer uses a character set to represent text.

Define the term character set.

[2 marks]
Mark scheme

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

  • A set/collection of characters (1)
  • (Characters such as) letters, digits and symbols/punctuation (1)
  • Each character is represented by a unique code/binary value (1)
  • A standard set of characters so that text can be exchanged between computer systems (1)

Allow 'a list of characters that a computer can represent' for the first mark.

Do not accept a program/software that converts text into binary.

Do not accept 'a set of binary codes' on its own.

Example answers and how they were marked
Full marks2/2

A set of characters, such as letters, digits and punctuation, where each character is represented by a unique binary code.

Why: Set/collection of characters with examples (1) and each character has a unique code (1).

Some marks1/2

A set of letters and symbols that a computer can use to represent text.

Why: Awarded for the set/collection of characters (1); no creditworthy point saying each character has its own unique code (0).

No marks0/2

A program that converts the keys pressed on a keyboard into binary.

Why: Describes software that converts text, not a set of characters; the Do not accept line applies.

4Explain2 marksSound Swap Remove

Each sample of a sound wave is stored as a binary number.

Explain how increasing the bit depth affects the representation of a sound wave.

[2 marks]
Mark scheme

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

  • Each sample is stored using more bits (1) so the amplitude can be recorded more precisely (1)
  • More different amplitude values can be represented (1) because each extra bit doubles the number of possible values (1)
  • The height of the wave at each sample point is measured more accurately (1) so the digital wave is closer to the analogue wave (1)
  • The gap between the true amplitude and the stored value is smaller (1) because there are more values for the sample to be rounded to (1)

For both marks, the expansion must follow/associate with the statement.

Do not accept 'the sound is sampled more often' or 'more samples are taken per second', as these describe the sample rate, not the bit depth.

Do not accept 'the file size increases' on its own as an effect on the representation of the sound.

Example answers and how they were marked
Full marks2/2

Each sample is stored using more bits, so the amplitude at each sample point can be recorded more precisely.

Why: Point (more bits per sample) (1) with linked reason (amplitude recorded more precisely) (1).

Some marks1/2

Each sample is stored using more bits.

Why: Creditworthy point (1) but no linked effect on the accuracy of the representation, so only one mark.

No marks0/2

It takes more samples every second, so the wave is stored in more detail.

Why: Confuses bit depth with sample rate, so no mark is awarded.

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.