Computer Science AS OCR
-
1-1-structure-and-function-of-the-processor as5 主题
-
1-2-types-of-processor as3 主题
-
1-3-input-output-and-storage as2 主题
-
2-1-systems-software as8 主题
-
2-3-software-development as5 主题
-
2-4-types-of-programming-language as4 主题
-
3-1-compression-encryption-and-hashing as3 主题
-
3-2-databases as3 主题
-
3-3-networks as8 主题
-
3-4-web-technologies as13 主题
-
html as
-
css as
-
css-styling as
-
javascript as
-
variables-and-constants-in-javascript as
-
outputs-in-javascript as
-
selection-in-javascript- as
-
for-loops-in-javascript- as
-
while-loops-in-javascript- as
-
strings-in-javascript- as
-
operators-in-javascript- as
-
nested-statements-in-javascript as
-
functions-and-procedures-in-javascript as
-
html as
-
4-1-data-types as8 主题
-
4-2-data-structures as4 主题
-
4-3-boolean-algebra as1 主题
-
5-1-computing-related-legislation as4 主题
-
5-2-moral-and-ethical-issues as9 主题
-
6-1-thinking-abstractly as3 主题
-
6-2-thinking-ahead as1 主题
-
6-3-thinking-procedurally as3 主题
-
6-4-thinking-logically as2 主题
-
6-5-thinking-concurrently as2 主题
-
7-1-programming-techniques as9 主题
-
8-1-standard-algorithms-and-big-o-notation as8 主题
binary-addition-and-subtraction- as
Exam code:H046
Binary Addition
What is binary addition?
-
Binary addition involves summing numbers in base-2, which uses only the digits 0 and 1
-
Like denary addition, start from the rightmost digit and move towards the left
-
Carrying over occurs when the sum of a column is greater than 1, passing the excess to the next left column
Example addition

Binary addition example
Overflow errors
-
Overflow occurs when the sum of two binary numbers exceeds the given number of bits
-
In signed number representations, the leftmost bit often serves as the sign bit; overflow can flip this, incorrectly changing the sign of the result
-
Overflow generally leads to incorrect or unpredictable results as the extra bits are truncated or wrapped around

An overflow occurring after a binary addition
Binary Subtraction
-
As well as adding binary numbers, we can also subtract binary numbers
-
One method of doing this is to use two’s complement
Example 1
Subtract 0011 (3) from 1001 (9)
1. Given numbers
|
Number 1 |
|
|
|
|
|
Number 2 |
|
|
|
|
2. Two’s complement
-
Convert the number to subtract (
0011) to its two’s complement -
Invert:
1100 -
Add 1:
1100 + 0001 = 1101
|
Number 1 |
|
|
|
|
|
Number 2 (Converted) |
|
|
|
|
3. Addition operation
-
Now add 1001 and 1101
-
Binary sum:
1001 + 1101 = 1 0110 -
That’s 5 bits: the leftmost
1is overflow (carry out of MSB)
|
Carry |
|
|
|
|
|
|
Number 1 |
|
|
|
|
|
|
Number 2 |
|
|
|
|
|
|
Addition |
|
|
|
|
|
4. Remove overflow
-
The result is
10110with overflow -
Drop the leading
1(overflow):0110= 6 (in decimal) -
In two’s complement arithmetic, the overflow bit does not contribute to the actual value of the operation but is more of a by-product of the method
-
Final answer = 6
-
9 – 3 = 6
Responses