NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA

Department of Computer Science and Engineering

B.Tech. Mid Semester Exam. February, 2020

Subject: Computer Organization and Architecture (CS 2002)

Full Marks: 40 Time: 2Hours

Answer all questions (1-page Question Paper).

1. Answer the following questions.

(a) How many times does a processor need to refer to memory when it fetches and executes
an indirect-address mode instruction if the instruction requires a single operand? Explain
with an example.
(b) Perform A − B, where A = 1.101010 × 25 and B = 1.111111 × 2−1 . Assume 1 guard bit, 1
round bit and 1 sticky bit, and round to the closest re-presentable number. Show all steps.
Represent the result in 32-bit IEEE-754 floating point format.
(c) Let X ( PC ) be a relative mode instruction which is stored in memory address at 620. The
branch is made to location 530. The X is 10 bits long. What is the binary value of X?
(d) Show that number of CSA levels approximately 1.7log2 n − 1.7 while multiplying two num-
bers with n bits using Carry Save Addition (CSA) technique? [2 + 4 + 2 + 2]
2. (a) Obtain the decimal values that conform the IEEE 754 floating-point format of the following
two numbers.
A = 1 10000011 11000000000000000000000
B = 0 01111110 10100000000000000000000
(b) Show the representations for the decimal numbers −720 and 0.645, which follow IEEE 754
floating-point number format. [5 + 5]
3. (a) Carry-save Addition (CSA) is a technique to speed up multiplication process. Multiply
X = 111110 with Y = 111111 using CSA technique.
(b) Analyze gate delays if 4-bit carry-look ahead adders are cascaded to add final two vectors
of CSA. Analyze gate delays if higher level (First) generate and propagate function are used
for the same purpose. Compare both the results with respect to cascaded full adders (ripple
carry).
[5 + 5]
4. (a) Divide −16 by 3 using two’s complement division technique.
(b) Multiply X (Multiplicand) with Y(Multiplier) using Booth’s algorithm. X = 01111, Y =
11010. [5 + 5]