IN T S

Bi tp s 1
1. Thc hin cc php ton vi s nh phn sau y:
a. 11001 + 01101 =
Li gii:
Bt nh (carry bit)
`

1
0

1
1

0
1

0
0

1
1
Kt qu (result)

b. 10001-11101 =
Li gii:
Bt mn (borrows)
`

1
1

0
1

0
1

0
0

1
1
Kt qu (result)

c. 111 x 1001=
Li gii
`
x

1
0

1
0

1
1

Kt qu
2. Thc hin vic chuyn i c s sau:
a. (43)10 -> ( ? )2
b. (10110)2 -> (? )10
c. (237)10 -> (?)16
d. (237)8 -> (?)2 -> (?)16
e. (2007)10 -> (?)8
3. Chng minh cc phng trnh Boole sau s dng phng php bin i i s
boole. Ch r trong mi bc bin i s dng nh l hay tin g. (ch :
tin cho vic son tho vi MS word, du biu din dng ph nh ca bin thay
cho du gch ngang pha trn bin)

a. (X+Y)Z + XY=Y(X+Z)
b. ABC + BCD + BC + CD= B+CD
4. Cho cc hm sau:
F1= xyz; F2=x + yz; F3=xyz + xyz + xy; F4 = xy+xz
Hy in vo bng s tht sau v xc nh cc minterm ca cc hm
x
0
0
0
0
1
1
1
1

y
0
0
1
1
0
0
1
1

z
0
1
0
1
0
1
0
1

Ch s
0
1
2
3
4
5
6
7

F1 F2

F3 F4

5. Biu din cc hm sau di dng chun y (canonical form) v di dng

tng ca cc 1-minterm v tch ca cc 0-maxterm
H= A + AB
F= AB + BC
G=B + BC + ABC
V d: H=A+ AB = A(B+B) + AB = AB+AB + AB
H= m(0, 2, 3)
H= M(1)
6. Vi mi hm sau, xc nh cc ch s ca minterm v maxterm tng ng
a. F(X,Y,Z) = m(0, 2, 4, 6)
b. F(X,Y,Z) =M0.M1.M4.M6.M7
c. F(X,Y,Z) = m(0, 3, 6)
d. F(X,Y,Z) = M(0,1,2)
)

=> F(X,Y,Z) = m(
= > F(X,Y,Z) = m(
=> F(X,Y,Z) = M(
=> F(X,Y,Z) = m(

)
)
)