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 text file stores each character using 7-bit ASCII.

Identify the denary ASCII code for the space character.

[1 mark]
  • A32
  • B33
  • C48
  • D65
Mark scheme
  • A 32 (1)
  • The only correct answer is A. The correct answer is 32.
  • B is not correct because 33 is the ASCII code for the exclamation mark (!)
  • C is not correct because 48 is the ASCII code for the character 0
  • D is not correct because 65 is the ASCII code for the uppercase letter A
Example answers and how they were marked
Full marks1/1

A 32

Why: Correct option: the space character has the ASCII code 32 (1).

No marks0/1

C 48

Why: Near miss scoring 0: 48 is the ASCII code for the character 0, not the space character.

No marks0/1

D 65

Why: Misconception scoring 0: 65 is the ASCII code for the uppercase letter A, so a well-known code is given but not the code for a space.

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

4Short recall1 markImages Swap Remove

Each pixel in a bitmap image is stored using a number of bits.

Define the term colour depth.

[1 mark]
Mark scheme

Award one mark for any of the following:

  • The number of bits per pixel (1)
  • The number of bits used to represent/store the colour of each pixel (1)

Allow bit depth

Do not accept the number of colours a pixel can have on its own

Do not accept the number of pixels in the image (this is the resolution/image size)

Example answers and how they were marked
Full marks1/1

The number of bits used to store the colour of one pixel.

Why: Gives the number of bits per pixel (1)

No marks0/1

The number of colours that each pixel can use.

Why: Gives the number of colours, not the number of bits; the mark scheme does not accept this on its own

No marks0/1

The number of pixels in the image.

Why: Confuses colour depth with resolution/image size, which the mark scheme does not accept

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.