Trabalho Sistemas Digitais

Centro Universitário de Brasília - Departamento de Ciência da Computação 2023

Autores:

● Giovanna Barbosa
● Sammuel Augusto
● Vitor Pasqualotto
● Matheus Brandão
● Marlon Paganotto
● Rodrigo Crizostimo
● Richard Oliveira
● Ryan dos Santos
● Fernanda Kikuchi
● Daniel Campos

QUESTÕES:

1. Determine as expressões booleanas dos circuitos abaixo:

Resposta:

1) A + B
2) 𝐴 ・𝐶
3) (𝐵 + 𝐷)
4) 1 + 2 => (A + B) ・(𝐴 ・ 𝐶)
5) 4 + 3 => [(𝐴 + 𝐵)・(𝐴・𝐶) + (𝐵 + 𝐷)] = S

Resposta:

1) B・ 𝐷
2) 𝐶・D
3) C・D
4) 𝐴+C
5) 𝐵・ 𝐷
6) 1+A => [(𝐵・𝐷) + 𝐴]
7) 2+3 => (𝐶・D)+(C・D)
8) 4+5 => (𝐴・C)・(𝐵・ 𝐷)
 9) 6+7 => {[(𝐵・𝐷) + 𝐴]・[(𝐶・𝐷) + (𝐶・𝐷)]}
10)8+C => [(𝐴・𝐶)・(𝐵・𝐷) + 𝐶]
11) 9+10 => {[(𝐵・𝐷) + 𝐴]・[𝐶・𝐷) + (𝐶・𝐷) + (𝐶・𝐷)]} ・[(𝐴・𝐶)・(𝐵・𝐷) + 𝐶] = 𝑆

Resposta:

1) B ⊕ D
2) A・𝐶・D
3) 𝐴𝐵𝐶
4) 2 + 3 => (𝐴𝐶𝐷)・(𝐴𝐵𝐶)
5) C + 4 =>[𝐶 + (𝐴𝐶𝐷・𝐴𝐵𝐶)]
6) 3 + D => [𝐷 + (𝐴𝐵𝐶)]
7) 1 + 5 + 6 => [(𝐵⊕𝐷) + 𝐶 + (𝐴𝐶𝐷・𝐴𝐵𝐶) + 𝐷 + (𝐴𝐵𝐶)]

2. Escreva a expressão booleana e monte a tabela-verdade do circuito abaixo:

Resposta:

1) 𝐴・𝐵
2) (𝐶・𝐷)
3) [(𝐴・𝐵) + (𝐶・𝐷)]

Resposta, 2:

A B C D 𝐷 A*B (𝑎 ・ 𝑏) C・𝐷 (𝐶 * 𝐷) 1+2 3

0 0 0 0 1 0 1 0 1 1 0

0 0 0 1 0 0 1 0 1 1 0

0 0 1 0 1 0 1 1 0 1 0

0 0 1 1 0 0 1 0 1 1 0

0 1 0 0 1 0 1 0 1 1 0

0 1 0 1 0 0 1 0 1 1 0

0 1 1 0 1 0 1 1 0 1 0

0 1 1 1 0 0 1 0 1 1 0

1 0 0 0 1 0 1 0 1 1 0

1 0 0 1 0 0 1 0 1 1 0

1 0 1 0 1 0 1 1 0 1 0

1 0 1 1 0 0 1 0 1 1 0

1 1 0 0 1 1 0 0 1 1 0

1 1 0 1 0 1 0 0 1 1 0

1 1 1 0 1 1 0 1 0 0 1
 1 1 1 1 0 1 0 1 0 0 1

3. Determine a expressão booleana a partir da tabela abaixo e desenhe o circuito:

1)(𝑎𝑏𝑐)
4)𝐴BC
5)𝐴𝐵C
8)ABC

S = (𝑎𝑏𝑐)・𝐴BC・𝐴𝐵C・ABC

4.Desenhe os circuitos e monte a tabela-verdade das expressões booleanas abaixo:

