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

3Explain2 marksCharacter Sets Swap Remove

A computer system uses a 4-bit code to represent the characters typed on its keyboard.

Explain one limitation of using 4 bits to represent characters.

[2 marks]
Mark scheme

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

  • Only 16 different characters can be represented (1) so there are not enough characters codes for every letter of the alphabet (1)
  • 4 bits give only 16 different combinations (1) which is not enough for the uppercase letters, lowercase letters, digits and symbols on a keyboard (1)
  • More than 16 characters are needed on a keyboard (1) so some letters, digits or symbols cannot be represented (1)
  • The number of character codes available is limited to 16 (1) because 4 bits give 2 to the power of 4 combinations (1)

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

Calculating that 4 bits give 2 to the power of 4 = 16 combinations can earn either the point or the linked reason, provided the other half of the answer says what this means (too few characters/codes).

Allow an expansion that names only the letters of the alphabet, e.g. there are not enough character codes for the 26 letters (1).

Do not accept '4 bits can only store 4 characters' (the number of bits is not the number of characters).

Do not accept 'it can only store 16 bits' (16 is the number of character codes/combinations, not the number of bits).

Do not accept 'not enough memory/storage' (the limitation is the number of character codes, not the amount of storage).

Do not accept 'it is limited/smaller' without saying how many characters/codes are available or what cannot be represented.

Example answers and how they were marked
Full marks2/2

Only 16 different characters can be represented, so there are not enough character codes for all 26 letters.

Why: Gives the point that only 16 characters can be represented (1) and links it to the reason that this is fewer than the letters needed (1).

Some marks1/2

Only 16 different characters can be represented.

Why: Gives the point that only 16 characters can be represented (1) but does not explain what cannot be represented.

No marks0/2

It can only store 4 characters because there are 4 bits.

Why: Misconception that the number of bits equals the number of characters, which the mark scheme says not to accept; no creditworthy point.

4Discuss6 marksImages Swap Remove

A school is creating a small logo to display on its website. The logo is stored as a bitmap image. Each pixel in the logo is stored as a binary value.

Discuss how the bitmap image of the logo is represented in binary.

Your answer should include:

  • pixels
  • binary values
  • the grid of pixels.
[6 marks]
Mark scheme

Indicative content

Pixels

  • A bitmap image is made up of picture elements, called pixels.
  • Each pixel is the smallest identifiable area of the image and has a single colour.
  • The logo is stored as a grid of pixels, and its width and height in pixels give its dimensions.
  • Each pixel is stored separately, so a larger grid needs more pixel values to be stored.

Binary values

  • Each pixel's colour is represented by a binary value.
  • The number of bits used for each pixel is the colour depth.
  • With n bits per pixel there are 2^n different binary values, so 2^n possible colours.
  • A black-and-white image can use one bit per pixel, with 0 for white and 1 for black.
  • More bits per pixel allow more colours to be represented in the logo.

Grid

  • The binary values are stored in order, row by row, so the computer can rebuild the grid.
  • The resolution is the number of pixels in the image, for example width × height.
  • A higher-resolution grid stores more pixels, so the logo can show more detail.
  • The image file stores the pixel values and data such as the image dimensions.

Levels

  • Level 0 (0 marks): No rewardable content.
  • Level 1 (1–2 marks): Basic, independent points are made, showing elements of understanding of key concepts/principles of computer science. (AO1) The discussion will contain basic information with little linkage between points made or application to the context. (AO2)
  • Level 2 (3–4 marks): Demonstrates adequate understanding of key concepts/principles of computer science. (AO1) The discussion shows some linkages and lines of reasoning with some structure and application to the context. (AO2)
  • Level 3 (5–6 marks): Demonstrates comprehensive understanding of key concepts/principles of computer science to support the discussion being presented. (AO1) The discussion is well developed, with sustained lines of reasoning that are coherent and logically structured, and which clearly apply to the context. (AO2)

Level 3 responses must cover both pixels and binary values.

Do not accept resolution as the number of colours.

Example answers and how they were marked
Full marks6/6

A bitmap is a grid of pixels. Each pixel is one small area of the logo and has a single colour. The width and height of the grid are measured in pixels, so the logo's dimensions tell us how many pixels it contains. Each pixel's colour is stored as a binary value. The number of bits used for each pixel is the colour depth, and with n bits there are 2^n possible values, so 2^n possible colours. For example, 3 bits per pixel would allow 8 colours. The binary values are stored row by row so that the computer can rebuild the grid. A larger grid stores more pixel values, but it can show more detail. More bits per pixel let the logo use more colours, such as the school's colours.

Why: Covers pixels as the smallest areas of a grid (AO1), binary values with colour depth and 2^n colours (AO1), and applies these to the logo's grid and colours (AO2). Sustained and structured, so Level 3.

Some marks4/6

A bitmap is a grid of pixels. Each pixel is a small square with one colour. Each pixel is stored as a binary value. The logo needs a binary value for every pixel, so a bigger logo has more values. More bits per pixel means more colours.

Why: Gives pixels and binary values, with a simple link to the logo's size. Points are mostly independent and not developed into a full discussion, so Level 2.

Some marks1/6

A bitmap image is a grid of pixels. Resolution is the number of colours in the image. Each pixel is stored as a letter, so the logo can use any colour.

Why: One basic point: a bitmap is a grid of pixels. The rest is incorrect: resolution is not the number of colours, and pixel values are stored as binary, not letters.

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.