Computer Organization and Architecture

Assignments

1. Write instructions sequences to compute X = (P/Q) * ((R - S) * T) in one address, two address
and three address machines.
2. Evaluate X=(A*B)+(C+ A/D - E) using zero-address, one-address, two-address and three-address
instructions.
3. Write the sequence of control steps required for the following instructions:
(i)
(ii)

MUL R1,(R2)
SUB (R1),R2

4. Construct a a 4M X 16 memory using 256K X 4 memory chips.

5. A computer system has a main memory consisting of 1 M words and 64 words per block. It also
has a 4K word cache organized in a 4-way set associative manner. How many bits are needed to
specify a main memory address? Calculate the number of bits in each of the TAG, SET and
WORD fields of the main memory address formats.
6. A set-associate cache consists of a total of 64 blocks divided into four-block sets. The main
memory contains 4096 blocks, each consisting of 128 words. How many bits are there in the
main memory address? How many bits are there in each of the TAG, SET and WORD fields?
7. Calculate the number of page faults for FIFO and LRU strategies when the sequence of reference
is: A B B C A C B D D E A C E D D D A E. Assume there were 3 free frames in the memory
initially.
8. Calculate the loading time difference between no memory interleaving and 4-modules memory
interleavingwhen a cache read miss occurs where main memory have to be accessed and
subsequent transfer data to the cache. The Size of block needed to transfer from memory to
cache = 8 words. The Access time for main memory for the 1st word is 16 cycles/word and the
nd
access time for main memory from 2 to 8th word is 8 cycles/word. The access/transfer time
from main memory to cache is 2 cycle/word. Ignore the time for cache miss.
9. Represent the decimal values 26, -58, 74 and 120 as signed 10 bit binary numbers in the
following number formats: i) signed magnitude, ii) signed 1s complement and iii) signed 2s
complement. What are the advantages of signed 2s complement representation over signed
magnitude representation?
10. Show step by step the multiplication of 19 X 23 (in binary) using Booths multiplication algorithm.