Sei sulla pagina 1di 2

Question Bank UNIT II DATAPATH DESIGN 2 Marks

1.Draw the full adder circuit 2.Define Spatial expansion. 3.Define Temporal expansion. 4.Define underflow and overflow. 5.What are the disadvantages in using a ripple carry adder? 7.What is carry look ahead adder? 8.What is an ALU expansion? List out its types. 9.What is ripple-carry adder? 10.what is coprocessor? 11.What is modified Booth algorithm? (NOV/DEC 2007) (APRIL/MAY 2008) (APRIL/MAY 2008) (APRIL/MAY 2008) (NOV/DEC 2006)

6.What is pipelining and what are the advantages of pipelining?

8 or 16 Marks
1. Illustrate Booth Algorithm with an example. 2. Design a 4-bit Carry-Look ahead Adder and explain its operation with an example. (APRIL/MAY 2008) & (NOV/DEC 2007) 3. Draw the diagram of a carry look ahead adder and explain the carry look ahead adder principle. (NOV/DEC 2006) 4. Design a 4-bit binary adder/ subtractor and explain its functions. (APRIL/MAY 2008) 5. Give the algorithm for multiplication of signed 2s complement numbers and illustrate with an example. (APRIL/MAY 2008) 6. Write the algorithm for division of floating point numbers and illustrate with an example. (APRIL/MAY 2008) 7. Explain the working of a floating point adder/ subtractor.Explain how floating point additional/ subtraction is performed. (MAY/JUNE 2006) & (NOV/DEC 2006) 8. Give the IEEE standard double precision floating point format. (NOV/DEC 2006) 9. Explain the representation of floating point numbers in detail.(MAY/JUNE 2007) 10. Design a 4-stage instruction pipeline and show how its performance is improved over sequential execution.

11. Explain Booth multiplication (2s complement)algorithm and using this algorithm perform the multiplication on the following 6-bit unsigned integer 110011 * 101100. 12. Explain Robertson algorithm and using this algorithm perform the multiplication on the following 6-bit unsigned integer 10101010 * 11001110 13. Using Booth algorithm perform the multiplication on the following 6-bit unsigned integer 10110011 * 11010101 14. Using Robertson algorithm perform the multiplication on the following 6-bit unsigned integer 10110011 * 11010101 15. Explain non restoring division algorithm and using this algorithm perform the division on the following 5-bit unsigned integer 1111 / 0011. 16. With a neat block diagram explain in detail about Combinational, sequential ALU and the expansion of ALU. 17. With a neat block diagram explain in detail about the coprocessor. 18. Explain modified Booth algorithm with an example.

Potrebbero piacerti anche