QUESTIONBANK

CS-09- 403- COMPUTER ORGANISATION AND DESIGN

FACULTY: PRIYA K KRISHNAN

5 MARKS QUESTIONS

DEC-2006

1. Draw the layout of an instruction format and explain the need for each field?
2. Derive the expression for calculating execution time using MIPS. explain why MIPS
cannot be used a measure for comparing two machines
3. Give the format of IEEE 754 floating point standard. What is a biased notation? Show
the IEEE 754 binary representation of the number-(0.4405)10 in a single and double
precision.
4. Find the 32 bit two’s complement of the following decimal numbers -25;-40.
5. Explain how expectations are handled.
6. Draw the finite state machine for controlling memory-reference instruction and explain.
7. Explain the working of DMA.
8. Write the steps performed in executing write system call.

JUNE-2007

9. What are addressing modes? Explain any five addressing modes and show how operands
are identified in each addressing mode using a neat diagram.
10. Explain the use of synthetic benchmarks.
11. Draw the flowchart for floating point multiplication and explain.
12. Convert : (254)10 =(----)2 = (----)16
13. Explain how exceptions are handled.
14. Write the steps needed for executing a R-Type instruction.
15. State the principle of locality .Explain its importance in memory organization.
16. What are the steps that are performed in executing the write system call?

DEC-2007

17. Draw the flowchart for if statement and case statement and explain how decisions are
made using an example.
18. Classify software. Briefly explain the use of each category.
 19. Give the format of IEEE 754 floating point standard. What is a biased notation? Show the
IEEE 754 binary representation of the number – (0.254)10 in a single and double
precision.
20. Write booth multiplication algorithm.
21. Write the steps involved in creating a micro program.
22. With the help of a diagram, explain how the data path is build for a load or store that does
a register access.
23. What are the steps to be taken on a instruction cache miss?
24. Write notes on I/O performance measures.

DEC 2008

25. Classify software. briefly explain the decomposition of each class using a diagram.
26. What are bench marks? Explain the use of benchmarks in evaluating performance
27. What are carry save adders? Explain their working in detail.
28. Write the steps for multiplying two signed numbers using booth algorithm
29. What are the elements that are needed to implement R-format ALU operations and
explain how to build the data path for R-type instruction.
30. What are the disadvantages of single clock cycle implementation? Explain using
examples.
31. State principle of locality. What are the different types of locality? Explain its usage in
implementing memory hierarchy.
32. Classify Buses and describe the features of each bus.

JUNE 2009

33. Amdahl’s Law.

34. Define MIPS fields
35. Let’s try adding 610 to 710 in binary and then subtracting 610 to 710 in binary.
36. Determine the gi, pi,pi and gi values of these two 16 bit numbers.
a. 0001 1010 0011 00112
b. 1110 0101 1110 10112
Also, what is carry out (15) (C4)?
37. Define clocking methodology.
38. What are the operations of the data path?
39. Draw the basic structure of a memory hierarchy?
40. Define elaboration.

JUNE 2010

41. Explain the working of a mouse.

42. Write the syntax of if-then –else instruction and explain how it is translated to machine
code.
 43. Draw the flow chart of floating point multiplication and show the steps for multiplying
0.0101 and 0.1101.
44. Give the truth table of a full adder and write the output function of carryout and sum and
draw the logic diagram.
45. What is clocking methodology? Explain edge-triggered clocking methodology in detail
using an example
46. What are micro instructions? Give the micro instruction format. What are the different
methods that are available to choose the next micro instruction to be executed?
47. Explain the working of a disk controller
48. Explain the impact of cache performance on machine performance.

15 MARKS QUESTIONS

DEC-2006

1. Draw the block diagram of computer and explain the organization of a computer.
2. Write a procedure to find the maximum element in an array. Show how to stack is used
in parameter passing
3. Draw the flowchart of floating point addition. Explain the working of a floating point
adder with a neat diagram.
4. Explain the shift add method for multiplying numbers
5. Explain the steps in executing a LOAD instruction and R-type instruction.
6. Draw the complete finite state machine control for the data path and explain.
7. Explain how address translation is done in virtual memory
8. Explain the different ways of organizing memory blocks in cache memory.

JUNE-2007

9. Explain the working of a CRT based display device

10. Write a procedure to calculate the factorial of a number. Show how stacks are used in
parameter passing.
11. Explain the working of a carry look ahead adder.
12. Design a 4-bit ALU that performs AND, OR and addition on a and b or ā and b.
13. What are the drawbacks of a single cycle implementation? Explain the implementation of
multiple clock cycle in detail
14. Draw the complete finite state machine control for the data path and explain.
15. Explain the different methods used for transferring data between a device and memory.
 16.
a. When a DMA transfer is done between a disk and the main memory in a
computer system that has a main memory cache, there are two ways to proceed:
The transfer can go through the cache or it can bypass the cache. Discuss the
advantages and disadvantages of each choice.
b. Explain the working of a mouse.

DEC-2007

17. Discuss the salient features of various types of storage devices.

18. What are the different ways of calculating execution time? Explain the merits and
demerits of each type.
19. Draw the flowchart of floating point addition. Explain the working of a floating point
adder with a neat diagram.
20. With the help of flow charts, explain the different ways of dividing two binary numbers.
21. Explain how micro programmed control unit is designed.
22. Draw the finite state machine control with exception handling for the data path and
explain.
23. Explain the methods used for placing and replacing pages in virtual memory.
24.
a. When a DMA transfer is done between a disk and the main memory in a
computer system that has a main memory cache, there are two ways to proceed:
The transfer can go through the cache or it can bypass the cache. Discuss the
advantages and disadvantages of each choice.
b. What is the role of O.S in handling I/O? Explain

DEC-2008

25. Write a program for sorting n elements using swap procedure. Explain how parameters
are passed and how the program is translated to machine code.
26.
a. What are the major components of a computer? Explain their functions in detail.
b. What are the advantages of networked computers?
27. Explain how the operations are performed using an example:-
a. Logic operation
b. Subtraction
28. Explain the steps involved in floating point addition and multiplication using flowcharts.
29. Explain how to build a data path for a program segment with load store and branch if less
instruction
30. Explain the features of microprogramming and how it simplifies control design.
31. Discuss the various issues related to virtual memory
 32.
a. Describe the characteristics of magnetic disks.
b. Explain the different ways of increasing the bus bandwidth.

JUNE-2009

33.
a. Write short notes on
i. Measuring performance
ii. Relating the metrics
iii. Fallacies and pit falls
34. Explain about constructing on arithmetic logic unit.
35. Explain about operands of the computer hardware.
36.
a. Explain about the first version of the multiplication algorithm and hardware.
b. Apply first version multiplication algorithm for following example 4-bit number
to save space, multiply 210 X 310 or 00102 X00112
37. Write short notes on multi-cycle implementation.
38. Write short notes on exception and apply the given example. Given this instruction
sequence
4016 sub $11 $2 $4
44hex and $12 $2 $5
48hex or $13 $2 $6
4Chex add $1 $2 $1
50hex slt $15 $6 $7
54hex lw $16 50 ($7)

Assume the instruction to be invoked on an exception begin like this

40000040hex SW $25, 1000 ($0)

40000044hex SW $26, 1004 ($0)

Show what happens in pipeline if an overflow exception occurs in the add

instruction.
39. Write short notes on :
i. Inter –leaved memories
ii. Virtual memory
40. Explain about a common frame work for memory hierarchies.
JUNE 2010

41. What is a benchmark? Why it is needed? Describe the features of SPEC 95 Benchmark.
42. Give the instruction format of 8086 and explain the various addressing techniques
supported by 8086.
43. Explain the working of a carry look ahead adder.
44. Using flowcharts, explain the different methods used for dividing two numbers
45. Explain the use of finite state machine in specifying multicycle control using an example
46. Explain the steps involved in executing a store instruction and branch-on-equal
instructions
47. Explain how buses are used to connect I/O devices to processor and memory.
48.
a. Explain how a virtual address is mapped to a physical address in virtual memory.
b. Explain the various page replacement policies.