Description
Prove the identity of each of the following Boolean equations, using algebraic manipulation:
-
- Simplify the following Boolean expressions to expressions containing a minimum number of literals:
- Using DeMorgan’s theorem, express the function
- with only OR and complement operations.
- with only AND and complement operations.
- Obtain the truth table of the following functions, and express each function in sum-of-minterms and product-of-maxterms form:
- For the Boolean functions and , as given in the following truth table:
| X | Y | Z | E | F |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 0 |
- Express and in sum-of-minterms and product-of-maxterms algebraic form
- Draw the logic diagram of E and F with sum-of-minterm
