Menu

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

3 questions · 6 marks

Pick again
Print
1Short recall2 marksCharacter Sets Swap Remove

ASCII is a character set that uses 7 bits to represent each character.

Give two limitations of 7-bit ASCII when it is used to represent text.

[2 marks]
Mark scheme

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

  • (Only) 128 different characters can be represented / 7 bits give 2^7 = 128 different codes (1)
  • It cannot represent characters from languages other than English / non-English alphabets, e.g. Greek, Chinese (1)
  • It cannot represent accented characters, e.g. é, ñ (1)
  • It cannot represent symbols or emoji that are not in the ASCII character set (1)

Award a maximum of one mark for the last three bullets, as they are all examples of characters that fall outside the 128 ASCII codes.

Allow 'it can only represent 128 characters, so some characters are missing' for the first bullet.

Do not accept 'it uses 7 bits' / 'it only uses 7 bits' on its own, without saying what this limits.

Do not accept 'it can only store a limited amount of text' / 'it can only store short messages', as 7 bits limits the number of characters available, not the length of a message.

Do not accept 'it can only represent the characters in the ASCII character set', as this repeats the question.

Do not accept 'it is old/out of date' or 'it cannot store numbers'.

Example answers and how they were marked
Full marks2/2

Only 128 different characters can be represented, so it cannot store characters from other languages such as Greek.

Why: 128 character limit (1) and characters from other languages (1); two separate creditworthy limitations.

Some marks1/2

It cannot show accented characters like é and it only uses 7 bits.

Why: Accented characters (1); 'only uses 7 bits' is not qualified, so scores 0.

No marks0/2

It only uses 7 bits, so it can only store a small amount of text.

Why: Scores 0: text length is not a limitation of 7-bit ASCII, and 'only uses 7 bits' is unqualified; both Do not accept lines apply.

2Short recall2 marksCompression Swap Remove

Images and sound can be stored using lossy compression.

Define the term lossy compression.

[2 marks]
Mark scheme

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

  • Reduces the size of a file (1)
  • Permanently removes/loses some data (1)
  • The original file cannot be recreated/restored exactly (1)

Allow 'some data is deleted/discarded and cannot be recovered' for the second mark.

Do not award the first mark where the response also states that no data is lost.

Do not accept 'removes repeated data' (this describes lossless compression).

Example answers and how they were marked
Full marks2/2

Lossy compression reduces the size of a file by permanently removing some data, so the original cannot be restored exactly.

Why: Reduces the size of a file (1); permanently removes some data (1); maximum two marks awarded.

Some marks1/2

It makes a file smaller.

Why: Reduces the size of a file (1); no reference to data being permanently lost.

No marks0/2

It makes a file smaller without losing any of the data.

Why: States that no data is lost, which describes lossless compression; the first mark is not awarded.

3Convert2 marksDenary to Binary Conversion Swap Remove

Binary patterns can represent numbers.

Convert the denary number 199 to 8-bit binary.

[2 marks]
Mark scheme

Award one mark for each correct nibble in the correct order:

  • 1100 (1)
  • 0111 (1)

0 marks if the response is not 8-bit binary.

Example answers and how they were marked
Full marks2/2

1100 0111

Why: 199 = 128 + 64 + 4 + 2 + 1: both nibbles are correct (2).

Some marks1/2

1100 1000

Why: Converts 200 instead (a slip in adding up the place values). The first nibble is correct (1); the second is not.

No marks0/2

1110 0011

Why: The bits are written in reverse, smallest place value first. Neither nibble is correct.

Questions by topic

More ways to revise Edexcel GCSE Computer Science (1CP2)

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.