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.
Add 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
How many 2's are there between 200-300?
100 2s for the hundreds digit of 200-30010 2s for the tens digit of 220-23010 2s for the ones digit of 200-300________________________________120 '2s'
Why 2's complement binary subtraction is preffered over 1's complement binary subtraction?
1
What is the binary complement 8 bit representation for negative 19?
8-bit 2s complement representation of -19 is 11101101 For 1s complement invert all the bits. For 2s complement add 1 to the 1s complement: With 8-bits: 19 � 0001 0011 1s � 1110 1100 2s � 1110 1100 + 1 = 1110 1101
What is the 2's complement value of -85?
87
What is binary equivalent of -15 using 2's complement?
-15 is 11111111 and 2s com is 1111 0001
Subtract the hexadecimal number 1234 from DA57 using twos complement addition method?
(1234)hex=(0001 0010 0011 0100)2 (DA57)hex=(1101 1010 0101 0111)2 Taking, (1234)hex=(0001 0010 0011 0100)2 =(1110 1101 1100 1011) -1s complement =(1110 1101 1100 1100) -2s complement Now ,add 2s complement of (1234)hex with (DA57)hex, we get 1110 1101 1100 1100 + 1101 1010 0101 0111 1 1100 1000 0010 0011 There is a Carry bit Since,carry is generated.so,no is negative Then take 2s complement of above no.Thus ,we get 0011 0111 1101 1101=(37DD)hex (1234)hex -(DA57)hex =37DD)hex
How do you detect overflow when adding two numbers in 2s complement form?
You can detect overflow if the result turns out to be negative (which is the same as checking to see if the sign bit is 1). For example if you tried to add 5 and 6 in to 4-bit 2s complement, you would get 0101 + 0110 = 1011, which is a negative number since the sign bit (the 1 on the left) is a 1. This is an overflow.
The 2's compliment of the number 1000 is?
To get the 2s complement, find the 1s complement (by inverting the bits) and add 1. Assuming that number is [4-bit] binary it would be 1000. If it is preceded by 0s, as in, for example, 0000 1000, then it would be 1111 1000.
How do you get 4 when using four 2s in addition subtraction division or multiplication?
(2 + 2)*2/2 = 4
How do you factor 4s2-9?
4s2 - 9 can be expressed by using the identity: a2 - b2 = (a-b)(a+b) Therefore, 4s2 - 9 = (2s)2 - 32 = (2s-3)(2s+3)
What is the answer to 2s-12 plus 2s equals 4s-12?
2s - 12 + 2s = 4s - 124s - 12 = 4s - 124s = 4ss = s==========this is an identity and any number can be s
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 2's complement value of 98?
To find the 2s complement invert the bits and add 1: 98 = 1100010 = ...0000 0110 0010 (written in complete nybbles with leading 0 bits) → 2's complement: ...1111 1001 1101 + 1 = ...1111 1001 1110 Every bit in front of the first bit is a 1 (the exact number will depend upon the number of bytes used to store the number).