a)
B) S=(A⊙B)·[(𝐴·𝐵 + (𝐵 + 𝐷) + 𝐶·𝐷 + (𝐵 · 𝐶)]+𝐴·B·𝐶·D

C)
D)
E)S=(B⊕D)·[𝐴 + 𝐵·(𝐶 + 𝐷) + 𝐴·𝐵·]
F) S = {[A · B + C] ⊕ [A + B]} ⊙ C

5). Desenhe o circuito que executa a expressão abaixo, somente com portas NAND (NE).
8. Escreva a expressão booleana e desenhe o circuito que executa a tabela abaixo:

Resposta:
Expressão booleana: S = ( 𝐴* 𝐵 * 𝐶 * 𝐷) + (𝐴* 𝐵 * C * 𝐷) + ( 𝐴 * 𝐵 * 𝐶 * 𝐷) + (A * 𝐵 *
𝐶 * D) + (A * B *𝐶 * 𝐷) +(A * B* C * D)

Circuito:

9. Desenhe o sinal da sa ́ıda S do circuito abaixo:

A B C S

1 0 1 1

0 0 1 0

1 1 0 0

1 0 1 1

0 1 0 0

0 0 1 0

1 1 0 0

1 0 1 1

10. Prove que: A ⊙ (B ⊕ C) = A ⊕ (B ⊙ C)

Desenvolvimento:
 I. Tabela da porta XOR (⊕):
A B A⊕B

0 0 0

0 1 1

1 0 1

1 1 0

II. Tabela da porta NAND (⊙):

A B A⊙B

0 0 1

0 1 1

1 0 1

1 1 0

III. Verificação de igualdade:

A B C B⊕ C A ⊙ (B ⊕ C) A ⊕ (B ⊙ C)

0 0 0 0 1 1

0 0 1 1 0 0

0 1 0 1 0 0

0 1 1 0 1 1

1 0 0 0 1 1

1 0 1 1 0 0

1 1 0 1 0 0

1 1 1 0 1 1
 11. Esquematize o circuito da figura abaixo apenas com portas NOR (NOU).

Tabela verdade do circuito:

A B C D ~A ~C B⊕D A . ~C . D ~(A . ~C . D) ~A + B + ~C ~(~A+b+~c) ~(~(~A+b+~c)

.D . D)

1 1 1 1 0 0 0 0 1 1 0 0

1 1 1 0 0 0 1 0 1 1 0 0

1 1 0 1 0 1 0 1 0 1 0 0

1 1 0 0 0 1 1 0 1 1 0 0

1 0 1 1 0 0 1 0 1 0 1 1

1 0 1 0 0 0 0 0 1 0 1 0

1 0 0 1 0 1 1 1 0 1 0 0

1 0 0 0 0 1 0 0 1 1 0 0

0 1 1 1 1 0 0 0 1 1 0 0
 0 1 1 0 1 0 1 0 1 1 0 0

0 1 0 1 1 1 0 0 1 1 0 0

0 1 0 0 1 1 1 0 1 1 0 0

0 0 1 1 1 0 1 0 1 1 0 0

0 0 1 0 1 0 0 0 1 1 0 0

0 0 0 1 1 1 1 0 1 1 0 0

0 0 0 0 1 1 0 0 1 1 0 0

~(A . ~C . D) + ~(~(A . ~C . D) + ~(~(A . ~C . D) + Conjunto Solução

~(~A + B + ~c) ~(~A + B + ~c)) ~(~A + B + ~c)) . C (~(~(A . ~C . D) +
~(~A + B + ~c)) . C) + (B ⊕ D) + (~(~(~A+b+~c)
. D))

1 0 0 1

0 1 0 1

1 0 0 1

1 0 0 1

1 0 0 1

0 1 0 1

1 0 0 1

1 0 0 1

1 0 0 1

1 0 0 1

1 0 0 1
1 0 0 1

1 0 0 1

1 0 0 1

1 0 0 1

1 0 0 1

