GK's blog: 07/10/09

Fourth Semester B.E Degree Examination (Common to CS and IS)

Model Question Paper 06CS46 Computer Organization

Note: Answer any FIVE Full questions, selecting at least TWO Questions fro each PART

Time: 3 Hours Maximum marks : 100

PART -A

1. a. Explain how the performance of a computer can be measured? What are the measures to improve the performance? (8)

b. Represent the number 81234561 in 32-bit Big-Endian and Little-Endian memory organization. (6)

c. Represent (-56)10 and (56)10 in sign magnitude, 1¡¯s complement and 2¡¯s complement methods (6)

2. a. Explain any four addressing modes with examples for each. (8)

b. What is stack frame? Illustrate the use of stack frame in the mechanism for implementing subroutines. (8)

c. Describe the use of shift and rotate operations with examples (4)

3. a. Differentiate memory mapped I/O and I/O mapped I/O. (4)

b. Describe the use of Interrupts with an example. (4)

C. Describe, how 4 devices can be connected in daisy chain method to process their interrupt requests. (4)

d. Compare programmed I/O, interrupt driven I/O and DMA based I/O (8)

4. a. Compare serial and parallel interfaces for efficiency and complexity with examples (6)

b. What are the features of SCSI bus? Write a note on arbitration and selection on SCSI bus (6)

c. Describe the split bus operation. How can it be connected to two fast devices and one slow device? (8)

PART B

5.a.Give the organisation of 1Mx32 memory using 512x8 Sram chips.Clearly show the address decoding. (8)

b. Define Hit ratio and miss penalty for cache access. (4)

c. Given a Hit ratio of 0.92, cache access time of 40ns and main memory access time of 300 ns, calculate the average access time. (4)

d. Explain direct mapped cache. (4)

6. a. Explain with block diagram how TLB is used in implementing virtual memory? (8)

b. Explain 4 bit carry-look ahead adder and use it to build a 12 bit carry-look ahead adder. (8)

c. Perform 56-78 using 1¡¯s complement and 2¡¯s complement methods. (4)

7. a. Using Booth algorithm multiply (-13) and (+107). (8)

b. Draw a circuit diagram for binary division and explain its operation (8)

c. Differentiate restoring and non-restoring division. (4)

8. a. Explain hardwired control unit with diagram. (10)

b. Write and explain control sequences for execution of the instruction SUB R1, (R4). (10)