A computer system has a three level memory hierarchy, with access time and hit ratios as shown below:

(i) What should be the minimum size of level $$1$$ and $$2$$ memories to achieve an average access time of less than $$100$$ nsec?

(ii) What is the average access time achieved using the chosen sizes of level $$1$$ and level $$2$$ memories?

It gives non-uniform priority to various devices.

Both’s algorithm for integer multiplication gives worst performance when the multiplier pattern is

Consider the following floating point number representation

The exponent is in $$2’s$$ complement representation and mantissa is in the sign magnitude representation. The range of the magnitude of the normalized mantissa in this representation is