Multiple-Choice Test

Chapter 01.04
Binary Representation
1.
( ) ( )
2 10
? 25 =
(A) 100110
(B) 10011
(C) 11001
(D) 110010
2.
( ) ( )
10 2
? 1101 =
(A) 3
(B) 13
(C) 15
(D) 26
3.
( ) ( )
2 10
? . ? 375 . 25 =
(A) 100110.011
(B) 11001.011
(C) 10011.0011
(D) 10011.110
4. Representing 2 in a fixed point register it! 2 "its for t!e integer part and 3 "its
for t!e fra#tiona$ part gi%es a ro&nd'off error of (ost near$)
(A) '0.0*570+
(B) 0.03+2
(C) 0.1642
(D) 0.2*+2
5. An engineer or,ing for t!e Depart(ent of Defense is riting a progra( t!at
transfers non'negati%e rea$ n&("ers to integer for(at. -o a%oid o%erf$o pro"$e(s.
t!e (axi(&( non'negati%e integer t!at #an "e represented in a 5'"it integer ord is
(A) 16
(B) 31
(C) 63
(D) 64
01.04.1
01.04.2 C!apter 01.04
6. /or a n&(eri#a$$) #ontro$$ed (a#!ine. integers need to "e stored in a (e(or)
$o#ation. -!e (ini(&( n&("er of "its needed for an integer ord to represent a$$
integers "eteen 0 and 1024 is
(A) *
(B) +
(C) 10
(D) 11
/or a #o(p$ete so$&tion. refer to t!e $in,s at t!e end of t!e "oo,.