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

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

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

Two versions of the same bitmap image are saved. The second version has a higher colour depth.

Explain why the second version may have a larger file size.

[2 marks]
Mark scheme

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

  • More binary data is stored for each pixel (1) because a higher colour depth uses more bits per pixel (1)
  • Each pixel has a longer binary code (1) so more storage is needed to hold the image (1)
  • More colours can be represented (1) so more bits are needed for each pixel (1)
  • The file contains more bits in total (1) because colour depth is the number of bits per pixel (1)

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

Allow 'more bits per pixel' for one mark.

Do not accept 'more pixels' or 'higher resolution' as the reason, because changing colour depth does not change the number of pixels.

Example answers and how they were marked
Full marks2/2

The second version stores more binary data for each pixel because a higher colour depth uses more bits per pixel.

Why: Linked point (1) and reason (1): more data per pixel because more bits per pixel.

Some marks1/2

The second version uses more bits for each pixel.

Why: One mark for identifying that more bits are stored per pixel; no linked statement about more data or file size.

No marks0/2

The second version has more pixels, so there is more data to store.

Why: A common misconception; colour depth does not change the number of pixels, so no creditworthy point is given.

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.