Chapter 2, Problem 35E

a)

Program Plan Intro

Subtracting signed binary numbers:

To subtract two binary signed numbers, two’s complement arithmetic method should be used. So, negative numbers are represented in two’s complement form, after that add two numbers including their sign bit. If there is any carry bit, discard the bit and take the remaining bit which gives the final result.

Some predefined rules should be followed when performing binary addition. The rules are given as follows:

$\begin{array}{l}0+0=0\\ 0+1=1\\ 1+0=1\\ 1+1=\text{0}\text{(carry 1)}\end{array}$

$\text{1+1+1}\text{= 1 (carry 1) }$

b)

Explanation of Solution

Subtracting signed binary numbers 01011011 and (-00011111):

Consider the two binary numbers. The two’s complement should be taken for signed numbers in order to perform the signed binary subtraction.

One’s complement of $(00011111)$: $11100000$

Two’s complement:

$\begin{array}{l}11100000\\ +1\\ ------\\ 1110\end{array}$

c)

Explanation of Solution

Subtracting signed binary numbers 10101100 and (-00100100):

Consider the two binary numbers. The two’s complement should be taken for signed numbers in order to perform the signed binary subtraction.

One’s complement of $(00100100)$: $11011011$

Two’s complement: