Menu

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

3 questions · 6 marks

Pick again
Print
1Convert2 marksHexadecimal to Binary Conversion Swap Remove

Binary patterns can represent numbers.

Convert the hexadecimal number D3 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1101 (1)
  • 0011 (1)

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

Example answers and how they were marked
Full marks2/2

1101 0011

Why: Each digit is 4 bits: D = 1101, 3 = 0011 (2).

Some marks1/2

1101 0100

Why: Converts 3 as if it were the next digit up. The first nibble is correct (1); the second is not.

No marks0/2

0011 1101

Why: The nibbles are in the wrong order. Neither nibble is correct.

2Calculate2 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
1000 0111Logical shift right by 1
Mark scheme

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

  • 0100 (1)
  • 0011 (1)

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

Example answers and how they were marked
Full marks2/2

0100 0011

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

Some marks1/2

0100 0010

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

No marks0/2

0000 1110

Why: Shifts the bits the wrong way. Neither nibble is correct.

3Calculate2 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
1100 0001Arithmetic shift right by 2
Mark scheme

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

  • 1111 (1)
  • 0000 (1)

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

Example answers and how they were marked
Full marks2/2

1111 0000

Why: Every bit moves 2 places right, with copies of the sign bit (1) in from the left: both nibbles are correct (2).

Some marks1/2

0011 0000

Why: Fills the gap on the left with 0s, as a logical shift would, instead of copying the sign bit. The second nibble is correct (1); the first is not.

No marks0/2

0000 0100

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.