Esquematização com portas NOR (Resposta):

2) Simplificação de Expressões Booleanas

1.Simplifique cada expressão,utilizando ÁLGEBRA DE BOOOLE

A) S=A·B·𝐶+𝐴·𝐵·C+A·B·C+𝐴·B·C+𝐴·B·𝐶

A · B · 𝐶 + A · B · C:

A · B:

A · B · 𝐶 + A · B · C = A · B · (𝐶 + C)

𝐶+ C = 1

A · B · 𝐶+ A · B · C = A · B

𝐴 · 𝐵· C + 𝐴 · B · C:

𝐴 · C:
𝐴· C + 𝐴 · B · C = 𝐴 · ( 𝐵· C + B · C)

B' · C + B · C = C

𝐴·𝐵·C+𝐴·B·C=𝐴·C

𝐴 · B · C + 𝐴· B · 𝐶:

𝐴 · B:

𝐴 · B · C + 𝐴 · B · 𝐶 = 𝐴 · B · (C + 𝐶)

C+𝐶=1

𝐴· B · C + 𝐴 · B · 𝐶 = 𝐴 · B

S=A·B+𝐶·C+𝐴·B

B) S = A·B·𝐶·D+𝐴·𝐵·C·𝐷+A·B·𝐶·𝐷+𝐴·B·C·𝐷+A·B·C·𝐷+A·𝐵·C·𝐷+A·B·C·D

S = A · B · 𝐶 · D + A · B · C ·𝐷' + 𝐴 · 𝐵 · C · 𝐷 + 𝐴 · B · C · 𝐷 + A · 𝐵 · C · 𝐷 + A · B · C · D

A · B · 𝐶 · D + A · B · C · 𝐷:

A · B · D:

A · B · 𝐶 · D + A · B · C · 𝐷 = A · B · (𝐶 · D + C · 𝐷)

𝐶·D+C·𝐷=D

A·B·𝐶·D+A·B·C·𝐷=A·B·D

𝐴 · 𝐵 · C · 𝐷 + 𝐴· B · C · 𝐷 + A · 𝐵 · C · 𝐷:

C · 𝐷:

𝐴 · 𝐵 · C · 𝐷 + 𝐴 · B · C · 𝐷 + A · 𝐵 · C · 𝐷 = 𝐴 . 𝐵+ 𝐴 · B + A · 𝐵) · (C · 𝐷)
𝐴 . 𝐵 + 𝐴· B + A · 𝐵 = (𝐴+ A) · (𝐵 + B) = 1

𝐴 . 𝐵· C · 𝐷 + 𝐴· B · C · 𝐷 + A · 𝐵· C ·𝐷 = C · 𝐷

A · B · C · D:

S = A · B · D + C · 𝐷 + A · 𝐵 · C ·𝐷

c) S=[(𝐵 + 𝐶 + 𝐷 ) (𝐴 + 𝐵 + 𝐶 ) + 𝐴 · 𝐵 · 𝐶 + 𝐵 ]+A·B·C+B·(𝐴 · 𝐶)

(𝐵 + 𝐶 + 𝐷 )= 𝐵 · 𝐶 · 𝐷 =B·C·D

(𝐴 + 𝐵 + 𝐶 ):

(𝐴 + 𝐵 + 𝐶 ) = 𝐴 · 𝐵 · 𝐶 = A · 𝐵 · 𝐶

[ (𝐵 + 𝐶 + 𝐷 ) (𝐴 + 𝐵 + 𝐶 ) + 𝐶 ]:

