(I) Karnaugh Map: Express the following function in a minimal sum of products form.
f (a, b, c, d) = S m(1, 2, 4, 5, 8, 14) +
S d(6, 10, 13).
(II) Karnaugh Map: Express the following function in a minimal product of sums form.
f (a, b, c, d) = S m(1, 2, 4, 5, 8, 14) +
S d(6, 10, 13).
(III) Karnaugh Map: Implement the following function with a minimal two level NOR network.
f (a, b, c, d) = S m(0, 4, 5, 9, 11, 14,
15) + S d(2, 8).
(IV) QuineMcCluskey Method: Find the minimum sum of products expression of the following function using the QuineMcCluskey method. Show your process of deriving the prime implicants and include the implication chart.
f (a, b, c, d , e) = S m(0, 1, 2, 9, 15,
19, 23, 25, 30) + S d(4, 5, 28, 31).
(V) QuineMcCluskey Method: Find the minimum sum of products form of the following function using the QuineMcCluskey method. Show your process of deriving the prime implicants and include the implication chart.
f (a, b, c, d) = S m(0, 1, 4, 5, 6, 7, 9,
11, 15) + S d(10, 14).
(VI) Given a four input Boolean function
f (a, b, c, d) = S m(0, 1, 2, 9, 13, 15) + S d(4, 5, 11).
Implement the function using a minimal number of 4:1 multiplexers.
(VII) HazardFree Design: Implement function f (a, b, c) = (a' + c')(b + c) in a hazard free manner.
(VIII) Given a four input Boolean function
f (a, b, c, d) = S m(0, 1, 2, 9, 13, 15) + S d(4, 5, 11).
Implement the function using a 4:1 multiplexer and a minimal network of AND, OR, NOT gates.
(IX) Write the characteristic equations and excitation tables of four
types of flipflops.