1.

Using the basic theorems and axioms of Boolean algebra, simplify the following

Boolean expressions:

F1 = x ′ y ′ z + x y z + x ′ y z + x y ′ z .

F2 = x ′ y ′ z + x ′ y z + x y ′

2. Develop a truth table and logic diagram for the following Boolean expressions

F1 = x ′ y ′ z

F2= x + y ′ z

3. Simplify the following Boolean expressions to a minimum number of literals

x(x′+y)

x+x′y

4. Find the duality and complement of the functions:

F 1 = x ′ y z ′ + x ′ y ′ z and F 2 = x (y ′ z ′ + y z)

5. Draw a logic diagram for the Boolean function F = x ′ y + x y ′

6. What Boolean expression is implemented by the following logic diagram?

7. Find a product of sum expression for F ( x , y , z ) = Σ ( 1 , 2 , 3, 5 , 7 ).

8. Find a sum of minterms expression for F = Π ( 1 , 3 , 4 , 6 ).

9. Identify the minterms and maxterms of the truth table for F shown below
 x y z F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0

10. What Boolean expression is implemented by the following logic diagrams?

11. Express the Boolean function F = A + B ′ C + A D as a sum of product.

12. Express the Boolean function F = x ′ y + x z as a product of maxterms.

13. Draw a logic diagram to implement the Boolean function F = BC ′ + A B + A C D

14. Draw the logic diagram corresponding to the following Boolean expression without

simplifying it: F = D + B C + ( D + C ′ ) ( A ′ + C )

15. Convert each of the following to the other canonical form:

F1 ( x , y , z ) = Σ ( 1 , 3 , 5 )

F2 ( A , B , C , D ) = Π ( 3 , 5 , 8 , 11 )

16. By means of a timing diagram, show the signals of the outputs f and g as functions of

the three inputs a, b, and c. Use all eight possible combinations of a, b, and c.
17. By means of a timing diagram, show the signals of the outputs f and g as functions of

the two inputs a and b. Use all four possible combinations of a and b.

18. Simplify the Boolean functions using k-map:

F (x, y, z)=Σ(2, 3, 4, 5)

F (x, y, z)=Σ(3, 4, 6, 7)

F (x, y, z)=Σ(0, 2, 4, 5, 6)

F=A′C+A′B+AB′C+BC