You are on page 1of 5

Lista de exercı́cios 5: Álgebra booleana

20/11/2008

1 Desenhe os circuitos lógicos para as expressões booleanas abaixo:

1. (x01 + x2 )x3
2. x1 x2 + (x1 x2 )0
3. (x1 + x2 )0 + x1 x3
4. (x1 + x2 )0 x3 + x03
5. x01 x02 x3 + x1 x2 x03 + x1 x3
6. x1 x02 + x01 x2 x3 + x2 x03
7. (x1 x02 ) + (x01 x02 x3 ) + (x02 x03 )
8. (x01 + x2 + x03 ) x2 (x1 + x03 )
9. (x01 x02 x3 ) + (x01 x2 x3 ) + (x1 x02 x3 )
10. (x01 x02 x3 ) + (x2 x3 ) + (x1 x2 x03 )
11. (x01 x02 x4 ) + (x01 x2 x4 ) + (x2 x3 x04 ) + (x1 x3 x4 )
12. (x1 + x2 + x03 ) x3 (x01 + x2 )

2 Encontre a forma normal disjuntiva (FND) para as funções booleanas

x1 x2 f (x1 , x2 )
1 1 0
1. 1 0 0
0 1 0
0 0 1

x1 x2 f (x1 , x2 )
1 1 1
2. 1 0 0
0 1 1
0 0 0

x1 x2 x3 f (x1 , x2 , x3 )
1 1 1 0
1 1 0 1
1 0 1 1
3. 1 0 0 0
0 1 1 1
0 1 0 0
0 0 1 0
0 0 0 1

1
x1 x2 x3 f (x1 , x2 , x3 )
1 1 1 0
1 1 0 0
1 0 1 1
4. 1 0 0 1
0 1 1 0
0 1 0 1
0 0 1 0
0 0 0 0

x1 x2 x3 f (x1 , x2 , x3 )
1 1 1 0
1 1 0 1
1 0 1 0
5. 1 0 0 1
0 1 1 0
0 1 0 0
0 0 1 0
0 0 0 0

x1 x2 x3 f (x1 , x2 , x3 )
1 1 1 1
1 1 0 0
1 0 1 0
6. 1 0 0 0
0 1 1 1
0 1 0 1
0 0 1 0
0 0 0 0

x1 x2 x3 x4 f (x1 , x2 , x3 , x4 )
1 1 1 1 1
1 1 1 0 0
1 1 0 1 1
1 1 0 0 0
1 0 1 1 1
1 0 1 0 0
1 0 0 1 1
7. 1 0 0 0 0
0 1 1 1 0
0 1 1 0 0
0 1 0 1 0
0 1 0 0 0
0 0 1 1 1
0 0 1 0 1
0 0 0 1 0
0 0 0 0 0

2
x1 x2 x3 x4 f (x1 , x2 , x3 , x4 )
1 1 1 1 1
1 1 1 0 0
1 1 0 1 1
1 1 0 0 0
1 0 1 1 1
1 0 1 0 1
1 0 0 1 0
8. 1 0 0 0 0
0 1 1 1 1
0 1 1 0 0
0 1 0 1 1
0 1 0 0 0
0 0 1 1 0
0 0 1 0 0
0 0 0 1 0
0 0 0 0 0

x1 x2 x3 x4 f (x1 , x2 , x3 , x4 )
1 1 1 1 0
1 1 1 0 0
1 1 0 1 0
1 1 0 0 0
1 0 1 1 0
1 0 1 0 1
1 0 0 1 0
9. 1 0 0 0 0
0 1 1 1 1
0 1 1 0 0
0 1 0 1 1
0 1 0 0 0
0 0 1 1 1
0 0 1 0 1
0 0 0 1 1
0 0 0 0 0

x1 x2 x3 x4 f (x1 , x2 , x3 , x4 )
1 1 1 1 1
1 1 1 0 1
1 1 0 1 0
1 1 0 0 1
1 0 1 1 1
1 0 1 0 0
1 0 0 1 0
10. 1 0 0 0 0
0 1 1 1 0
0 1 1 0 1
0 1 0 1 0
0 1 0 0 1
0 0 1 1 0
0 0 1 0 0
0 0 0 1 0
0 0 0 0 0

3
3 Faça a minimização das expressões lógicas obtidas no exercı́cio 2, usando
as propriedades da álgebra de Boole.
4 Faça a minimização das expressões lógicas do exercı́cio 1, usando mapas
de Karnaugh.
5 Use um mapa de Karnaugh para encontrar a forma normal disjuntiva
para as expressões booleanas abaixo:
0 0 0 0 0 0 0 0 0 0 0 0 0 0
1. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4
0 0 0 0 0 0 0 0 0 0 0 0 0 0
2. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4

