VTU Computer Science (Semester 3)
Computer Organization
June 2012
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1 (a) What is performance measurement? Explain the overall SPEC rating for the computer in a program suite.
4 M
1 (b) List and explain the technological features and devices improvement made during different generations of computers.
8 M
1 (c) Mention four types of operations to be performed by instruction in a computer. Explain with basic types of instruction formats to carry out C ?[A]+[B].
8 M

2 (a) Define an addressing mode. Explain the following addressing modes, with examples: immediate, indirect, index, relative and auto increment.
8 M
2 (b) What is a stack frame? Explain a commonly used layout for information in a subroutine stack frame.
4 M
2 (c) Explain shift and rotate operations, with example.
8 M

3 (a) In a situation where multiple devices capable of initiating interrupts are connected to processor, explain the implementation of interrupt priority, using individual INTER and INTA and a common INTR line to all devices.
10 M
3 (b) Define the terms 'cycle stealing' and 'block mode'.
2 M
3 (c) What is bus arbitration? Explain the different approaches to bus arbitration.
8 M

4 (a) Explain with a neat block diagram, the hardware components needed for connecting a keyboard to a processor.
8 M
4 (b) Briefly discuss the main phase involved in the operations of SCSI bus.
6 M
4 (c) Explain the tree structures of USB with split bus operation.
6 M

5 (a) Explain the internal organization of a 16 megabit DRAM chip, configured as 2M×8 cells.
8 M
5 (b) With a block diagram, explain the direct and set associative mapping between cache and main memory.
6 M
5 (c) Describe the principles of magnetic disk.
6 M

6 (a) Explain with figure the design-and working of a 16-bit carry - look - ahead adder built form 4-bit adders.
6 M
6 (b) Explain Booth algorithm. Apply Booth algorithm to multiply the signed numbers +13 and -6.
10 M
6 (c) Differentiate between restoring and non-restoring division.
4 M

7 (a) List out the actions needed to execute the instruction add(R3), R1. Write and explain sequence of control steps for the execution of the same.
10 M
7 (b) With a neat block diagram, explain hardwired control unit. Show the generation Zin and End control signals.
10 M

8 (a) State Amdahl's law. Suppose a program runs in 100 sec on a computer with multiply operation responsible for 80 sec of this time, how much it requires to improve the speed of multiplication, if the program has to run 5 times faster? Justify your answer.
6 M
8 (b) Explain the classic organization of a shared-memory multiprocessor.
6 M
8 (c) What is hardware multithreading? Explain the different approaches to hardware multithreading.
8 M



More question papers from Computer Organization
SPONSORED ADVERTISEMENTS