Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 573 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
1Multiple choice1 markImages Swap Remove

Identify the smallest identifiable area of a bitmap image.

[1 mark]
  • AColour depth
  • BFile size
  • CPixel
  • DResolution
Mark scheme
  • C Pixel (1)
  • The only correct answer is C. The correct answer is pixel.
  • A is not correct because colour depth is the number of bits used to store the colour of each pixel
  • B is not correct because file size is the amount of storage an image takes up, not an area of the image
  • D is not correct because resolution is a measure of the number of pixels in an image (such as its width × height), not the smallest identifiable area
Example answers and how they were marked
Full marks1/1

C Pixel

Why: Correct option; a pixel is the smallest identifiable area of a bitmap image (1).

No marks0/1

D Resolution

Why: Resolution is a measure of the number of pixels in an image, not the smallest identifiable area; no mark.

No marks0/1

A Colour depth

Why: Colour depth is the number of bits used to store each pixel's colour, not the smallest identifiable area; no mark.

2Short recall1 markUnits & Conversion Swap Remove

A file has a size of 2 kibibytes.

State the number of bytes in the file.

[1 mark]
Mark scheme

Award one mark for:

  • 2048 (1)
  • 2 × 1024 (1)
  • 2^11 (1)

Allow 2048 bytes.

Do not accept 2000, which is the number of bytes in two decimal kilobytes.

Do not accept 1024, which is the number of bytes in one kibibyte.

Do not accept 16, which is the number of bits in two bytes.

Example answers and how they were marked
Full marks1/1

2048

Why: 2048 is 2 × 1024, the number of bytes in 2 kibibytes (1).

No marks0/1

2000

Why: 2000 uses the decimal kilobyte, not the binary kibibyte; the mark scheme does not accept it.

No marks0/1

16

Why: 16 is the number of bits in two bytes, confusing bits with bytes; the mark scheme does not accept it.

3Explain2 marksProtocols & Layers Swap Remove

A bank's website can use HTTP or HTTPS.

Explain one benefit to a customer of the bank's website using HTTPS.

[2 marks]
Mark scheme

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

  • Data is encrypted/scrambled (1) so it cannot be read/understood if it is intercepted (1)
  • The customer's bank/personal details are kept secure/private (1) because the data is encrypted/scrambled during transmission (1)
  • The customer's login details/password cannot be read by an eavesdropper (1) because HTTPS encrypts/scrambles the data sent to and from the web server (1)

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

Allow 'scrambled' as an alternative to 'encrypted'.

Do not accept 'it is more secure/safe' or 'the data is secure' on its own, without saying how it is made secure (e.g. encryption/scrambling).

Do not accept faster loading/speed, or claims that HTTPS stops viruses or always proves the website is genuine.

Example answers and how they were marked
Full marks2/2

The data is encrypted (1) so anyone intercepting it cannot read the customer's bank details (1).

Why: Linked point (1) and reason (1): encryption means intercepted data cannot be read.

Some marks1/2

The data is encrypted (1) so the website is secure.

Why: Point (1) for encryption, but 'secure' on its own is a near-miss that the mark scheme does not credit as the linked reason; it must say why, e.g. that intercepted data cannot be read.

No marks0/2

HTTPS is faster than HTTP (0) so the customer can log in more quickly.

Why: Speed is not a benefit of HTTPS and is named in a 'Do not accept' line, so no creditworthy point is given.

4Calculate2 marksBinary Shifts Swap Remove

Computers manipulate binary patterns.

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

[2 marks]
Binary patternShift8-bit binary result
1000 0001Logical shift right by 1
Mark scheme

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

  • 0100 (1)
  • 0000 (1)

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

Example answers and how they were marked
Full marks2/2

0100 0000

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

Some marks1/2

0100 0001

Why: A slip in the last bit. The first nibble is correct (1); the second is not.

No marks0/2

0000 0010

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.