Sunteți pe pagina 1din 2


Tech I Semester Regular Examinations, February/March 2009 COMPUTER ORGANISATION (Computer Science & Engineering-Common to CSE & NN) Time: 3 Hours Answer any FIVE questions Max Marks: 60


(a) Explain with an example how Gray code number is converted into Binary code equivalent. (b) Describe Booths algorithm for division of two signed binary numbers. (c) Show that the exclusive OR function X = A + B + C + D is an odd function.


(a) Design a 4-bit combinational circuit decremented using four adder circuits. (b) A two word instructions is stored in memory at an address designated by the symbol W. The address field of the instruction, stored at W+1, is designated by Y. The operand used during the execution of the instructions is stored at an address symbolized by Z. An index register contains the value X. State how Z is calculated from the other addresses of the addressing mode of the instruction is (a) Direct (b) indirect (c) relative (d) indexed


(a) Explain the difference between hardwired control and micro programmed control? Give their relative merits and demerits. (b) Describe the conditional branching capability in a micro programmed control unit.


(a) Why should a user program be partitioned? Describe the advantages and disadvantages of Partitioning. (b) Describe some of the importance metrics and measures of performances evaluation of computers (c) Give two applications of parallel processing.


(a) Describe SET associative mapping technique for cache memory (b) What is memory interleaving? Describe with suitable diagram, higher-Order and lower-order inter leaving.


(a) Design parallel priority interrupt hardware for a system with 4 interrupt sources. (b) Describe asynchronous data transfer schemes using suitable diagrams


(a) Derive the equation for speed up of a K stage linear pipeline for performing N task (b) How Branch instructions are handled in Pipeline system (c) Describe a RISC Pipeline

(a) Give the architecture of a multi processor system (b) Give SIMD Computer model. (c) Describe latency hiding Technique.