4
Gabarito:
Questão 2:
0 0
1. x1 x2
0
2. x1 x2 + x1 x2
0 0 0 0 0 0
3. x1 x2 x3 + x1 x2 x3 + x1 x2 x3 + x1 x2 x3
0 0 0 0 0
4. x1 x2 x3 + x1 x2 x3 + x1 x2 x3
0 0 0
5. x1 x2 x3 + x1 x2 x3
0 0 0
6. x1 x2 x3 + x1 x2 x3 + x1 x2 x3
0 0 0 0 0 0 0 0 0
7. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4
0 0 0 0 0 0 0
8. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4
0 0 0 0 0 0 0 0 0 0 0 0 0
9. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4
0 0 0 0 0 0 0 0 0
10. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4

Questão 3:
0 0
1. x1 x2
0 0
2. x1 x2 + x1 x2 → x1 (x2 + x2 ) → x1 . 1 → x1
0 0 0 0 0 0 0 0 0 0 0 0 0
3. x1 x2 x3 +x1 x2 x3 +x1 x2 x3 +x1 x2 x3 →(distributiva) x3 (x1 x2 +x1 x2 )+x3 (x1 x2 +x1 x2 ) →(inverso) x3 [x1 x2 +(x1 x2 ) ]+
0 0 0 0 0 0 0 0
x3 (x1 x2 + x1 x2 ) →(inverso) x3 + x3 (x1 x2 + x1 x2 ) →x3 + x3 (x1 x2 + x1 x2 )
0 0 0 0 0 0 0 0 0 0 0 0
4. x1 x2 x3 + x1 x2 x3 + x1 x2 x3 →(distributiva) x1 x2 (x3 + x3 ) + x1 x2 x3 →(inverso) x1 x2 + x1 x2 x3
0 0 0 0 0 0 0 0 0 0
5. x1 x2 x3 + x1 x2 x3 →(comutativa) x1 x3 x2 + x1 x3 x2 →(distributiva) x1 x3 (x2 + x2 ) →(inverso) x1 x3 . 1 → x1 x3
0 0 0 0 0 0 0 0
6. x1 x2 x3 + x1 x2 x3 + x1 x2 x3 →(idempotência) x1 x2 x3 + x1 x2 x3 + x1 x2 x3 + x1 x2 x3 →(distributiva) x2 x3 (x1 + x1 ) +
0 0 0
x1 x2 (x3 + x3 ) →(inverso) x1 x2 + x2 x3
0 0 0 0 0 0 0 0 0 0
7. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 →(idempotência)x1 x2 x3 x4 + x1 x2 x3 x4 +
0 0 0 0 0 0 0 0 0 0 0 0
x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 →(distributiva)x1 x2 x4 (x3 + x3 ) + x2 x3 x4 (x1 + x1 ) +
0 0 0 0 0 0 0 0 0 0 0
x1 x2 x4 (x3 + x3 ) + x1 x2 x3 x4 →(inverso)x1 x2 x4 + x2 x3 x4 + x1 x2 x4 + x1 x2 x3 x4 →(distributiva) x1 x4 (x2 + x2 ) +
0 0 0 0 0 0 0 0 0 0 0 0
x2 x3 x4 + x1 x2 x3 x4 →(inverso) x1 x4 + x2 x3 x4 + x1 x2 x3 x4 →x4 (x1 + x2 x3 ) + x1 x2 x3 x4
0 0 0 0 0 0 0
8. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 →(idempotência)x1 x2 x3 x4 + x1 x2 x3 x4 +
0 0 0 0 0 0 0 0 0
x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 →(distributiva)x1 x2 x4 (x3 + x3 ) + x1 x3 x4 (x2 + x2 ) +
0 0 0 0 0 0 0 0
x1 x2 x3 x4 + x1 x2 x4 (x3 + x3 ) →(inverso)x1 x2 x4 + x1 x3 x4 + x1 x2 x3 x4 + x1 x2 x4 →(distributiva) x2 x4 (x1 + x1 ) +
0 0 0 0 0
x1 x3 x4 + x1 x2 x3 x4 →(inverso) x2 x4 + x1 x3 x4 + x1 x2 x3 x4 →x4 [x2 + x1 x3 (1 + x2 )]
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
9. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 →(distributiva)x1 x2 x4 (x3 + x3 ) + x1 x3 x4 (x2 +
0 0 0 0 0 0 0 0 0 0 0 0 0
x2 ) + x1 x3 x4 (x2 + x2 ) →(inverso) x1 x2 x4 + x1 x3 x4 + x1 x3 x4 →(distributiva) x1 x2 x4 + x1 x4 (x3 + x3 ) →(inverso)
0 0 0
x1 x2 x4 + x1 x4
0 0 0 0 0 0 0 0 0 0 0
10. x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 + x1 x2 x3 x4 →(distributiva)x1 x3 x4 (x2 + x2 ) + x1 x2 x4 (x3 +
0 0 0 0 0 0 0 0 0
x3 ) + x1 x2 x4 (x3 + x3 ) →(inverso) x1 x3 x4 + x1 x2 x4 + x1 x2 x4 →(distributiva) x1 x3 x4 + x2 x4 (x1 + x1 ) →(inverso)
0
x1 x3 x4 + x2 x4

Questão 5:
0 0 0 0
1. x4 (x1 + x1 x2 x3 ) + x2 x3 x4
0 0 0 0 0
2. x1 x2 (x3 + x4 ) + x2 x3 (x1 + x4 )