Download DBATU B.Tech 2019 Oct-Nov CSE 3rd Sem Computer Architecture & Organization Question Paper

Download DBATU (Dr. Babasaheb Ambedkar Technological University) B Tech 2019 Oct-Nov (Bachelor of Technology) CSE 3rd Sem Computer Architecture & Organization Question Paper

DR. BABASAHEB AMBEDKAR TECHNOLOGICAL UNIVERSITY, LONERE
Mid Semester Examination ? Oct 2019
Course: B. Techin CSE
V Subject Name: Computer Architecture & Organization
Max?Markszz?O Datez-07/10/2019
Sem: III
Subject Code:BTCOC304
Duration:- 1 Hr.
Instru?tions to the Students:
1. Draw the neat diagram whenever it is necessary
Q. 1 Fill in the Blanks
Course BT ? 6
Outcome Level Marks
1. 2?5 Complement representation of -10 is
' 11110110
11011001 .
11111100
9-? 9?1?
2. is not a status ?ag bit
I ?ag bit
P ?ag bit
V Z ?ag bit
S ?ag bit
999?!?
3. .............. converts the program written in assembly language into
machinc language
b. Interpreter
.c. Assembler
d. Convener
4. Range ?ofE? for normal value in single precision is ............
a. 0 b. -127 c. -1022 <= E?<= 2047
d. None of the above
5. Recoded multiplier of 101100 as per Booths maltiplication is. ..
8.. -1+1() ?1 00'
b. l 0 -1 0 +1 ?1
0. Both a and b
(1. None of above
6. In single precision format ......... bits for sign ........bits for exponent
and ....... bits for mantissa ?
a. 1,7,22
b. 1,8,23
c. 1,9,23-
d. None of above
CO 1 ,C02,
1,2
CO3

Q.2
Sol?ve Any Two ?or the following.
. . . , , 1 ~ . ' Marks
(A) Draw and Explain System bus Model of Computer System
(B) Represent the ?307. 0625 1n sihgle and double precision format C02,?CO3 2,3 I
(C) Perform the multiplication of 5*4 using un-sign multiplication algOI'ithm
Q. 3 Solve Any One of the following ' 8
Marks
(A) Di??erentiate between Restoring and Non-restoring division algorithm and-
' perme the division using both the algorithm by considering Dividend=1011
, and Divisor=0101 .CO3 2,3
(B) Solve the 5 * 4 multiplication using Booths algorithm for Sign
multiplication and Booth?s recoded multiplier algorithm. '
*** All the 8651??

This post was last modified on 21 January 2020