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 recall1 markSound Swap Remove

Digital sound is made up of samples.

Define the term 'bit depth'.

[1 mark]
Mark scheme

Award one mark for:

  • The number of bits used per sample (1)

Allow bits per sample

Allow the number of bits used to record/store each sample

Do not accept the number of samples taken per second (sample rate)

Do not accept the number of bits used to store the whole sound file

Do not accept the number of levels/amplitude values a sample can take

Example answers and how they were marked
Full marks1/1

The number of bits used to record each sample.

Why: States the number of bits per sample (1).

No marks0/1

The number of samples taken each second.

Why: Defines sample rate, not bit depth; do not accept.

No marks0/1

The number of amplitude values each sample can take.

Why: Gives the number of levels/amplitude values, not the number of bits per sample; do not accept.

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

4Explain2 marksImages Swap Remove

A bitmap image uses a colour depth of 8 bits. Each pixel is stored as a binary value.

Explain how the colour of a pixel is represented in a bitmap image.

[2 marks]
Mark scheme

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

  • Each pixel is stored as a binary value/code (1) which represents/maps to a colour (1)
  • The binary value is used to look up a colour in a palette (1) so the pixel can be displayed in that colour (1)
  • A bit pattern is assigned to each colour (1) and each pixel stores the bit pattern for its colour (1)
  • The number of bits per pixel sets how many different colour codes exist (1) so each code can represent a different colour (1)

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

Do not accept 'pixels are binary' or 'the image is made of 1s and 0s' without saying a pixel's colour is represented by a binary value.

Do not accept RGB values stored as denary or hexadecimal.

Example answers and how they were marked
Full marks2/2

Each pixel stores a binary value; this value is used to look up the pixel's colour in a palette.

Why: Linked point (1) and reason (1): a binary value is stored for each pixel and maps to a colour.

Some marks1/2

A bit pattern is assigned to each colour.

Why: One mark for stating that colours have bit patterns; it does not say that each pixel stores the pattern for its colour.

No marks0/2

Each pixel stores the RGB colour as denary numbers between 0 and 255.

Why: Bitmap pixels are stored in binary, not as denary values; this common misconception earns no mark.

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.