Computer systems manipulate bit patterns.
Complete the table with the result of applying the shift to the binary pattern.
| Binary pattern | Shift | 8-bit binary result |
|---|---|---|
| 0011 0100 | Logical 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
1010 0000
Why: Every bit moves 3 places left, with 0s in from the right: both nibbles are correct (2).
1101 0000
Why: Shifts 2 places instead of 3. The second nibble is correct (1); the first is not.
0000 0110
Why: Shifts the bits the wrong way. Neither nibble is correct.