One of the bit patterns is wasted. Addition doesn't work the way we want it to.
Remember we wanted to have negative binary numbers so we could use our binary addition algorithm to simulate binary subtraction. How does signed magnitude fare with addition? To test it, let's try subtracting 2 from 5 by adding 5 and -2. A positive 5 would be represented with the bit pattern '0101B' and -2 with '1010B'. Let's add these two numbers and see what the result is:
0101
0010
-----
0111
Now we interpret the result as a signed magnitude number. The sign is '0' (non-negative) and the magnitude is '7'. So the answer is a postive 7. But, wait a minute, 5-2=3! This obviously didn't work. Conclusion: signed magnitude doesn't work with regular binary addition algorithms.
Chat with our AI personalities
Add the magnitudes of the integers (-4 has a magnitude of 4), then take the sign to the answer.
It is stretching it a bit, but it could be argued that every number has a magnitude and a sign.
When you have two negatives, you add the magnitudes, but since, you have both negatives, the direction of the resultant magnitude is along the negative direction, so you add the magnitude and put the negative sign.
It is the sign that is opposite, not the number But if the number magnitude is the same, it is correct to say that ,for example, negative 6 is the opposite of positive six. But negative 4 is not the opposite of negative 8, for example
If the fraction is already positive, then it is also the absolute value. If the fraction is negative, just change the sign and it becomes the absolute value. Absolute value means the magnitude (value) of the fraction without any sign attribute.