Home Assignment -4

Question 1: Expand and simplify the following expression using De Morgan’s

theorem F(A,B,C)=(A+B)’(ABC)’(A’C)

Question 2: Minimize the following function using Boolean principles

F= XY + X(WZ +WZ’).

Question 3: Simplify the following Boolean functions using four-variable

maps: F = ∑m(2,3,10,11,12,13,14,15)

Question 4: Implement optimized logic circuit for the function f (A, B, C, D) =

∑m (1, 2, 4, 9, 11, 13, 15) using NAND gates only

Question 5: A majority function is generated in a combinational circuit when

the output is equal to 1 if the input variables have more 1’s than 0’s. The output

is 0 otherwise. Design a 3 input majority function

Question 6: Design an optimized 3-bit gray code counter using JK flip-flops

Question 7: Construct an optimized counter circuit to circulate between 00, 01,

10 and 11, and repeat. Use T flip-flops.

Question 8: Design an optimized PAL implementation for the Boolean

functions f (A, B, C) = ∑m (1, 2, 3, 6, 7); g (A, B, C) = ∑m (0, 4, 5, 7)