[(𝐵 + 𝐶 + 𝐷) (𝐴 + 𝐵 + 𝐶) + 𝐶 ] = [ (𝐵 · 𝐶 · 𝐷) · (𝐴 · 𝐵 · 𝐶) = [(𝐵 · 𝐶 · 𝐷) · (𝐴 · 𝐵 · 𝐶 )]
[( 𝐵 · 𝐶 · 𝐷) · (𝐴 · 𝐵 · 𝐶 )] = ( 𝐵 · 𝐶 · 𝐷) + ( 𝐴 · 𝐵 · 𝐶 ) = ( 𝐵 + 𝐶 + 𝐷) + (𝐴 + B + C)

𝐴 . 𝐵 · C:

𝐵 · (𝐴 + 𝐶):

𝐵 · (𝐴 + 𝐶) = 𝐵 · (𝐴 · 𝐶) = 𝐵 · 𝐴 · 𝐶

S= [ (𝐵 + 𝐶 + 𝐷) (𝐴 + 𝐵 + 𝐶)] +𝐴 · 𝐵 · C + 𝐵 · 𝐴 · 𝐶

d) S =A · [𝐵 · (𝐶 + 𝐷) + 𝐴 · (𝐵 + 𝐶) ] + C· 𝐷 +A · 𝐵 · C +A·B

(𝐶 + 𝐷:

(𝐶 + 𝐷 = 𝐶· 𝐷
(𝐵 + 𝐶):

(𝐵 + 𝐶)= 𝐵 · 𝐶

𝐵 · (𝐶· 𝐷) + 𝐴 · (𝐵 · 𝐶):

𝐵· (𝐶· 𝐷) + 𝐴 · (𝐵 · 𝐶) = (𝐵 + 𝐴 ) · ( 𝐶 · 𝐷 + 𝐶)

A · [(𝐵 + 𝐴 ) · ( 𝐶 · 𝐷 + 𝐶)]:

[(𝐵 + 𝐴 ) · ( 𝐶 · 𝐷 + 𝐶)] = (𝐵 + 𝐴 )+ ( 𝐶 · 𝐷 + 𝐶)] = (B · A) + (𝐶 + D) · (C + 𝐷)

C·𝐷:
A · 𝐵 · C:

A · B:

S = (B · A) + (𝐶 + D) · (C + 𝐷) + C · 𝐷 + A · 𝐵 · C + A · B

e) S = (𝐴 ⊕ 𝐵 + 𝐵 · 𝐶 · 𝐷) · [𝐷 + 𝐵 · 𝐶 + 𝐷 · (𝐴 + 𝐵)] + 𝐴 · 𝐷

(A ⊕ B):

(A ⊕ B) = (𝐴 · 𝐵 + 𝐴 · 𝐵 )

(𝐵 · C · 𝐷):

(𝐴 · B):

(𝐴 + 𝐵):

(𝐴 + 𝐵) = A · 𝐵

[𝐷 + 𝐵 · C + D · (𝐴 + 𝐵)]:

[𝐷 + 𝐵 · 𝐶 + 𝐷 · (𝐴 + 𝐵)] = (𝐷 · (𝐵 + 𝐶) · (𝐷 + (𝐴 · 𝐵 ))

𝐴·𝐷:
S = [(𝐴 · 𝐵 + 𝐴 ·𝐵 ) + (𝐵 · 𝐶 · 𝐷)] · [(𝐷 · ( 𝐵 + 𝐶) · (𝐷 + (𝐴 · 𝐵 ))] + 𝐴 · 𝐷

f) S = (𝐴 · 𝐵 + 𝐶 · 𝐷 + 𝐴 · 𝐷) · {(𝐵) · [(𝐶 ⊕ 𝐷 + 𝐴) · (𝐵 + 𝐶) + 𝐴 · 𝐵] + 𝐴}

(𝐴 · B + C · 𝐷 + A · D):

(𝐵 ):

(𝐵 ) = B

(C ⊕ D + A):

(𝐵 + 𝐶):

[(𝐶 ⊕ 𝐷 + 𝐴) · (𝐵 + 𝐶) + 𝐴 ·𝐵 ]:

[(𝐶 ⊕ 𝐷 + 𝐴) · (𝐵 + 𝐶) + 𝐴 · 𝐵 ] = [(𝐶 ⊕ 𝐷 + 𝐴) + (𝐵 + 𝐶) + (𝐴 · 𝐵)]

𝐴:

S = (𝐴 · 𝐵 + 𝐶 · 𝐷 + 𝐴 · 𝐷) · [(B) · [(𝐶 ⊕ 𝐷 + 𝐴) + (𝐵 + 𝐶) + (𝐴 · 𝐵)] + 𝐴 ]

g) S = {(𝐴 + 𝐵) · {𝐵 + (𝐵 ⊕ 𝐶) · [𝐴 · 𝐵 · 𝐶 + 𝐵 · (𝐴 + 𝐷) + 𝐵 · 𝐶 + 𝐵 · 𝐷] + 𝐴𝐵𝐷}

(B ⊕ C):

(B ⊕ C) = (𝐵 · 𝐶 + 𝐵 · 𝐶)

(𝐴 · B · 𝐶 + B · (𝐴 + 𝐷) + B · 𝐶 + 𝐵 · D):

(𝐵 + (𝐵 · 𝐶 + 𝐵 · 𝐶 )):

(𝐵 + (𝐵 · 𝐶 + 𝐵 · 𝐶)) = (𝐵· (𝐵 + 𝐶 ) · (𝐵 + 𝐶))

(𝐵 + (𝐵 · 𝐶 + 𝐵 · 𝐶 ) · (𝐵 · (𝐵 + 𝐶 ) · (𝐵 + 𝐶)) + ABD):

(𝐵 + (𝐵 · 𝐶 + 𝐵 · 𝐶 ) · (𝐵 · (𝐵 + 𝐶 ) · (𝐵 + 𝐶)) + 𝐴𝐵𝐷) = (𝐵· (𝐵 + 𝐶 ) · (𝐵 + 𝐶) + 𝐴𝐵𝐷)

(𝐴 + B):

S = (𝐴 + 𝐵) · {(𝐵 · (𝐵 + 𝐶 ) · (𝐵 + 𝐶) + 𝐴𝐵𝐷)}

2. Simplifique a expressão abaixo, depois, desenhe o circuito da expressão simplificada

obtida.

Desenvolvimento:

● S = (𝐵 + 𝐷) · {𝐵 + 𝐶 ⊕ 𝐷 + 𝐴 · [𝐵 · 𝐶 + 𝐵· 𝐶 + 𝐴 + 𝐵 · (𝐶 + 𝐷)]}

● S = (𝐵 + 𝐷) · {𝐵 + C ⊕ D + 𝐴 · [𝐵 · 𝐶 + 𝐵· 𝐶 + 𝐴 + 𝐵 · (𝐶 + 𝐷)}

● S = (𝐵 + 𝐷) · {𝐵 + C ⊕ D + [𝐵 · 𝐶 + 𝐵· 𝐶 + 𝐴 + 𝐵 · (𝐶 + 𝐷)]}

● S = (𝐵 + 𝐷)· {𝐵 + C ⊕ D + [B · 𝐶 + 𝐵 · C + A] + [B · 𝐶 + 𝐵· (𝐶 + 𝐷)]}

● S = (𝐵 + 𝐷) · {𝐵 + C ⊕ D + B · 𝐶 + 𝐵· C + A + B · 𝐶 + 𝐵 · (𝐶 + 𝐷)}

● S = (𝐵 + 𝐷) · {𝐵 + 𝐵 · C + A + 𝐵· (𝐶 + 𝐷)}

● S = (𝐵 + 𝐷) · {𝐵 + A + 𝐵· (𝐶 + 𝐷))'}
Circuito simplificado:

3. Demonstre (através de expressão booleana) que:

A ⊙ (B ⊕ C) = A ⊕ (B ⊙ C)

Desenvolvimento:

A ⊙ (B ⊕ C) = A ⊕ (B ⊙ C)

A ⊙ (B ⊕ C) = A ⊕ (𝐵 ⨁ 𝐶)

A ⊙ (B ⊕ C) = A ⊕ (𝐵 ⨁ 𝐶)

A ⊙ (B ⊕ C) = A ⊕ (𝐵 ⨁ 𝐶)

A ⊙ (B ⊕ C) = A ⊕ (𝐵 ⨁ 𝐶)

A ⊙ (B ⊕ C) = A ⊕ (𝐵 ⊕ C)

Agora, temos a expressão A ⊕ (B ⊙ C) = A ⊙ (B ⊕ C). Portanto são equivalentes

4. Através de Mapa de Veitch-Karnaugh, determine as expressões simplificadas de:
a)S1 e S2 e a tabela-verdade abaixo:

A B
S1 S2

0 0 1 1

0 1 0 1
 1 0 1 0

1 1 1 0

Resposta:

𝐵 B

𝐴 1 0

A 1 1

S1 = A+𝐵

𝐵 𝐵

𝐴 1 1

A 0 0
S2 = 𝐴

b)S1, S2, S3 e S4 da tabela-verdade abaixo:

