Unformatted text preview: 266 Boolean Algebra ' 4. 5. The expression ο¬is equal to: a. KB. :β "" b.β A B A +3Β» 1 A + β7β
(3:. A+B ) (12ββ A+B. In the circuit of Fig. 269, Y is equal to: a: AB+AC. > b. (AB)(AC).
c. (A+B)(A+C).
d. (A+B)+(A+C). Which' of the following is a simplification
of the circuit shown in Fig. 269? A(BC).
C(B+A). . BiA+Ci GUN Fig. 26β9 Optional Test Exercise 1. Write the Boolean equations for the circuits
of Fig. 2610 (a), (b) and (c). Which equation
is most difficult to visualize in terms of the
overall logic function performed? ....................
Are the three circuits functionally the same?
...................... What Boolean postulate, law
or theorem is demonstrated? ........................
...................... Would you say that Boolean
expressions can be simplified by using negated
inputs and dual gating function symbology?
...................... Using the trainer, construct
the three circuits and verify that they per
form the same function. ' Fill ο¬u A
B
C
D
E
(01β
Fig. 2610
Notes ...
View
Full Document
 Fall '05
 Myer,B

Click to edit the document details