Trabalho de Organização de Computadores
259 palavras
2 páginas
ExercíciosÁlgebra Booleana
Organização de Computadores
ATENÇÃO o símbolo # representa o operador XOR
1 Desenvolva a tabela verdade para as seguintes expressões booleanas. a) A . B . C + A . B . C
A
B
0
0
0
0
1
1
1
1
C
0
0
1
1
0
0
1
1
{T1}
A.B.C
_
_
b) A . (C + B + D)
____
0
0
0
0
0
0
0
1
0
1
0
1
0
1
0
1
[T2 ]
T1+T2
A.B.C
1
1
1
1
1
1
1
0
1
1
1
1
1
1
1
1
_ _
(C + B + D)= [T1]
A
B
C
D
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
0
0
0
0
1
1
1
1
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
_
B
1
1
1
1
0
0
0
0
1
1
1
1
0
0
0
0
_
D
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
[T1]
A.[T1]
1
1
1
1
1
0
1
1
1
1
1
1
1
0
1
1
0
0
0
0
0
0
0
0
1
1
1
1
1
0
1
1
_ _ _ _ _
c) A . B . C + A . B . C + A . B . C
[T1]
A
B
C
A.B.C
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
0
1
0
1
0
1
0
1
[T2]
_
A
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
1
_
B
1
1
0
0
1
1
0
0
_
C
1
0
1
0
1
0
1
0
[T3]
___
A.B.C
1
0
0
0
0
0
0
0
_ _
A.B.C
0
0
0
0
1
0
0
0
[T1]+[T2]+[T3]
1
0
0
0
1
0
0
1
_____
_____
_
d) (B) . (A + C) . ( A # B )
[T1]
A
B
0
0
0
0
1
1
1
1
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
_
A
A+B
1
1
1
1
0
0
0
0
0
0
1
1
1
1
1
1
[T2]
A+C
A+C
0
1
0
1
1
1
1
1
[T3]
_
A#B
1
0
1
0
0
0
0
0
1
1
0
0
0
0
1
1
[T1]+[T2]+[T3]
_
A#B
0
0
1
1
1
1
0
0
_
e) A . B + A . B
A
B
0
0
1
1
0
1
0
1
_
B
1
0
1
0
[T1]
A.B
0
0
0
1
[T2]
_
A.B
0
0
1
0
[T1]+[T2]
0
0
1
1
0
0
1
1
1
1
0
0
_________
_
_
f) A + (B + A . C) # D
[T1]
A
B
C
D
_
B
_
D
A.C
0