Scribd
Upload
72 views

Computer Organization and Design 2010

This document appears to be an exam for a computer organization and design course. It contains 10 questions covering topics like MIPS instruction formats, performance metrics, binary representations, addressing modes, microprogramming, locality of data, virtual memory, MIPS instructions, Booth multiplication algorithm, exceptions handling, finite state machine control, bus types, cache mapping techniques, and reducing cache miss penalties. The candidate is asked to answer all questions within the allotted time of 3 hours.

Uploaded by

Stanly Kurian
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
72 views

Computer Organization and Design 2010

This document appears to be an exam for a computer organization and design course. It contains 10 questions covering topics like MIPS instruction formats, performance metrics, binary representations, addressing modes, microprogramming, locality of data, virtual memory, MIPS instructions, Booth multiplication algorithm, exceptions handling, finite state machine control, bus types, cache mapping techniques, and reducing cache miss penalties. The candidate is asked to answer all questions within the allotted time of 3 hours.

Uploaded by

Stanly Kurian
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

I|||rftllil illil$ illll lut ilfr ffil

Reg;No.:
Name:

n'[t7774

Fourth Semester B.Tech.EngineeringDegreeRegular/Supplementary/ Part Time Examinationo July 2010 2K6 CS 405 : COMPUTER ORGANISATION AND DESIGN Time: 3 Hours
Instruction : Answer all questions. l. a) How do you relate performanceand execution time for a machine ? b) Explain indexed addressingand update addressingmodes. c) Why doesn't MIPS have a subtractimmediate instructions ? d) Show the IEEE 754 binary representationfor the floating point number l0 in single and double precision. e) Give the formats of the three instruction classesR-type, branch and load 1 store instructionsand also give major observationsabout this formats. 0 What is microprogramming ? List the advantagesand disadvantages of microprogramming. g) Define following terms : i) Temporal locality of data ii) Spatial locality of data iii) Pagefaulrs. h) Write a short note on virtual memory. (gx$-r

Max.Marks:

2 ' A) i) Show the single MIPS instructionor minimal sequence of instructionsfor = this c statement a b + 100. Assume that a conespondsto register$ to and b corresponds to register$ tl. ii) Explain MIPS addressingmodes. OR
P.T.O.

M 17774

Illl|||il llll llll ilil]ililil tilt ilil

B) i) Supposewe have 2 implementationsof same instruction set architecture. Machine A has a clock cycle time of I ns and a CPI of 2.0 for some program and machine B has a clock cycle time of 2 ns and a CPI of 1.2 for the sameprogram. Which machineis faster for this program, and by how much ? 8 ii) Explain the use of synthetic bench marks. 7 3 . A) i) What is binary number doesthis hexadecimalnumberrepresent7ftr ffian"* ? What decimal number does it represent?

ii) Find the shortestsequenceof MIPS instructionsto determine if there is a carry out from the addition of 2 registers,say registers$ t3 and $ t+ place a 0 or 1 in register$ tZ if the curyout is 0 or 1 respectively. 10 OR B) i) Multiply the following pair of signed2' s complementnumbersusing the Booth algorithm. A - 010111(Multiplicand) B = 110110(Multiplier) t2 ii) Discuss any one techniquesfor speedingup the rnultiplication operation. 3 4. A) What is exceptions? How exceptionsare handledand how control checks are made for exceptionsexplain in detail ?

OR
B) Draw the completefinite statemachineconfrol for the data pattl and explain. 5. A) i) Explain Bus and types of bus. ii) State 3 techniquesto increasethe bus bandwidth. OR B) i) Give an example to illustratedirectmapped, set-associative, fully-associative cachesand lists their advantages and disadvantages. 10 iD Explain different techniques to reducecachemiss penalty,
J
F

t5 10
5

You might also like