Texts: Please Solve
Question 1. SOP Karnaugh Maps [2 marks]
Karnaugh maps are often used to obtain simplified Sum of Product (SOP) expressions. Process each of the SOP expressions below, using Karnaugh maps. Each expression uses canonical minterm notation that may be used to fill in the K-map.
F(X, Y, Z) = m(0, 2, 5, 7)
G(A, B, C, D) = m(1, 3, 4, 6, 9, 11, 12, 14)
Question 2. POS Karnaugh Maps [2 marks]
Karnaugh maps are also used to obtain simplified Product of Sums (POS) expressions. Process each of the expressions below, using Karnaugh maps. Each expression uses either canonical minterm (SOP) or canonical maxterm (POS) notation that may be used to fill in the K-map.
H(X, Y, Z) = [[M(0, 2, 6)
L(A, B, C, D) = m(4, 6, 7, 15)
Question 3. Don't Care Conditions in Karnaugh Maps [2 marks]
Simplify the Boolean function F together with the don't-care conditions de in (1) SOP form and (2) POS form. Use the don't-care conditions to obtain expressions with the minimum number of literals.
F(W, X, Y, Z) = m(0, 1, 2, 3, 7, 8, 10)
dc(W, X, Y, Z) = m(5, 6, 11, 15)
Question 4. [2 marks]
Optimize the following Boolean expressions using a map.
F(W, X, Y, Z) = m(0, 1, 2, 4, 7, 8, 10, 12)
Question 5. [2 marks]
Obtain the truth table of the following function and express each function in Sum of Minterms and Product of Maxterms form.
WXY + WXZ + WXZ + YZ
