Boolean Logic and Logic Circuits
Uploaded by
ScribdTranslationsBoolean Logic and Logic Circuits
Uploaded by
ScribdTranslationsExercises in Boolean Logic and Logic Circuits
Prof. Roger Santos Ferreira
Updated in February/2019
1. Prove the following properties of Boolean Algebra:
Property Additional Complement Multiplication
Identity A'' = A b) A + 0 = A f) A . 0 = 0
c) A + 1 = 1 g) A . 1 = A
d) A + A = A h) A . A = A
e) A + A' = 1 i) A . A' = 0
Commutative j) A+B = B+A k) A . B = B . A
Associative l) A + (B + C) = (A + B) + C m) A . (B . C) = (A . B) . C = A.B.C
Distributive n) A + (B . C) = (A+B) . (A+C) A . (B + C) = A . B + A . C
Absorption p) A + (A . B) = A
q) A . (A + B) = A
Others r) A + A' . B = A + B
identities (A+B) . (A+C) = A + B . C
De Morgan (A . B)' = A' + B'
(A + B)' = A' . B'
2. Determine the logical expressions assigned to the following circuits:
a) b)
c) d)
3. Draw the circuit that executes the logical expression:
a) S = A • [B • C + A • (C + D) + B • C • D] + B • D
b) S = (A ⊕B) • [A•B + (B + D) + C•D + (B•C)] + A•B•C•D
4. Describe the possible results of the truth table of the expressions and raise your logical circuit:
a) S = C • [A • B + B • (A + C)]
b) S = [(B + C + D) • (A + B + C) + C] + A • B • C + B • (A + C)
c) S = (B ⊕ D) • [A + B • (C + D) + A • B • C]
5. Determine the boolean expression from the truth table below:
A B C S
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
6. Draw the signal at the output S of the circuit below according to the given input:
7. Show that the following logic circuit is an EXCLUSIVE OR:
8. Efetue as operações lógicas a seguir listadas sobre as palavras binárias A = 01010101, B = 00000111
e C = 10101010.
a)A
b) A+B
c) A+C
d) ACB
e) A ⊕ CB
(A ⊕C) •B
g)AC+B
h)AC+B
9. Considere a expressão lógicaY=A+B•C ⊕D⊕A+B•A. Determine o valor deYpara A = D = 1 e B
= C = 0. Note that the exclusive OR operator has precedence over the OR operator.
10. What is the only set of input conditions that produces a LOW output for any gate?
OR?
11. Write the boolean expression for a six-input OR gate.
12. What is the only input combination that produces a HIGH output on an AND gate?
five tickets?
13. Answer True or False: the output of an AND gate will always be different from the output of a
door OR for the same entrance conditions.
14. What is the logical level of the output X for the circuit X=ABC(A+D) in the case of the input: A = 0 and B = C = D
= 1?
15. Draw the circuit diagram that implements the expression X=ABC(A+D) using logic gates.
of, at most, three entries.
16. Draw the circuit diagram for the expression Y=AC+BC+ABC.
17. Draw the circuit diagram for the expression X= [D+ (A+B)C] •E.
18. Considering the expression X=AB(C+D), determine the logical level of output X of the circuit for A = B =
1 e C = D = 0.
19. What is the only set of input conditions that produces a HIGH output in a gate?
NOR of three inputs?
20. Obtain the equivalent circuit for the logical expression of exercise 18 and replace the NOR gate with one.
NAND and the NAND gate for a NOR. What is the new expression for X?
21. Mark the true answer: an equivalent expression of the boolean expression A + 1 is:
a b)A c)1 d) 0
