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

3Short recall2 marksCharacter Sets Swap Remove

A computer uses a character set to represent text.

Define the term character set.

[2 marks]
Mark scheme

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

  • A set/collection of characters (1)
  • (Characters such as) letters, digits and symbols/punctuation (1)
  • Each character is represented by a unique code/binary value (1)
  • A standard set of characters so that text can be exchanged between computer systems (1)

Allow 'a list of characters that a computer can represent' for the first mark.

Do not accept a program/software that converts text into binary.

Do not accept 'a set of binary codes' on its own.

Example answers and how they were marked
Full marks2/2

A set of characters, such as letters, digits and punctuation, where each character is represented by a unique binary code.

Why: Set/collection of characters with examples (1) and each character has a unique code (1).

Some marks1/2

A set of letters and symbols that a computer can use to represent text.

Why: Awarded for the set/collection of characters (1); no creditworthy point saying each character has its own unique code (0).

No marks0/2

A program that converts the keys pressed on a keyboard into binary.

Why: Describes software that converts text, not a set of characters; the Do not accept line applies.

4Describe2 marksSound Swap Remove

Each sample of a sound is stored as a binary number.

Describe how bit depth affects the stored value of a sound sample.

[2 marks]
Mark scheme

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

  • The bit depth is the number of bits used to store each sample/measurement (1) so a higher bit depth gives more possible/discrete values for the amplitude (1)
  • A higher bit depth records the amplitude more accurately (1) because the stored value can be closer to the actual height of the wave (1)
  • A low bit depth gives fewer possible amplitude values (1) so the amplitude is rounded to the nearest value, making the recording less accurate (1)

Do not accept sample rate/sample interval (number of samples per second) in place of bit depth.

Do not accept 'more bits gives better quality' or 'more accurate' on its own, without a development linked to the number of values or the amplitude stored.

Do not accept file size on its own, and a file size point cannot earn the second mark, as it does not describe the stored value.

Example answers and how they were marked
Full marks2/2

The bit depth is the number of bits used to store each sample, so a higher bit depth gives more possible values for the amplitude that can be stored.

Why: First point, the number of bits per sample (1), then the linked development, more possible values for the amplitude (1).

Some marks1/2

The bit depth is the number of bits used to store one sample.

Why: Gives the first point, the number of bits per sample (1), but does not develop how this affects the value that is stored.

No marks0/2

A higher bit depth makes the sound better quality and more accurate.

Why: Near-miss: 'better quality' and 'more accurate' on their own, with no development linked to the number of values or the amplitude, 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.