Computers manipulate binary patterns.
Complete the table to show the 8-bit result of the binary addition.
| 128 | 64 | 32 | 16 | 8 | 4 | 2 | 1 |
|---|---|---|---|---|---|---|---|
| 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 |
Mark scheme
Award one mark for each correct nibble in the correct order:
- 0010 (1)
- 0100 (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
0010 0100
Why: 193 + 99 = 292, which needs 9 bits; the 8 bits that are kept are both correct (2).
0010 0101
Why: A slip in the last bit. The first nibble is correct (1); the second is not.
1110 0011
Why: Never carries. Neither nibble is correct.
State the name of the error that occurs when this addition is carried out.
Mark scheme
Award one mark for:
- overflow (error) (1)
Example answers and how they were marked
Overflow
Why: The result needs more bits than are available (1).
Underflow
Why: A near miss: the result is too big for 8 bits, not too small.
A syntax error
Why: A syntax error is a mistake in a program's code, not in arithmetic.