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 · 8 marks

Pick again
Print
1Short recall2 marksSound Swap Remove

A sound wave is sampled and the amplitude of each sample is stored using a small number of bits.

Give two limitations of storing the sound in binary when only a small number of bits is available for each sample.

[2 marks]
Mark scheme

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

  • Only a limited/fixed number of amplitude values can be stored (1)
  • The amplitude of each sample is rounded/approximated to the nearest value that can be stored (1)
  • The recording is less accurate than the original analogue sound/does not match the analogue wave exactly (1)
  • Sounds louder than the highest amplitude that can be stored are clipped/distorted (1)
  • Sounds quieter than the lowest amplitude that can be stored cannot be represented/are lost (1)

Allow quantisation error/noise for the amplitude being rounded to the nearest value that can be stored, but do not award a second mark for the same idea

Allow a stated consequence as a separate mark only when it is a different point from the list, e.g. fewer amplitude values can be stored (1) so very quiet sounds are lost (1)

Do not accept 'lower quality'/'poorer sound' on its own; the answer must say the recording is less accurate than the original/does not match the analogue wave

Do not accept sample rate/sample interval/number of channels (stereo/mono), as these are not limited by the number of bits available for each sample

Do not accept remedies such as 'a larger bit depth would make it more accurate', as these do not describe a limitation

Do not accept answers about file size, compression or playback method

Do not accept a statement that repeats the stem, e.g. 'the sound is stored in binary using a fixed number of bits'

Example answers and how they were marked
Full marks2/2

The amplitude of each sample has to be rounded to the nearest value that can be stored, and very quiet sounds cannot be represented.

Why: Amplitude rounded to the nearest stored value (1) and quiet sounds cannot be represented (1): two different points from the list.

Some marks1/2

The recording is less accurate than the original sound.

Why: The recording is less accurate than the original analogue sound (1); a second, different limitation is not given.

No marks0/2

The sample rate is too low, so parts of the wave are missed.

Why: Sample rate is not limited by the number of bits per sample, so it is not accepted.

2Describe2 marksCharacter Sets Swap Remove

Uppercase letters are represented in a computer using 7-bit ASCII codes.

Describe how the ASCII codes for the uppercase letters A to Z are arranged.

[2 marks]
Mark scheme

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

  • The codes run in alphabetical order/consecutively (1) so each letter has a code one more than the letter before it (1)
  • A has the code 65 and Z has the code 90 (1) so the codes for the letters in between increase by 1 each time (1)
  • The letters are stored in sequence (1) so B is A + 1, C is B + 1 and so on (1)

Accept the codes given in denary (65, 90) or as 7-bit binary (1000001, 1011010).

Do not accept 'the codes go up' or 'the codes are in order' on its own, as neither gives the step of 1 or links one letter to the next.

Do not accept 'each uppercase letter has a different code' on its own, as this does not describe the arrangement.

Example answers and how they were marked
Full marks2/2

The codes are in alphabetical order, so B is one more than A and C is one more than B.

Why: Codes are consecutive/in order (1) with the linked step of one more for each letter (1).

Some marks1/2

A is 65 and Z is 90.

Why: Gives the first half of the linked pair, the start and end codes (1), but does not give the linked development, the increase of 1 between letters (0).

No marks0/2

The ASCII codes for uppercase letters go up.

Why: 'Codes go up' on its own gives no step of 1 and no link to the next letter, so it is not creditworthy (0) under the 'Do not accept' line.

3Explain2 marksImages Swap Remove

An image uses a colour depth of 2 bits per pixel. The original image contains 12 different colours.

Explain why the image cannot be represented accurately at this colour depth.

[2 marks]
Mark scheme

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

  • Only 4 colours can be represented (1) because 2 bits give 2^2 = 4 possible values (1)
  • Some of the 12 colours cannot be stored (1) so they are lost/replaced with a colour that can be represented (1)
  • The image will not match the original exactly (1) because there are fewer colour codes than the number of colours needed (1)
  • Many colours will share the same binary value (1) so the image will lose colour detail (1)

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

Allow 'four colours' or '2^2'.

Do not accept 'only two colours' (confusing the number of bits with the number of values) or 'resolution is too low'.

Example answers and how they were marked
Full marks2/2

Only four colours can be represented because two bits give four possible binary values.

Why: Linked point (1) and reason (1): 2 bits give 2^2 = 4 colour codes.

Some marks1/2

Only four colours can be represented.

Why: One mark for identifying that four colours can be represented; the linked reason about two bits giving four values is missing.

No marks0/2

Only two colours can be represented because each pixel has two bits.

Why: A common misconception: two bits give four possible values, not two, so no creditworthy point is given.

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