You’ll need to be able to add together up to three binary numbers, and it’s really easy for AQA:
Example
Carrying | 1 | 1 | 1 | 1 | 1 | 1 | 1 | |
---|---|---|---|---|---|---|---|---|
0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | |
0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | |
+ | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 |
1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
You’ll need to be able to apply a binary shift to a binary number.
Logical Left Shift
Example
00101101 << 1 = 01011010
What happened, in decimal:
45 (multiplied by 2) = 90
Logical Right Shift