Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
2Activity
0 of .
Results for:
No results containing your search query
P. 1
Digital Logic Design Morris Mano Solution

Digital Logic Design Morris Mano Solution

Ratings: (0)|Views: 115 |Likes:
Published by neetzjoshi
this is solution of morris mano
this is solution of morris mano

More info:

Published by: neetzjoshi on Feb 07, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

08/10/2013

pdf

text

original

 
1
Problem Solutions to Problems Marked With a * inLogic Computer Design Fundamentals, Ed. 2
CHAPTER 1
© 2000 by Prentice-Hall, Inc.
1-1.1-4.1-7.1-9.
a)7562/8=945 + 2/8
2945/8=118 +1/8
1118/8=14 + 6/8
614/8=1 + 6/8
61/8=1/8
10.45
×
8=3.6
30.60
×
8=4.8
40.80
×
8=6.4
60.20x8=3.2
3(7562.45)
10
=(16612.3463)
8
b)(1938.257)
10
=(792.41CA)
16
c)(175.175)
10
=(10101111.001011)
2
Decimal, Binary, Octal and Hexadecimal Numbers from (16)
10
to (31)
10
Dec16171819202122232425262728293031Bin1 00001 00011 00101 00111 01001 01011 01101 01111 10001 10011 10101 10111 11001 11011 11101 1111Oct20212223242526273031323334353637Hex101112131415161718191A1B1C1D1E1FDecimalBinaryOctalHexadecimal369.3125101110001.0101561.24171.5189.62510111101.101275.5BD.A214.62511010110.101326.5D6.A62407.6251111001111000111.101171707.5F3C7.A
1101001
( )
2
2
6
2
5
2
3
2
0
+++105==10001011.011
( )
2
2
7
2
3
2
1
2
0
2
2
2
3
+++++139.375==10011010
( )
2
2
7
2
4
2
3
2
1
+++154==
 
2
Problem Solutions – Chapter 1
1-11.
a)(673.6)
8
=(110 111 011.110)
2
=(1BB.C)
16
b)(E7C.B)
16
=(1110 0111 1100.1011)
2
=(7174.54)
8
c)(310.2)
4
=(11 01 00.10)
2
=(64.4)
8
1-15.
a) (BEE)
= (2699)
10
By the quadratic equation:
= 15 or
 
–16.27ANSWER:
= 15b) (365)
= (194)
10
By the quadratic equation:
= -9 or 7ANSWER: r = 7
1-17.
(694)
10
=(0110 1001 0100)
BCD
(835)
10
=(1000 0011 0101)
BCD
1011010010100+1000+0011+0101111111001001+0110+0110+00000001 01011 00101001
1-20.
a) (0100 1000 0110 0111)
BCD
=(4867)
10
=(1001100000011)
2
b)(0011 0111 1000.0111 0101)
BCD
=(378.75)
10
=(101111010.11)
2
1-23.
a)(101101101)
2
b)(0011 0110 0101)
BCD
c)0011 00110011 01100011 0101
ASCII
1-25.
BCD Digits with Odd and Even Parity
0123456789Odd1 00000 00010 00101 00110 01001 01011 01100 01110 10001 1001Even0 00001 00011 00100 00111 01000 01010 01101 01111 10000 1001
11
2
×
14+
1
14
0
×
+
×
2699=11
2
×
14+
×
26850=3
2
×
6+
1
×
5+
0
×
194=3
2
×
6+
×
1890=
 
1
Problem Solutions to Problems Marked With a * inLogic Computer Design Fundamentals, Ed. 2
CHAPTER 2
© 2000 by Prentice-Hall, Inc.
2-1.
a)b)c)
2-2.
a)
 X Y + XY + X
=
 X + Y 
= (
 XY+ X Y 
) + (
 X Y + XY 
)=
 X 
(
Y + Y 
) +
(
 X + X 
)
+
=
 X + Y 
Verification of DeMorgan’s Theorem
 X 
 
YZXYZXYZ
+
+
 Z 
0 000110010110 100110 11011100011101011110011111100
The Second Distributive Law
 X 
 
YZYZX+YZX+YX+
(
 X+Y 
)(
 X+Z 
)0 0000000001000100 10001000 111111110001111101011111100111111111111
 X 
 
YZYYZXZXY+YZ+XZXYYZXZXY+YZ+X
0 0000000000001010100110 10100101010 111001001110000111001101010110011100011010111100000000
 XYZXY
++=
 XYZ 
+
 X
+
( )
 X
+
( )
=
 XYYZXZ 
++
 XYYZXZ 
++=

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->