Binary patterns can represent numbers.
Complete the table with the result of applying the shift to the binary pattern.
| Binary pattern | Shift | 8-bit binary result |
|---|---|---|
| 0111 0101 | Logical 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.