Chapter 3, Problem 3.9E

Program Plan Intro

Saturation Arithmetic:

A version of arithmetic operation in which operations such as addition and multiplication are limited to a fixed range between a minimum and maximum value is called Saturation Arithmetic.

1’s Complement:

The value obtained by inverting all the bits present in the binary number is known as 1’s complement of the number.

For Example:

$\begin{array}{l}3=0011\\ \end{array}$

1’s complement= $1100$

2’s Complement:

2’s complement is a method of signed representation of a number and can be calculate by adding “1” with the 1’s complement of the number.

For Example:

$\begin{array}{l}3=0011\\ \end{array}$

2’s complement of “3”:

$\begin{array}{l}1+1’scomplementof“3”\\ =0001+1100\\ =1101\end{array}$

Given numbers: 151 and 214

Given Information:

“151” and “214” are signed 8-bit integers stored in 2’s Complement format.