Professional Documents
Culture Documents
THIRD EDITION
M. MORRIS MANO
CHAPTER 1 : BINARY
SYSTEMS PROBLEMS
Octal :
16 = 8 x 2 + 8 x 0 => (16)10 = (20)8
32 = 8 x 4 + 8 x 0 => (32)10 = (40)8
20, 21, 22, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 37, 40
Hexadecimal :
16 = 16 x 1 + 16 x 0 => (16)10 = (10)16
32 = 16 x 2 + 16 x 0 => (32)10 = (20)8
10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 1A, 1B , 1C, 1D, 1E, 1F, 20
Base-12 :
10 = 12 x A => (10)10 = (A)12
26 = 12 x 2 + 12 x 2 => (26)10 = (22)12
A, B, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 1A, 1B, 20, 21, 22
(FFF)16
(4 x a + 1 x a) / (2 x a) = 5 x a
(4 + a) / 2 = 5
4 + a = 10
a=6
( 1 0 1 1 0 . 0 1 0 1 )2
4
-1 -2 -3 -4
( 1 6 . 5 )16 = 6 x 16 + 1 x 16 + 5 x (16^-1)
1
-1
(16.5)16 = 6 + 16 + (5/16)
(16.5)16 = 22.3125
( 2 6 . 2 4 )8 = 6 x 8 + 2 x 8 + 2 x (8^-1) + 4 x (8^-2)
1
-1 -2
-1
(68BE) 16
Binary form:
Octal form:
=(064276)8
(a)
1.10
10--) Convert the decimal number 345 to
binary in two ways :
Convert directly to binary;
Convert first to hexadecimal, then from
hexadecimal to binary. Which method is
faster ?
Method 1:
Number
(345)10 345
Divided by 2
Remainder
345/
345/2=172
172
172/
172/2=86
86
86/
86/2=43
43
43/
43/2=21
21
21/
21/2=10
10
10/
10/2=5
5/2=2
2/2=1
Method 2:
Number
Divided by 16
Remainder
345
345/
345/16=
16=21
21
21/
21/16=
16=1
(345)10=(159)16
(1 101 1001)2
1.11
11--) Do the following conversion problems :
(a) Convert decimal 34
34..4375 to binary .
(b) Calculate the binary equivalent of 1/3
out to 8 places.
Then convert from binary to decimal. How
close is the
result to 1/3 ?
(c) Convert the binary result in (b) into
hexadecimal. Then
convert the result to decimal . Is the answer
the same ?
(a)
34.4375
34
0.4375
34:2=17 r=0
0.4375*2=0.875 r=0
17:2=8 r=1
0.875*2=1.75
r=1
8:2=4
r=0
0.75*2=1.5
r=1
4:2=2
r=0
0.5*2=1.0
r=1
2:2=1
r=0
0*2=0
r=0
0.4375=(0.01110)2
34=(100010)2
34
34..4375=(
4375=(100010
100010..01110)
01110)2
(b) 1/3=0.3333
0.33333*2=0.66666 r=0
0.66666*2=1.33332 r=1
0.33332*2=0.66664 r=0
0.66664*2=1.33328 r=1
.
.
.
0.3333=(0.010101.)= 0+ + 0 +
1/8 + 0 + 1/32 + =~0.33333
(c)
0.010101010=0.0101 0101
0101
(0.555..)16=5/16 +5/256 +5/4096 +=~0.33203
1.12
12--) Add and multiply the following numbers
without
converting them to decimal.
(a) Binary numbers 1011 and 101 .
(b) Hexadecimal numbers 2E and 34 .
(a)
1011 (11
11))
101 (5)
+__________
10000((16
10000
16))
1011
1011((11
11))
101
101((5)
x_____
1011
0000
+ 1011
_________
110111 (55
55))
(b)
2E (46)
34 (52)
+____
62 (98)
2E
34
x____
B8
8A
+____
958(2392)
1.13
13--) Perform the following division in binary :
1011111 101 .
(1011111)2=95
(101)2=5
95/5=19 (10011)2
1011111 101
101
10011
000111
101
0101
101
0000
1.14
14--) Find the 9s
s-- and the 10
10s
s--complement of
the following decimal numbers :
(a) 98127634
00000000 .
9s comlements :
(a) 99999999-98127634=01872365
(b) 99999999-72049900=27950099
(c) 99999999-10000000=89999999
(d) 99999999-0000000=99999999
10s complements
(a)100000000- 98127634= 01872366
(b)100000000-72049900=27950100
(c)100000000-10000000=90000000
(d)100000000-0000000=00000000
1.15
15--) (a) Find the 16
16s
s--complement of AF3
AF3B .
(b) Convert AF3
AF3B to binary .
(c) Find the 2s
s--complement of the result in (b)
(d) Convert the answer in (c) to hexadecimal and
compare with the answer in (a)
(a)16
(a)
16^
^5-AF
AF3
3B=
B=50
50C
C5
(b)(AF
(b)
(AF3
3B)
B)16
16=
=1010 1111 0011 1011
(c)1010111100111011
(c)1010111100111011
0101000011000101
(d)0101
(d)
0101 0000 1100 0101
0101=
= 50
50C
C5
1.16
16--) Obtain the 1s and 2S complements of the
following binary numbers :
(a)11101010
(a)
11101010 (b)01111110
(b)01111110 (c)00000001
(c)00000001
(d)10000000
(d)
10000000 (e)00000000
(e)00000000
1s complements:
(a) 00010101 (b)
(b)10000001
10000001 (c)11111110
(c)11111110 (d)
(d)01111111
01111111
(e)11111111
(e)
11111111
2s complement :
(a) 00010110 (b)10000010
(b)10000010 (c)11111111
(c)11111111 (d)10000000
(d)10000000
(e)00000000
(e)
00000000
1.17
17--) Perform subtraction on the following
unsigned numbers using the 2s
s--complement of
the subtrahend. Where the result shoud be
negative, 10
10s
s complement it and affix a minus
sign. Verify your answers .
(a) 71887188-3049 (b)150
(b)150--2100 (c)2997
(c)2997--7992
(d)1321
(d)
1321--375
(a)7188+
(a)7188
+6951
6951=
=4139
answer is correct.
(b)150
(b)
150+
+7900=
7900=8050
correct answer=answer=-1950
(c)2997
(c)2997+
+2008=
2008=5005 correct answer=answer=-4995
(d)1321+
(d)1321
+9625
9625=
=0946
answer is correct.
1.18
18--) Perform subtraction on the following
unsigned binary numbers using the 2s
s-complement of the subtrahend. Where the result
should be negative, 2s complement it and affix a
minus sign .
(a)11011
(a)
11011--11001 (b)110100
(b)110100--10101 (c)1011
(c)1011-110000 (d)
(d)101010
101010--101011
(a)11011
(a)
11011+
+00111
00111=
=00010
00010((27
27--25
25=
=2)
(b)110100
(b)
110100+
+01011=
01011=011111
011111((52
52--21
21=
=31
31))
(c)1011
(c)1011+
+010000=
010000=011011 -100101
100101((11
11--48
48=
=-37
37))
(d)101010
(d)
101010+
+010101=
010101=111111
111111-000001
000001((42
42--43
43=
=-1)
1.19
19--) The following decimal numbers are shown
in signsign- magnitude form : +
+9826
9826 and +801
+801..
Convert them to signed 10
10s
s--complement form
and perform the following operations : (Note that
the sum is +10627
+10627 and requires six digits).
(a) (+9826
(+9826)+(+
)+(+801
801)) (b)(+9826
(b)(+9826)+(
)+(--801
801))
(c)(--9826
(c)(
9826)+(+
)+(+801
801))
(d)((d)(-9826)+(
9826)+(--801
801))
(a)009826
(a)
009826+
+00801
00801=
=010627
(b)009826
(b)
009826+
+999199
999199=
=09025
(c)990174
(c)
990174+
+000801
000801=
=990975
990975
-09025
(d)990174
(d)
990174+
+999199
999199=
=989373
989373
-10627
1.20
20--) Convert decimal +61
+61 and +27
+27 to binary
using the signedsigned-2s complement representation
and enough digits to accomodate the numbers.
Then perform the binary equivalent of (+27
(+27)) + ((61
61)) , ((- 27
27)) + (+61
(+61)) and ((-27
27)) + ((- 61
61)) .
Convert the answers back to ecimal and verify that
they are correct .
+61=0111101
+27=0011011
-61=1000011
-27=1100101
(a)27+(-61)=0011011+1000011=1011110
(b)-27+(+61)=1100101+0111101=0100010
(c)-27+(-61)=
1100101+1000011=0101000(overflow)
11100101+11000011=10101000
1.21
21--) Convert decimal 9126 to both BCD and
ASCII codes. For ASCII, an odd parity bit is to be
appended at the left .
1.22
22--) Represent the unsigned decimal numbers
965 and 672 in BCD and then show the steps
necessary to form their sum .
(1637
1637)
)10
1.23
23--) Formulate a weighted binary code for the
decimal digits using weights 6, 3, 1, 1 .
Decimal
4(0101)
0101)
7(1010)
1010)
1.24
24--) Represent decimal number 6027 in
(a) BCD,
(b) excess
excess--3 code, and (c)
2421 code .
(a)6027
(a)
6027
BCD : 0110 0000 0010 0111
(b)excess
(b)
excess3
3: 1001 0011 0101 1010
(c)(c)
(c)(c)0110
0110 0000 0010 1101
1.25
25--) Find the 9s complement of 6027 and
express it in 2421 code. Show that the result is
the 1s complement of the answer to (c) in
Problem 1.24 . This demonstrates that the 2421
code is selfself-complementing .
1.26
26--) Assign a binary code in some orderly
manner to the 51 playing cards. Use the
minimum number of bits.
2^4 =16
2^5 =32
2^6=64 6 bits are necessary.
1.27
27--) Write the expresion G. Boole in ASCII
using an eighteight-bit code. Include the period and
the space. Treat the leftmost bit of each character
as a parity bit. Each 8-bit code shouls have even
parity.
G
.
B
O
O
L
E
(01000111
01000111)(
)(00101110
00101110)) ((01000010
01000010)) ((01101111
01101111)) ((01101111
01101111)) ((01101100
01101100)) ((01100101
01100101))
1.28
28--) Decode the following ASCII code : 1001010
1100001
1101110 1100101 0100000 1000100 1101111
1100101 .
Jane
Doe
1.29
29--) The following is a string of ASCII
characters whose bit patterns have benn
converted into hexadecimal for compactness : 4A
EF 68 6E
6E 20 C4 EF E5
E5 . Of the 8 bits in each
pair of digits, the leftmost is a parity bit. The
remaining bits are the ASCII code.
01001010
J
11101111
O
(space)
1.30
30--) How many printing characters are there in
ASCII ?
How many of them are special characters (not
letters or numerals) ?
94 characters
62 of them are numbers and letters.
32 of them are special characters.
1.31
31--) What bit must be complemented to change
an ASCII letter from capital to lowercase, and
vice versa ?
1.32
32--) The state of a 12
12--bit register is
100010010111 . What is its content if it
represents
897
(9
(9-3)
564
(7
(7-3)
897
Binary Code:
100010010111
2^11
11+
+2^7+2^4+2^2+2+1=2199
1.33
33--) List the ASCII code for the 10 decimal
digits with an even parity bit in the leftmos
position.
00110000
10110001
10110010
00110011
10110100
00110101
00110110
10110111
10111000
00111001
1.34
34--) Assume a 3-input AND gate with output F
and a 3-input OR gate with output G. Inputs are
A, B, and C . Show the signals (by means of a
timing diagram) of the outputs F and G as
functions of three inputs ABC. Use all possible
combinations of ABC.
F:
A
,B
F:
A
, BX , CX
,C
AX
,B
AX
, BX
, CX
,C