Chapter 4, Problem 13E

a)

Explanation of Solution

Given:

A computer has a memory unit with 24 bits per word

Number of operations in the instruction is 150.

Number of required bits for the opcode:

Convert the number of operations for instruction into binary form:

$$

b)

Explanation of Solution

Number of bits left in the address part of the instruction:

From given memory unit, it has “24 bits” per word and number of required bits for opcode is “8 bits”.

The number of bits left for the address part is calculated as follows:

$\begin{array}{c}\text{Number of address bits = }\end{array}$

c)

Explanation of Solution

Maximum allowable size for memory:

The formula for finding number of words in memory is ${\text{2}}^{\text{N}}$.

Here, “N” is the number of address bits.  The number of address bits is “16” which is fetch from above subpart

d)

Explanation of Solution

Largest unsigned binary number in one word of memory:

The formula for calculating the largest unsigned binary number is $\text{Number of bits per word - 1}$.

Note: The number of address bits is “2²⁴”