Scribd
Upload
15 views3 pages

Homework 2

Uploaded by

hoanghiep28032006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views3 pages

Homework 2

Uploaded by

hoanghiep28032006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Homework 2: Numeral Systems and Data Storage

1.

When A and B turn on

2. What bit patterns are represented by the following hexadecimal patterns


a. 5FD97 0101 1111 1101 1001 0111
b. 610A 0110 0001 0000 1010
c. ABCD 1010 1011 1100 1101
d. 0100 0100
3. Convert each of the following base 10 representations to its equivalent binary
form
a. 32 0010 0000
b. 15 1111
c. 27 0001 1011
d. 53 0011 0101

4. Convert each of the following binary representations to its equivalent base 10


form
a. 11.01 3,25
b. 101.111 5,875
c. 10.1 2,5
d. 110.011 6,375
e. 0.101 0,625
5. Express the following values in binary notation:

100.1 10.11 1.001 0.0101 101.101


6. Convert each of the following two’s complement representations to its
equivalence base 10 form
a. 00011 11100
b. 01111 10000
c. 11100 00011
d. 11010 00101
e. 00000 11111
f. 10000 01111
7. Convert to two’s complement form using patterns of 8 bits
a. 6 0000 0110
b. -6 1111 1010
c. -17 1110 1111
d. 13 0000 1101
e. -1 1111 1111
8. What are the largest and smallest numbers that can be stored if the machine
uses bit patterns of the following lengths?
a. four
b. six
c. eight

9. Convert each of the following excess eight representations to its equivalent


base 10 form without referring to the table in the slide:
a. 1110 14
b. 0111 7
c. 1000 8
d. 0010 2
e. 0000 0
f. 1001 9
10. Convert each of the following base 10 representations to its equivalent excess
eight form without referring to the table in the slide
a. 5 0000 0101
b. -5 1111 1011
c. 3 0000 0011
d. 0 0000 0000
e. 7 0000 0111
f. -8 1111 1000
11. Decode the following bit patterns using the floating-point format discussed in
the text
a. 01001010 1.010
b. 01101101 110.1
c. 00111001 0.1001
d. 11011100 -24 (10)
e. 10101011 0.0101 (dấu âm)
=-5/16 (cs 10)
When A turn on When B turn on

You might also like