Chapter 2, Problem 34CRP

a.

Perform the AND operation on $\begin{array}{l}111001\hfill \\ \underset{\_}{\text{AND}101001}\hfill \end{array}$:

Explanation of Solution

If the bits of two operands is $1$, then the output of the AND operation will be $1$. But if either bit of an operand is zero, the output will be zero.

The AND operation of $\begin{array}{l}111001\hfill \\ \underset{\_}{\text{AND}101001}\hfill \end{array}$ is,

$\text{AND}\begin{array}{lll}1\hfill & 1\hfill & 1\hfill \end{array}$

b.

Perform the AND operation on $\begin{array}{l}000101\hfill \\ \underset{\_}{\text{AND}101010}\hfill \end{array}$:

Explanation of Solution

If the bits of two operands is $1$, then the output of the AND operation will be $1$. But if either bit of an operand is zero, the output will be zero.

The AND operation of $\begin{array}{l}000101\hfill \\ \underset{\_}{\text{AND}101010}\hfill \end{array}$ is,

$\text{AND}\begin{array}{lll}0\hfill & 0\hfill & 0\hfill \end{array}$

c.

Perform the AND operation on $\begin{array}{l}001110\hfill \\ \underset{\_}{\text{AND}010101}\hfill \end{array}$:

Explanation of Solution

If the bits of two operands is $1$, then the output of the AND operation will be $1$. But if either bit of an operand is zero, the output will be zero.

The AND operation of $\begin{array}{l}001110\hfill \\ \underset{\_}{\text{AND}010101}\hfill \end{array}$ is,

$\text{AND}\begin{array}{lll}0\hfill & 0\hfill & 1\hfill \end{array}$

d.

Perform the AND operation on $\begin{array}{l}111011\hfill \\ \underset{\_}{\text{AND}110111}\hfill \end{array}$:

Explanation of Solution

If the bits of two operands is $1$, then the output of the AND operation will be $1$. But if either bit of an operand is zero, the output will be zero.

The AND operation of $\begin{array}{l}111011\hfill \\ \underset{\_}{\text{AND}110111}\hfill \end{array}$ is,

$\text{AND}\begin{array}{lll}1\hfill & 1\hfill & 1\hfill \end{array}$

e.

Perform the OR operation on $\begin{array}{l}111001\hfill \\ \underset{\_}{\text{OR}101001}\hfill \end{array}$:

Explanation of Solution

In OR operation,

• If the bits of two operands is $1$, then the output of the OR operation will be $1$.
• If the bits of two operands is $0$, then the output of the OR operation will be $0$
• If either bit of an operand is zero, the output will be $1$.

The OR operation of $\begin{array}{l}111001\hfill \\ \underset{\_}{\text{OR}101001}\hfill \end{array}$ is,

$\text{OR}\begin{array}{}\end{array}$

f.

Perform the OR operation on $\begin{array}{l}010100\hfill \\ \underset{\_}{\text{OR}101010}\hfill \end{array}$:

Explanation of Solution

In OR operation,

• If the bits of two operands is $1$, then the output of the OR operation will be $1$.
• If the bits of two operands is $0$, then the output of the OR operation will be $0$
• If either bit of an operand is zero, the output will be $1$.

The OR operation of $\begin{array}{l}010100\hfill \\ \underset{\_}{\text{OR}101010}\hfill \end{array}$ is,

$\text{OR}\begin{array}{}\end{array}$

g.

Perform the OR operation on $\begin{array}{l}00100\hfill \\ \underset{\_}{\text{OR}010101}\hfill \end{array}$:

Explanation of Solution

In OR operation,

• If the bits of two operands is $1$, then the output of the OR operation will be $1$.
• If the bits of two operands is $0$, then the output of the OR operation will be $0$
• If either bit of an operand is zero, the output will be $1$.

The OR operation of $\begin{array}{l}00100\hfill \\ \underset{\_}{\text{OR}010101}\hfill \end{array}$ is,

$\text{OR}$

h.

Perform the OR operation on $\begin{array}{l}101010\hfill \\ \underset{\_}{\text{OR}110101}\hfill \end{array}$:

Explanation of Solution

In OR operation,

• If the bits of two operands is $1$, then the output of the OR operation will be $1$.
• If the bits of two operands is $0$, then the output of the OR operation will be $0$
• If either bit of an operand is zero, the output will be $1$.

The OR operation of $\begin{array}{l}101010\hfill \\ \underset{\_}{\text{OR}110101}\hfill \end{array}$ is,

$\text{OR}\begin{array}{}\end{array}$

i.

Perform the XOR operation on $\begin{array}{l}111001\hfill \\ \underset{\_}{\text{XOR}101001}\hfill \end{array}$:

Explanation of Solution

In XOR operation,

• If and only if the bits of two operands are opposite, then the output of the XOR operation will be $1$.

The XOR operation of $\begin{array}{l}111001\hfill \\ \underset{\_}{\text{XOR}101001}\hfill \end{array}$ is,

j.

Perform the XOR operation on $\begin{array}{l}000111\hfill \\ \underset{\_}{\text{XOR}101010}\hfill \end{array}$:

Explanation of Solution

In XOR operation,

• If and only if the bits of two operands are opposite, then the output of the XOR operation will be $1$.

The XOR operation of $\begin{array}{l}000111\hfill \\ \underset{\_}{\text{XOR}101010}\hfill \end{array}$ is,

$\text{XOR}\begin{array}{l}0\hfill \end{array}$

k.

Perform the XOR operation on $\begin{array}{l}010000\hfill \\ \underset{\_}{\text{XOR}010101}\hfill \end{array}$:

Explanation of Solution

In XOR operation,

• If and only if the bits of two operands are opposite, then the output of the XOR operation will be $1$.

The XOR operation of $\begin{array}{l}010000\hfill \\ \underset{\_}{\text{XOR}010101}\hfill \end{array}$ is,

$\text{XOR}\begin{array}{l}0\hfill \end{array}$

l.

Perform the XOR operation on $\begin{array}{l}111111\hfill \\ \underset{\_}{\text{XOR}110101}\hfill \end{array}$:

Explanation of Solution

In XOR operation,

• If and only if the bits of two operands are opposite, then the output of the XOR operation will be $1$.

The XOR operation of $\begin{array}{l}111111\hfill \\ \underset{\_}{\text{XOR}110101}\hfill \end{array}$ is,

$\text{XOR}\begin{array}{l}1\hfill \end{array}$