Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 604 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 · 7 marks

Pick again
Print
1Multiple choice1 markCharacter Sets Swap Remove

A new character set must be able to represent 70 different characters.

Identify the minimum number of bits needed to represent each character.

[1 mark]
  • A6
  • B7
  • C8
  • D70
Mark scheme
  • B 7 (1)
  • The only correct answer is B. The correct answer is 7.
  • A is not correct because 6 bits give only 64 combinations, which is not enough for 70 characters
  • C is not correct because 7 bits already give 128 combinations, so 8 bits is not the minimum needed
  • D is not correct because 70 is the number of characters needed, not a number of bits
Example answers and how they were marked
Full marks1/1

B 7

Why: The only correct answer: 7 bits give 128 combinations, enough for 70 characters, and it is the smallest number of bits that does (1).

No marks0/1

C 8

Why: Distractor, no credit: a single-tick item has no partial credit, and 8 bits is not the minimum because 7 bits already give 128 combinations, so the scheme's C line gives no mark.

No marks0/1

A 6

Why: Misconception, no credit: 6 bits give only 64 combinations, which cannot represent 70 different characters, so the scheme's A line gives no mark.

2Short recall2 marksUnits & Conversion Swap Remove

A solid state drive has a capacity of 5 gibibytes.

Give an expression to calculate the number of bits in 5 gibibytes. You do not need to do the calculation.

[2 marks]
Mark scheme

Award one mark for each of:

  • 5 × 1024^3 / 5 × 1024 × 1024 × 1024 / 5 × 2^30, for the number of bytes (1)
  • A fully correct expression with × 8 to convert bytes to bits, in any order, e.g. 5 × 1024^3 × 8, 8 × 5 × 2^30 (1)

Accept 5 × 1 073 741 824 × 8.

Accept 5 × 2^33 or 42 949 672 960 as a fully correct expression (2 marks).

Do not accept 5 × 1000^3 × 8, which uses decimal multiples.

Do not accept ÷ 8, which converts bits to bytes.

Example answers and how they were marked
Full marks2/2

8 × 5 × 2^30

Why: 5 × 2^30 is the number of bytes (1) and × 8 converts bytes to bits (1).

Some marks1/2

5 × 2^30

Why: Correct number of bytes using the binary multiple 2^30 (1), but no conversion to bits.

No marks0/2

5 × 1000^3 × 8

Why: Uses decimal 1000^3 instead of binary 1024^3, so the expression is not fully correct; no creditworthy point.

3Explain2 marksProtocols & Layers Swap Remove

Email protocols are used when an email is sent and received.

Explain the role of SMTP when an email is sent.

[2 marks]
Mark scheme

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

  • Sends outgoing email from the client to the mail server (1) so it can be forwarded/relayed to the recipient's mail server (1)
  • Transfers email between mail servers (1) so it reaches the destination server (1)
  • Pushes/sends the email message (1) because it handles outgoing mail while POP3/IMAP handle incoming mail (1)

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

Do not accept receiving/downloading email or storing email on the server, which is POP3/IMAP.

Example answers and how they were marked
Full marks2/2

SMTP sends the email from the sender's computer to the mail server (1) so it can be forwarded on to the recipient's mail server (1).

Why: Linked point (1) and reason (1): sends to the mail server so it can be forwarded.

Some marks1/2

SMTP is used to send emails (1).

Why: Role (1) identified, but no linked reason or expansion of what sending involves.

No marks0/2

SMTP downloads the email to the recipient's device (0) so they can read it.

Why: Downloading email is the role of POP3/IMAP, not SMTP, so no credit is given.

4Calculate2 marksBinary Shifts Swap Remove

Computer systems manipulate bit patterns.

Complete the table with the result of applying the shift to the binary pattern.

[2 marks]
Binary patternShift8-bit binary result
0011 0100Logical shift left by 3
Mark scheme

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

  • 1010 (1)
  • 0000 (1)

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

Example answers and how they were marked
Full marks2/2

1010 0000

Why: Every bit moves 3 places left, with 0s in from the right: both nibbles are correct (2).

Some marks1/2

1101 0000

Why: Shifts 2 places instead of 3. The second nibble is correct (1); the first is not.

No marks0/2

0000 0110

Why: Shifts the bits the wrong way. 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.