a. AB, BA
12. Two possible combinations of inputs to logic diagrams are shown
b. EC, C E
below.
c. EB, B E
a.
ANDed INPUT TO AND SYMBOL
b.
ORed INPUT TO OR SYMBOL
Write the output Boolean expression for the diagrams above.
a.
b.
a. (AB) C
13. The output Boolean expressions of the logic diagrams above contain
b. (A+B) +C
parentheses to indicate grouping. It is possible to remove the
parentheses from the output Boolean expressions, which will result in
simplified diagrams. To remove the parentheses, the ASSOCIATIVE
law is used. The ASSOCIATIVE law is illustrated on the following
page with the corresponding logic diagrams and truth tables.
IT 0344
1- 8
Previous Page
