Convert decimal +49 and +29 to binary, using the signed‐2’s‐complement representation and enough digits to accommodate the numbers. then perform the binary equivalent of (+29) + (-49), (-29) + (+49), and (-29) + (-49). convert the answers back to decimal and verify that they are correct.

To solve this problem, let us first find for the binary equivalents of the numbers. They are:

Decimal --> Binary

+ 29 --> 00011101

+ 49 --> 00110001

- 29 --> 11100011

- 49 --> 11001111

Now we apply the normal binary arithmetic to these converted numbers:

(+ 29) + (- 49) ---> 00011101 + 11001111 = 11101100 ---> - 20 (TRUE)

(- 29) + (+ 49) ---> 11100011 + 00110001 = 00010100 ---> + 20 (TRUE)

(- 29) + (- 49) ---> 11100011 + 11001111 = 10110010 ---> - 78 (TRUE)

kjnsk nidn t

dfj dt

step-by-step explanation:

vjnijernv