Download Model question papers & previous years question papers
|
Posted By: palaniappan Member Level: Silver Posted Date: 14 May 2008
|
2008 Anna University B.E Computer Science Computer Architecture Univarsity questions Unit - II Question paper
|
|
|
CS1251 – Computer Architecture
Question Bank
Unit – II
Note : All the following questions are from the past university exam question papers.
Part – A ( 2 Marks)
1. Define ALU. What are the various operations performed in ALU
2. Draw the symbolic representation of the full adder and give the expression for Sum and Carry.
3. Draw the full adder circuit using two half adders.
4. Draw a full adder circuit and give the truth table.
5. What are the various ways of representing signed integers in the system?
6. Discuss the principle of operation of a Carry Save Adder.
7. Discuss the principle of operation of a Carry Look Ahead Adder
8. Give the Booth recoding and bit pair recoding of the given binary number. 1000111101000101
9. What are the advantages of the Booths multiplication technique?
10. What are the advantages of Bit Pair Recoding technique?
11. Discuss the IEEE format used for representing Single / Double precision floating point numbers. (4)
12. In conforming to the IEEE standard mention any four situations under which a processor sets exception flags.
13. Why floating point number is more difficult to represent and process than integer?
14. What is the purpose of Guard bits used in floating point operation?
Part – B
1. What is the disadvantage in using a Ripple Carry Adder? (4)
2. Design a 4-bit carry look ahead adder and explain its operation with an example. (8)
3. Design a binary multiplier using sequential adder. Explain its operation. (8)
4. Explain in detail the principle of Carry Look Ahead adder. Show how 16 bit Carry Look Ahead adder can be constructed from 4 bit adders. (12)
5. Draw the diagram of a Carry Look Ahead adder and explain the Carry Look Ahead principle. (12)
6. Write about the CSA method of fast multiplication. Prove how it is faster with an example (8)
7. Draw the circuit for integer division and explain. (8)
8. Discuss the Restoring and non restoring division algorithm (8)
9. Perform the division of the 5 bit unsigned integer using non restoring / restoring division. (4)
10101 / 00101
10. Perform the multiplication of the signed 2’s complement numbers using bit pair recoding of multipliers. A=010111 B=101100 (4)
11. Give the block diagram of the hardware implementations of addition and subtraction of signed number and explain the operations with flow chart. (10)
12. Explain the representation of floating point numbers in detail. (6)
13. Explain the working of a floating point adder / subtractor. (12)
14. Explain the floating point add / subtract, multiply and divide rules with example. With a detailed flow chart explain how floating point addition / subtraction are performed. ? (16)
15. Consider a 16 bit FP number with a 6 bit exponent and 9 bit fractional mantissa where the base is 2 and the exponent is represented in excess 31 formats. Add the numbers A and B formatted as follows. A=0100001111111110 and B=0011111001010101 Give the answer in the normalized form. Remember that an implicit 1 is to the left of the binary point but not included in A and B formats. Use rounding to get the 9 bit Mantissa. (8)
16. Perform addition on the following formatted operands A=010001011011 and B=101111101010 with a five bit signed excess 15 exponent and a six bit normalized fractional mantissa. Remember that an implicit 1 is to the left of the binary point but not included in A and B formats. (6)
17. Consider that Floating point numbers are represented in a12 bit format. The scale factor has an implied base of 2 and a 5 bit excess 15 exponent with 0 and 31 signifies exact 0 and infinity respectively and a 6 bit fractional mantissa which is normalized as in IEEE format, with an implied 1 to the left of the binary point.
(a) Represent the numbers +1.7, -0.012, +19, 1/8 in this format. (b) What are the smallest and the largest numbers representable in this format? (c) How do the ranges calculated in part (b) compare to the ranges of a 12 bit signed
integer and a 12 bit signed fraction? (d) Perform Add, Subtract, Multiply and Divide operations on the operands.
A=010001011011 and B=101111101010 (16)
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and
make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.