Menu

Binary Shifts Exam Questions

6 Edexcel GCSE Computer Science (1CP2) exam-style questions on Binary Shifts (2.1 Binary), 12 marks in all. Answer them on paper or print them, then open the mark schemes and example answers to see how each is marked.

Revise Binary Shifts first

Build a paper on 2.1 Binary
Print
1Calculate2 marks

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.

2Calculate2 marks

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.

3Calculate2 marks

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.

4Calculate2 marks

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.

5Calculate2 marks

Binary patterns can represent numbers.

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

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

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

  • 1010 (1)
  • 1000 (1)

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

Example answers and how they were marked
Full marks2/2

1010 1000

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

Some marks1/2

1010 1001

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.

6Calculate2 marks

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.

Keep practising Binary Shifts

More exam questions on 2.1 Binary

Teachers: print these as a worksheet with the mark schemes at the end, and sign your school up to set your classes activities on Binary Shifts.

Fetch Decode Explain isn't affiliated with or endorsed by Pearson Edexcel.