A B C
S1 S2 S3 S4

0 0 0 1 1 0 0

0 0 1 0 1 1 1

0 1 0 1 1 0 1

0 1 1 1 0 0 0

1 0 0 1 1 1 1

1 0 1 1 1 1 0

1 1 0 0 1 1 1

1 1 1 1 0 0 1

Resposta:

𝐵 𝐵 B B

𝐴 1 0 1 1

A 1 1 1 0
 𝐶 C C 𝐶
S1 = 𝐵𝐶 + AC + 𝐴B

𝐵 𝐵 B B

𝐴 1 1 0 1

A 1 1 0 1

𝐶 C C 𝐶
S2 = 𝐵 + 𝐶

𝐵 𝐵 B B

𝐴 0 1 0 0

A 1 1 0 1

𝐶 C C 𝐶
S3 = 𝐵C + A𝐶

𝐵 𝐵 B B

𝐴 0 1 0 1

A 1 0 1 1

𝐶 C C 𝐶
S4 = 𝐴𝐵C + B𝐶 + AB + A𝐶

c)S1, S2, S3 e S4 da tabela-verdade abaixo:

A B C D
S1 S2 S3 S4

0 0 0 0 1 1 0 0

0 0 0 1 1 0 0 0

0 0 1 0 1 1 1 0
 0 0 1 1 1 0 0 1

0 1 0 0 1 1 1 1

0 1 0 1 0 1 1 1

0 1 1 0 0 1 1 0

0 1 1 1 1 1 0 1

1 0 0 0 1 1 0 0

1 0 0 1 1 1 0 1

1 0 1 0 1 0 1 0

1 0 1 1 1 0 0 0

1 1 0 0 1 0 0 0

1 1 0 1 0 1 1 1

1 1 1 0 0 0 0 1

1 1 1 1 1 1 0 1

Resposta:

𝐶 𝐶 C C

𝐴 1 1 1 1 𝐵

𝐴 1 0 1 0 B

A 1 0 1 0 B

A 1 1 1 1 𝐵

𝐷 D D 𝐷
S1 = 𝐴𝐵 + 𝐶𝐷 + AB + CD

𝐶 𝐶 C C

𝐴 1 0 0 1 𝐵

𝐴 1 1 1 1 B

A 0 1 1 0 B

A 1 1 0 0 𝐵
 𝐷 D D 𝐷
S2 = 𝐴B + BD + A𝐵𝐶 + 𝐴𝐵𝐷

𝐶 𝐶 C C

𝐴 0 0 0 1 𝐵

𝐴 1 1 0 1 B

A 0 1 0 0 B

A 0 0 0 1 𝐵

𝐷 D D 𝐷
S3 = 𝐴B𝐶 + B𝐶D + 𝐴𝐶𝐷 + 𝐵C𝐷

𝐶 𝐶 C C

𝐴 0 0 1 0 𝐵

𝐴 1 1 1 0 B

A 0 1 1 1 B

A 0 1 0 0 𝐵

𝐷 D D 𝐷
S4 = BD + 𝐴B𝐶 + A𝐶D + ACB + 𝐴CD

