0
To find the 2s complement, invert all the bits (to get the 1s complement) and add 1:
10001100 00111001 → 01110011 11000110 + 1 = 01110011 11000111
If you have an operator missing between the two numbers then if it is subtract:
10001100 - 00111001 = 10001100 + 11000111 = carry set & 01010011 & overflow set.
If not subtract but some other operator, please re-ask your question with the operator written out as a word.
Still curious? Ask our experts.
Chat with our AI personalities
Blake
Steve
ReneAdd your answer:
Earn +20 pts
Why 2's complement binary subtraction is preffered over 1's complement binary subtraction?
1
What is the 2's complement value of -85?
87
What is the range of numbers that can be encoded in 4 bits using 2s complement notation?
Using 4 bits the signed range of numbers is -8 to 7. When working with signed numbers one bit is the sign bit, thus with 4 bits this leaves 3 bits for the value. With 3 bits there are 8 possible values, which when using 2s complement have ranges: for non-negative numbers these are 0 to 7; for negative numbers these are -1 to -8. Thus the range for signed 4 bit numbers is -8 to 7.
What is the answer to 2s plus 16 equals 4s - 6?
2s + 16 = 4s - 6 Subtract 2s from both sides: 16 = 2s - 6 Add 6 to both sides: 22 = 2s divide both sides by 2: s = 11
What is the integer equivalent represented by 2's complement of the binary number 10001011?
To get the 2s complement, change all 1 bits to 0s and all 0 bits to 1s, and add 1 to the result. So the 2s complement of the 8-bit binary number 10001011 is the binary integer 01110101. If you want that in decimal, then remember that each place value column is twice the value of the place value column to its right, and the rightmost place value column for an integer is 1. Thus 01110101 in decimal is 64 + 32 + 16 + 4 + 1 = 117 (And 10001011 as a signed 8-bit binary integer represents the decimal integer -117.)
