Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

7 questions · 14 marks

Pick again
Print
1Convert1 markBinary to Denary Conversion Swap Remove

Computers manipulate binary patterns.

Convert the binary pattern 1010 0100 to denary.

[1 mark]
Mark scheme

Award one mark for:

  • 164 (1)
Example answers and how they were marked
Full marks1/1

164

Why: Correct: 128 + 32 + 4 = 164 (1).

No marks0/1

37

Why: Reads the place values from the wrong end (the left-hand bit as 1), so the value is wrong.

No marks0/1

3

Why: Counts the 1s instead of adding their place values.

2Convert2 marksDenary to Binary Conversion Swap Remove

Computer systems manipulate bit patterns.

Convert the denary number 140 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1000 (1)
  • 1100 (1)

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

Example answers and how they were marked
Full marks2/2

1000 1100

Why: 140 = 128 + 8 + 4: both nibbles are correct (2).

Some marks1/2

1000 1101

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

No marks0/2

0011 0001

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

3Convert2 marksDenary to Negative Binary Conversion Swap Remove

Computer systems manipulate bit patterns.

Convert the denary number -48 to 8-bit binary using two's complement.

[2 marks]
Mark scheme

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

  • 1101 (1)
  • 0000 (1)

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

Example answers and how they were marked
Full marks2/2

1101 0000

Why: 48 is 00110000; flip the bits (11001111) and add 1: both nibbles are correct (2).

Some marks1/2

1011 0000

Why: Uses sign and magnitude (a 1 in front of 48) instead of two's complement. The second nibble is correct (1); the first is not.

No marks0/2

1100 1111

Why: Flips the bits of 48 but doesn't add 1. Neither nibble is correct.

4Convert2 marksDenary to Negative Binary Conversion Swap Remove

Computer systems manipulate bit patterns.

Convert the 8-bit binary two's complement pattern 1000 0111 to denary.

[2 marks]
Mark scheme

Award one mark for each of:

  • − (negative sign) (1)
  • 121 (1)

The correct answer is −121

Example answers and how they were marked
Full marks2/2

−121

Why: The left-hand bit is worth −128: −128 + 7 = -121. Sign (1) and value (1).

Some marks1/2

121

Why: The value is right (1) but the minus sign is missing.

No marks0/2

135

Why: Reads it as an unsigned number, so neither the sign nor the value is right.

5Convert2 marksDenary to Negative Binary Conversion Swap Remove

Computer systems manipulate bit patterns.

Convert the 8-bit binary two's complement pattern 1100 1011 to denary.

[2 marks]
Mark scheme

Award one mark for each of:

  • − (negative sign) (1)
  • 53 (1)

The correct answer is −53

Example answers and how they were marked
Full marks2/2

−53

Why: The left-hand bit is worth −128: −128 + 75 = -53. Sign (1) and value (1).

Some marks1/2

53

Why: The value is right (1) but the minus sign is missing.

No marks0/2

203

Why: Reads it as an unsigned number, so neither the sign nor the value is right.

6Calculate2 marksBinary Shifts Swap Remove

Binary, denary and hexadecimal patterns represent numbers.

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

[2 marks]
Binary patternShift8-bit binary result
1010 1100Arithmetic shift right by 1
Mark scheme

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

  • 1101 (1)
  • 0110 (1)

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

Example answers and how they were marked
Full marks2/2

1101 0110

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

Some marks1/2

0101 0110

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

0101 1000

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

7Calculate3 marksAdding Binary Numbers Swap Remove

Computers manipulate binary patterns.

(a)

Complete the table to show the 8-bit result of the binary addition.

[2 marks]
1286432168421
10111001
10111100
Mark scheme

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

  • 0111 (1)
  • 0101 (1)

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

Ignore a carry shown beyond the eighth bit.

Example answers and how they were marked
Full marks2/2

0111 0101

Why: 185 + 188 = 373, which needs 9 bits; the 8 bits that are kept are both correct (2).

Some marks1/2

0000 0101

Why: Forgets to carry the 1s. The second nibble is correct (1); the first is not.

No marks0/2

1011 1101

Why: Never carries. Neither nibble is correct.

(b)

State the name of the error that occurs when this addition is carried out.

[1 mark]
Mark scheme

Award one mark for:

  • overflow (error) (1)
Example answers and how they were marked
Full marks1/1

Overflow

Why: The result needs more bits than are available (1).

No marks0/1

Underflow

Why: A near miss: the result is too big for 8 bits, not too small.

No marks0/1

A syntax error

Why: A syntax error is a mistake in a program's code, not in arithmetic.

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.