Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

5 questions · 8 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 markSound Swap Remove

Digital sound is made up of samples.

Define the term 'bit depth'.

[1 mark]
Mark scheme

Award one mark for:

  • The number of bits used per sample (1)

Allow bits per sample

Allow the number of bits used to record/store each sample

Do not accept the number of samples taken per second (sample rate)

Do not accept the number of bits used to store the whole sound file

Do not accept the number of levels/amplitude values a sample can take

Example answers and how they were marked
Full marks1/1

The number of bits used to record each sample.

Why: States the number of bits per sample (1).

No marks0/1

The number of samples taken each second.

Why: Defines sample rate, not bit depth; do not accept.

No marks0/1

The number of amplitude values each sample can take.

Why: Gives the number of levels/amplitude values, not the number of bits per sample; do not accept.

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

4Explain2 marksCharacter Sets Swap Remove

The ASCII code for the uppercase letter A is 65, which is stored as the 7-bit pattern 1000001.

Explain why the lowercase letter a is stored using a different 7-bit pattern.

[2 marks]
Mark scheme

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

  • The computer needs to tell/distinguish the uppercase A from the lowercase a (1) because each different character has its own unique 7-bit code/pattern (1)
  • A and a are different characters (1) so each needs a different 7-bit pattern to be stored and displayed correctly (1)
  • If A and a had the same 7-bit pattern (1) the computer could not tell which character to display (1)

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

Do not accept 'because they are different letters/cases' without saying they need different/unique codes or that the computer must tell them apart.

Do not accept 'because A is a capital letter' on its own.

Do not accept 'because the codes are different numbers' or '65 is not 97' without linking to the need to tell the characters apart or to unique codes.

Example answers and how they were marked
Full marks2/2

Each character needs its own unique code, so the computer can tell that A and a are different characters and display the right one.

Why: Gives the point that the computer must tell A and a apart (1) and links it to the reason that each character needs its own unique code (1).

Some marks1/2

The computer must be able to tell the difference between uppercase and lowercase letters.

Why: Gives the point that the computer must tell the two characters apart (1) but gives no linked reason about unique codes or different 7-bit patterns.

No marks0/2

Because A is a capital letter and a is lowercase.

Why: Only states that the letters are different cases, which the mark scheme says is not accepted without saying they need unique codes or that the computer must tell them apart.

5Explain2 marksSound Swap Remove

Each sample of a sound wave is stored in binary using a fixed number of bits.

Explain one limitation of representing an analogue sound wave in binary when only a small number of bits is available for each sample.

[2 marks]
Mark scheme

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

  • Only a limited number of different amplitude values can be stored (1) so each sample is rounded to the nearest available value and the digital wave does not match the analogue wave exactly (1)
  • The wave is continuous but only a limited set of values can be represented (1) so amplitude detail/accuracy is lost (1)
  • Quiet and loud parts of the sound may be stored as the same value (1) because there are too few values to tell them apart (1)
  • The range of amplitudes that can be represented is limited (1) so the loudest/quietest parts of the sound cannot be stored accurately (1)

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

Do not award marks for answers that say the sound cannot be stored or heard at all.

Do not award answers about the number of samples taken/sample rate, as the number of bits limits the amplitude values, not how often the wave is sampled.

Do not accept 'lower quality'/'less accurate'/'less detail' on its own without a link to the amplitude values that can be stored/the number of bit combinations.

Do not accept 'the file size is smaller' without a link to the accuracy or the range of values that can be stored.

Example answers and how they were marked
Full marks2/2

Only a small number of amplitude values can be stored, so each sample is rounded to the nearest value and does not match the original wave exactly.

Why: Point (limited number of amplitude values) (1) with linked reason (samples are rounded and the wave is not exact) (1).

Some marks1/2

Only a small number of amplitude values can be stored.

Why: Creditworthy point (1) but no linked limitation such as rounding or lost accuracy, so only one mark.

No marks0/2

The sound cannot be stored at all because there are not enough bits to hold every sample.

Why: Misconception: the sound can still be stored, just less accurately, 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 45
Data Protection Act 17 questions Impact of AI 16 questions Intellectual Property 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.