- 2081 Bhadra · 3 marks
Signed 1's complement addition of (-65)+(+15)
Short answer
Represent -65 as 10111110 and +15 as 00001111. Add: 10111110 + 00001111 = 11001101. No end-around carry. The result is negative; its magnitude is 00110010 = 50, so the sum is -50.
Perform addition of (-65) and (+15) using signed 1's complement representation with the 8-bit format.
In signed 1's complement form a negative number is the 1's complement (all bits inverted) of its positive value; the MSB is the sign bit. An end-around carry, if produced, is added back to the LSB.
Step 1: Represent the numbers in 8 bits
Step 2: Add
1011 1110 (-65)
+ 0000 1111 (+15)
-----------
1100 1101
There is no end-around carry out of the MSB, so the result is already in final form. The sign bit is 1, so the result is negative and is in 1's complement form.
Step 3: Find the magnitude
Answer: in 8-bit signed 1's complement, which is . Check: . No overflow, because the operands have opposite signs.
✓ Answer checked by Claude Opus 5.5 (high effort)
Related questions
- 39 to Gray/Excess-3 and 2's complement addition · Digital Logic, chapter 1
- Gray→BCD, decimal→Excess-3 and 2's complement addition · Digital Logic, chapter 1
- 39 to binary/hex and 2's complement addition · Digital Logic, chapter 1
- Circuit giving 2's complement of a 4-bit number · Digital Logic, chapter 5
- De Morgan's theorem and (-47+27) by 2's complement · Digital Logic, chapter 2
- (10.001)₂ − (11.101)₂ by 2's complement · Digital Logic, chapter 5
- 2's complement: 15 − 20 · Basic Electronics Engineering, chapter 6
- Polynomial representation and addition algorithm · Data Structure and Algorithm, chapter 4
- AVL tree for 52, 65, 72, 15, 11, 32, 20 · Data Structure and Algorithm, chapter 6
- Signed division and non-restoring division · Computer Organization and Architecture, chapter 5