Вы находитесь на странице: 1из 4

# 9.3.

## Probleme cu algebre booleene,

funcii booleene i circuite logice
Problema 9.3.1.
Pentru urmtoarele funcii booleene de trei variabile, date prin
intermediul tabelelor de valori, scriei cele dou forme canonice:
conjunctiv (FCC) i disjunctiv (FCD). Simplificai funciile utiliznd
diagrame Veitch.
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

f1
0
1
0
1
1
0
0
1

f2
1
1
0
0
0
1
0
1

f3
1
1
1
0
1
0
0
0

f4
1
0
0
1
0
0
1
1

f5
0
1
1
0
0
1
1
0

f6
1
0
1
1
0
0
1
0

f7
0
0
1
0
1
1
0
1

f8
1
0
1
0
0
1
1
0

Problema 9.3.2.
Simplificai urmtoarele funcii booleene de patru variabile, date prin
formele canonice disjunctive, utiliznd diagrame Veitch:
1. f1(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
2. f2(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4;
3. f3(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4;
4. f4(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;

187

## 5. f5(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4

x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
6. f6(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
7. f7(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4;
8. f8(x1,x2,x3,x4)= x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4
x1x2x3x4
x1x2x3x4 x1x2x3x4 x1x2x3x4 x1x2x3x4.
Problema 9.3.3.
Simplificai urmtoarele funcii booleene de trei variabile, date prin
mintermii expresiilor, utiliznd diagrame Karnaugh:
1. f1(x1,x2,x3)= m0 m3 m4 m5 m6 m7;
2. f2(x1,x2,x3)= m1 m2 m4 m5 m6 m7;
3. f3(x1,x2,x3)= m1 m2 m3 m4 m5 m7;
4. f4(x1,x2,x3)= m0 m1 m2 m3 m5 m6;
5. f5(x1,x2,x3)= m0 m1 m2 m4 m6 m7;
6. f6(x1,x2,x3)= m0 m1 m3 m5 m6 m7;
7. f7(x1,x2,x3)= m0 m1 m2 m3 m4 m7;
8. f8(x1,x2,x3)= m0 m2 m3 m4 m5 m6.
Problema 9.3.4.
Utiliznd metoda lui Quine simplificai urmtoarele funcii booleene
de trei variabile:
2. f2(x1,x2,x3)= x3(x1 x2)
1. f1(x1,x2,x3)= x1( x2x3)
x1x2;
(x2x3);

188

x2x3;

(x1x3);

x1x3;

(x1x2);

## 8. f8(x1,x2,x3)= x3(x1 x2)

x1x2;

(x1x3).

Problema 9.3.5.
Simplificai urmtoarele funcii booleene de patru variabile date prin
valorile de 1, utiliznd metoda lui Quine:
1. f1(1,1,1,1)=1, f1(1,1,0,1)=1, f1(0,1,1,1)=1, f1(1,1,0,0)=1,
f1(0,1,0,0)=1, f1(0,0,0,0)=1, f1(0,0,0,1)=1, f1(0,0,1,1)=1;
2. f2(1,1,0,1)=1, f2(0,1,0,1)=1, f2(0,1,0,0)=1, f2(0,0,0,0)=1,
f2(0,0,1,0)=1, f2(1,0,1,1)=1, f2(1,0,0,1)=1, f2(0,0,1,1)=1;
3. f3(0,1,0,1)=1, f3(0,1,0,0)=1, f3(0,1,1,0)=1, f3(1,0,1,0)=1,
f3(1,0,0,0)=1, f3(0,0,1,0)=1, f3(1,0,0,1)=1, f3(0,0,0,1)=1;
4. f4(0,1,0,1)=1,
f4(0,1,1,0)=1,
5. f5(1,1,1,1)=1,
f5(1,1,0,0)=1,
6. f6(1,1,0,1)=1,
f6(0,1,1,0)=1,
7. f7(1,1,1,1)=1,
f7(0,1,1,0)=1,
8. f8(1,1,1,1)=1,
f8(0,0,0,0)=1,

f4(0,1,1,1)=1,
f4(1,0,0,0)=1,
f5(0,1,0,1)=1,
f5(1,0,0,0)=1,
f6(0,1,0,1)=1,
f6(1,0,1,0)=1,
f7(1,1,0,1)=1,
f7(0,0,1,0)=1,
f8(1,1,1,0)=1,
f8(0,0,1,0)=1,

f4(1,1,1,0)=1,
f4(0,0,0,0)=1,
f5(0,1,1,1)=1,
f5(1,0,0,1)=1,
f6(0,1,1,1)=1,
f6(1,0,1,1)=1,
f7(0,1,0,1)=1,
f7(1,0,1,1)=1,
f8(1,1,0,0)=1,
f8(1,0,1,1)=1,

f4(1,1,0,0)=1,
f4(0,0,0,1)=1;
f5(1,1,1,0)=1,
f5(0,0,0,1)=1;
f6(1,1,1,0)=1,
f6(1,0,0,1)=1;
f7(0,1,0,0)=1,
f7(0,0,1,1)=1;
f8(1,0,0,0)=1,
f8(0,0,1,1)=1.

Problema 9.3.6.
Simplificai urmtoarele funcii booleene de trei variabile date prin
zerourile acestora, utiliznd metoda lui Quine:
1. f1(0,1,0) = f1(0,1,1) = f1(1,0,1) = 0;
2. f2(0,0,0) = f2(0,0,1) = f2(1,1,1) = 0;
3. f3(0,0,1) = f3(0,1,0) = f3(1,1,0) = 0;
4. f4(0,0,0) = f4(0,1,1) = f4(1,0,0) = 0;
5. f5(0,0,0) = f5(1,1,0) = f5(1,1,1) = 0;
6. f6(0,1,0) = f6(1,0,0) = f6(1,0,1) = 0;
7. f7(0,1,1) = f7(1,0,0) = f7(1,1,1) = 0;
8. f8(0,0,1) = f8(1,0,1) = f8(1,1,0) = 0.
Problema 9.3.7.
Simplificai urmtoarele funcii booleene de patru variabile utiliznd i
diagram Karnaugh:
1. f1(x1,x2,x3,x4)= x1x4 x1x2x3x4 x1x2x4 x1x3 x3x4;

189

2.

3.

4.

5.

6.

7.

8.

## f8(x1,x2,x3,x4)= x3x4 x1x2x3x4 x2x3x4 x1x3 x1x4.

Problema 9.3.8.
Desenai circuitul logic asociat funciei booleene de mai jos,
simplificai funcia i desenai circuitele logice corespunztoare tuturor
formelor simplificate ale funciei, utiliznd doar pori de baz:
1. f1(x, y, z) = x (y z) y (x z) x ( y z) (x y)z ;
2.
3.
4.
5.

## f2(x, y, z) = x (yz) x (y z) y (x z);

f3(x, y, z) = x (y z) y (x z) x ( y z) (x y) z ;
f4(x, y, z) = x (y z) x (y z) y (x z) ;
f5(x, y, z) = x (y z) y (x z) x ( y z) (x y) z ;

7.

f6(x, y, z) = x ( y z) x (y z) y (x z);
f7(x, y, z) = x (y z) y (x z) x (y z) (x y) z ;

8.

f8(x, y, z) = x ( yz) x ( y z) y ( x z) .

6.

Problema 9.3.9.
Desenai un circuit logic avnd trei variabile de intrare i coninnd toate
porile de baz i derivate. Scriei funcia boolean corespunztoare i
simplificai-o, iar apoi desenai un circuit logic simplificat.
Problema 9.3.10.
Pentru o funcie boolean de 4 variabile, dat prin intermediul tabelei
sale de valori, scriei expresia corespunztoare formei canonice disjunctive,
aplicai o metod de simplificare i desenai circuitele logice ale tuturor
formelor sale simplificate.

190