Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 631 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

5 questions · 7 marks

Pick again
Print
1Multiple choice1 markCharacter Sets Swap Remove

Characters are encoded using 7-bit ASCII.

Identify the number of different characters that can be represented using 7-bit ASCII.

[1 mark]
  • A64
  • B127
  • C128
  • D256
Mark scheme
  • C 128 (1)
  • The only correct answer is C. The correct answer is 128.
  • A is not correct because 6 bits give only 64 different combinations
  • B is not correct because 127 is the largest 7-bit value, not the number of characters that 7 bits can represent
  • D is not correct because 256 characters need 8 bits, as used by 8-bit extended ASCII
Example answers and how they were marked
Full marks1/1

C 128

Why: Selects the only correct option (1): 7 bits give 2 to the power of 7, which is 128 different characters.

No marks0/1

D 256

Why: Near miss scoring 0: 256 is the number of characters that 8 bits give in extended ASCII, not 7-bit ASCII.

No marks0/1

B 127

Why: Misconception scoring 0, the off-by-one error the examiners' report describes: 127 is the largest 7-bit value, but 7 bits give 128 different characters.

2Short recall1 markSound Swap Remove

To store sound in binary, an analogue sound wave is sampled at regular intervals.

Define the term 'sample rate'.

[1 mark]
Mark scheme

Award one mark for:

  • The number of samples taken per second (1)

Allow captured/recorded for taken.

Allow 'samples per second'.

Allow 'each second' for 'per second'.

Allow Hz/hertz as the unit.

Do not accept the time between samples/sample interval.

Do not accept 'the number of samples' without a per second/time reference.

Do not accept the number of bits used per sample/bit depth.

Example answers and how they were marked
Full marks1/1

The number of samples taken per second.

Why: States samples per second (1); 'per second' is accepted.

No marks0/1

The time between each sample.

Why: Defines sample interval, not sample rate; do not accept.

No marks0/1

The number of bits used for each sample.

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

3Short recall1 markImages Swap Remove

A bitmap image has a resolution.

State what is meant by the resolution of an image.

[1 mark]
Mark scheme

Award one mark for any of the following:

  • The concentration/density of pixels in an area (1)
  • The number of pixels per inch (PPI) / pixels per unit area (1)
  • The width and height/dimensions of the image in pixels (1)

Do not accept the number of pixels in the image on its own, without dimensions or an area, e.g. 'the total number of pixels'

Do not accept colour depth / the number of bits used per pixel / the number of colours

Do not accept file size in bytes / the amount of storage the image uses / screen size / image quality

Example answers and how they were marked
Full marks1/1

The concentration of pixels in an area, such as the number of pixels per inch.

Why: Gives the density/concentration of pixels in an area, and pixels per inch (1)

No marks0/1

The number of pixels in the image.

Why: A bare total pixel count is not accepted without dimensions or an area

No marks0/1

The number of bits used to store each pixel's colour.

Why: Describes colour depth, not resolution, and colour depth is not accepted

4Describe2 marksCharacter Sets Swap Remove

A computer uses 7-bit ASCII to store text.

Describe why 7 bits are needed to represent each character, rather than 6 bits.

[2 marks]
Mark scheme

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

  • 6 bits give only 64 different codes (1) which is fewer than the number of letters, digits and symbols that must be represented (1)
  • 7 bits give 128 different codes (1) which is enough to represent every letter, digit and symbol that is needed (1)
  • Adding a bit doubles the number of different codes from 64 to 128 (1) so that every character needed can have its own code (1)
  • There are more than 64 characters that must be represented (letters, digits and symbols) (1) so 6 bits cannot give each one a different code (1)

A statement of the number of codes without a development can earn one mark only; the development must be linked to the statement for the second mark.

Do not accept responses that only say computers use binary (1s and 0s).

Do not accept that 7 bits are needed because 7 is a bigger number than 6, with no reference to the number of codes or characters.

Do not accept responses about 8 bits, extended ASCII or Unicode.

Example answers and how they were marked
Full marks2/2

6 bits can only give 64 different codes, which is not enough for all the letters, digits and symbols that have to be represented.

Why: Gives the number of codes 6 bits can make (1) linked to the number of characters that must be represented (1).

Some marks1/2

7 bits give 128 different codes.

Why: States the number of codes available from 7 bits (1) but gives no linked development, so the second mark is not earned (0).

No marks0/2

Because computers only use binary and 7 is a bigger number than 6.

Why: Says only that computers use binary and compares the numbers, which the mark scheme tells markers not to accept; no creditworthy point about codes or characters.

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

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 45
Data Protection Act 17 questions Impact of AI 16 questions Intellectual Property 12 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.