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 markImages Swap Remove

Identify the smallest identifiable area of a bitmap image.

[1 mark]
  • AColour depth
  • BFile size
  • CPixel
  • DResolution
Mark scheme
  • C Pixel (1)
  • The only correct answer is C. The correct answer is pixel.
  • A is not correct because colour depth is the number of bits used to store the colour of each pixel
  • B is not correct because file size is the amount of storage an image takes up, not an area of the image
  • D is not correct because resolution is a measure of the number of pixels in an image (such as its width × height), not the smallest identifiable area
Example answers and how they were marked
Full marks1/1

C Pixel

Why: Correct option; a pixel is the smallest identifiable area of a bitmap image (1).

No marks0/1

D Resolution

Why: Resolution is a measure of the number of pixels in an image, not the smallest identifiable area; no mark.

No marks0/1

A Colour depth

Why: Colour depth is the number of bits used to store each pixel's colour, not the smallest identifiable area; no mark.

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

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

4Describe2 marksCharacter Sets Swap Remove

A computer uses 7-bit ASCII to represent characters.

The character M has the ASCII code 77. Describe how the character M is represented in the computer.

[2 marks]
Mark scheme

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

  • The denary code 77 is converted to binary (1) to give the 7-bit pattern 1001101 (1)
  • The character M is represented by a unique ASCII code/number (1) that is stored as a 7-bit binary pattern (1)
  • 7 bits are used to store the code for M (1) so 128 different characters can be represented (1)
  • The binary pattern 1001101 is stored in memory (1) using one 7-bit code for each character (1)

Do not accept answers that only state the ASCII code 77, as this is given in the question.

Do not accept 01001101, as this is an 8-bit pattern.

Do not accept ASCII described as a programming language or a method of encryption.

Example answers and how they were marked
Full marks2/2

77 is converted to binary, giving 1001101. This is stored using 7 bits for the character M.

Why: Linked description: converts the code to binary (1) to give the 7-bit pattern 1001101 (1).

Some marks1/2

77 is changed into binary so it can be stored.

Why: Gives the conversion of 77 to binary (1) but does not give the 7-bit pattern 1001101 (0).

No marks0/2

ASCII is a programming language that stores letters as numbers.

Why: Describes ASCII as a programming language, which the mark scheme says is not creditworthy; no linked description of how M is represented.

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.