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

3Short recall1 markImages Swap Remove

A bitmap image uses one bit per pixel.

State the limitation this places on the number of colours in the image.

[1 mark]
Mark scheme

Award one mark for any of the following:

  • Only two different colours can be represented/stored (1)
  • Each pixel can only be one of two values (1)
  • The image can only be shown in black and white (1)

Allow answers that give the number of colours, e.g. two colours, 2 colours

Allow any pair of two colours, e.g. black and white, black and grey

Do not accept low resolution/poor quality/lower quality

Do not accept only one colour/can only show black

Do not accept 2 bits/2^1 without a statement about the number of colours that can be represented

Example answers and how they were marked
Full marks1/1

Only two colours can be represented, such as black and white.

Why: States that only two different colours can be represented (1)

No marks0/1

The image will have a low resolution.

Why: Confuses colour depth with resolution; low resolution is not accepted

No marks0/1

The image can only show black.

Why: One colour is all a single value can give; the limitation is that only two colours can be represented, so this is not accepted

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.