5. Simplifique as expressões abaixo utilizando Mapas de Veitch-Karnaugh.

𝐵 𝐵 B B

𝐴 1
 A 1 1 1

𝐶 C C 𝐶
S = 𝐴B𝐶 + A𝐵 + AC

𝐶 𝐶 C C

𝐴 1 1 1 𝐵

𝐴 1 B

A 1 1 B

A 1 1 𝐵

𝐷 D D 𝐷
S = 𝐴𝐵C + BCD + A𝐶D + A𝐵𝐶 + 𝐴𝐵𝐶𝐷

𝐶 𝐶 C C

𝐴 1 1 1 1 𝐵

𝐴 1 1 1 1 B

A B

A 1 1 1 𝐵

𝐷 D D 𝐷
S = 𝐴 + A𝐵C + A𝐵𝐶𝐷

𝐶 𝐶 C C

𝐴 1 𝐵

𝐴 1 1 1 B
 A 1 1 1 1 B

A 1 1 𝐵

𝐷 D D 𝐷
S = B𝐶 + CD + AC

6. Prove que:

De acordo com as propriedades de simplificação de expressões booleanas, as portas da placa

XOR correspondem às portas da XNOR negadas.

XOR:
A B S

0 0 0

0 1 1

1 0 1

1 1 0

XNOR:

A B S

0 0 1

0 1 0

1 0 0

1 1 1

7. Simplifique as expressões:
a)S1 e S2 da tabela-verdade:

A B C
S1 S2
 0 0 0 X 1

0 0 1 0 X

0 1 0 1 0

0 1 1 X 0

1 0 0 1 0

1 0 1 X 1

1 1 0 X X

1 1 1 1 X

Resposta:

𝐵 𝐵 B B

𝐴 X 0 X 1

A 1 X 1 X

𝐶 C C 𝐶
S1 = A + B

𝐵 𝐵 B B

𝐴 1 X 0 0

A 0 1 X X

𝐶 C C 𝐶
S2 = 𝐴𝐵 + AC

b) S1, S2, S3 e S4 da tabela-verdade abaixo:

A B C D
S1 S2 S3 S4

0 0 0 0 1 X 0 X
 0 0 0 1 X X 0 0

0 0 1 0 X 1 0 X

0 0 1 1 X 0 1 1

0 1 0 0 1 X X 1

0 1 0 1 0 1 X X

0 1 1 0 X 0 1 0

0 1 1 1 X 1 0 1

1 0 0 0 X 1 X 0

1 0 0 1 1 0 1 1

1 0 1 0 X X 0 0

1 0 1 1 1 1 0 X

1 1 0 0 X 0 1 1

1 1 0 1 X 1 0 1

1 1 1 0 1 1 X 1

1 1 1 1 0 X 1 X

Resposta:

𝐶 𝐶 C C

𝐴 1 X X X 𝐵

𝐴 1 0 X X B

A X X 0 1 B

A X 1 1 X 𝐵

𝐷 D D 𝐷
S1 = 𝐷 + A𝐵

𝐶 𝐶 C C

𝐴 X X 0 1 𝐵
𝐴 X 1 1 0 B

A 0 1 X 1 B

A 1 0 1 X 𝐵

𝐷 D D 𝐷
S2 = BD + A𝐵C + 𝐵𝐶𝐷 + 𝐵C𝐷

𝐶 𝐶 C C

𝐴 0 0 1 0 𝐵

𝐴 X X 0 1 B

A 1 0 1 X B

A X 1 0 0 𝐵

𝐷 D D 𝐷
S3 = A𝐶𝐷 + A𝐵𝐶 + ABC + BC𝐷 + 𝐴𝐵CD

𝐶 𝐶 C C

𝐴 X 0 1 X 𝐵

𝐴 1 X 1 0 B

A 1 1 X 1 B

A 0 1 X 0 𝐵

𝐷 D D 𝐷
S4 = AB + B𝐶 + CD + A𝐶D