CS220-/Cs502 Computer Organization Fall 2018 Dr. R.J. Mullick Due Tuesday Sept 1

Question

CS220-/Cs502 Computer Organization Fall 2018 Dr. R.J. Mullick Due Tuesday Sept 11,Or Wednesday Sept 12,2018 GHP #1 : Problems from Chapter 2 and 3 in Tarnoff Computer Organization and Design- some modified by RIM Be sure to show your work l What is the minimum oumber of bits neded to represent 1273 o using unsigned binary representation What is the largest possible integer than can be represented with a 6-bit unsi number? 2. gned binary 3. Convert each of the following values to decimal. Assume all are unsigned I numbers a) 1000101123 b) 011010102 CG c) 101101012 d) 010101212 Convert each of the following values to a 10-bit signed magnitude binary value. a) 6710 b) -19210 c) 23310 d) -18510 4.

Explanation / Answer

1) 1273 ==> Take logarithm of it

upper bound of ( log2 1273 ) = 11

Hence we need minimum 11 bits


2) 26 = 64 , Hence we can represent 64 numbers from 0-63

Largest being 63

3)a. 10001011 --> 128 + 0 + 0 + 0 + 8 + 0 + 2 + 1 = 139
b. 01101010 --> 0 + 64 + 32 + 0 + 8 + 0 + 2 + 0 = 106
Similary 181 and 21


4) 6710 -> 0001000011 , As its positive number so it will remain the same
-19210 -> 1011000000 , As its negative number, hence 1 at MSB

23310 -> 0011101001 , As its positive number so it will remain the same

-18510 -> 1010111001 , As its negative number, hence 1 at MSB

Thanks, PLEASE UPVOTE if helpful

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---