UCS510
UCS510
(b) Consider a four variable function f (A, B, C, D) = E (5,7,11,12) + d (3,11,13,15). Find (6)
the minimal expression.
Q2 (a) Design a 2-bit arithmetic circuit with one selection variable S and two n-bit data (6)
inputs A & B. The circuit generates the following four arithmetic operations in
411 conjunction with the input carry Cin. Draw the logic diagram for the first four
stages.
S Cln=0 Cm =1
0 D4i+B D=A-B
1 D=A+1 D=A-1
TO A
Ti B C
T2
T3
T4 F
T5
T6
(b) Let the address stored in the program counter be designated by the symbol X1. The (6)
instruction stored at X1 has an address part(operand reference) X2. The operand
needed to execute the instruction is stored in memory word with address X3. An
index register contains the value X4. Determine the effective address for the
following addressing modes: Indirect, PC relative, Direct, Indexed, Autodecrement„
Autoincrement
Q5 (a) A four-way set associative cache memory can accommodate a total of 8192 words (2+1)
from the main memory. The main memory size is 128 K >c 32, how many bits are
there in the tag, index field of the address format?What is the size of the cache
memory?
(b) Given x=0101 and y=1010 (already in two's complement notation) compute the (7)
product p =xxy using booth's algorithm by drawing flowchart also.
Q6 (a) A computer has a cache, main memory and a disk used for virtual memory. If a (6)
reference word is in the cache, 20 ns are required to access it. If it is in main
memory but not in the cache , 60 ns are needed to load it into the cache. If the word
is not in main meory, 12 ms are required to fetch the word from the disk, followed 11101
by 6Ons to copy it to the cache, and then reference is started again. The cache hit
ratio is 0.9 and main memory hit ratio is 0.6. What is the average time in
nanoseconds required to access a referenced word on this sytem?
(b) Differentiate between the following- (4)
(i) RISC vs CISC (ii) Paging vs Segmentation
Q7 (a) Consider the following sequence of instructions being processed on the 5- (4+2)
stage(Fetch, Decode, Execute, Memory access, Write back) RISC processor.-
LOAD R4, #100(R2)
ADD R5, R2, R3
SUB R6, R4, R5
AND R7, R2, R5
Assume that the pipeline does not use operand forwarding. Draw a space time
diagram that represents instruction flow through the pipeline during each clock
cycle. How long does it take for the instruction sequence to complete?
(b) Explain three input-output modes of data transfer with a suitable example. (4)