ECE590

Tut#2: Logic Gates

1. Simplify the following Boolean equations using the Boolean algebra laws and identities.

i. X  AC  AC  D  C  D
ii. X  ( A  B)  C  A  C
iii. X  A B C  C  D  C  D  E

2. State the Boolean functions and construct the truth table for each of the logic circuits
shown below.

i.

ii.

iii.

2
3. Simplify the following Boolean equations by the use of Karnaugh maps:

i. X  A B  A B

ii. X  A B  D  A B  D

iii. F  A B C  A B C  A B C

iv. F  A B C  D  A B C  D  A B C  D  A B C  D

4. i. Deduce the Boolean expression for output F in terms of the input variables A, B
and C for the logic circuit of Figure 1.
ii. Obtain the simplified expression for F using the K-map method.

Figure 1