State Distributive Laws of Boolean Algebra and verify them using truth table.

Draw the Logic Circuit of the following Boolean Expression using only NAND Gates:
X.Y + Y.Z

Derive a Canonical SOP expression for a Boolean function F, represented by the following truth table:

Reduce the following Boolean Expression to its simplest form using K-Map:
F(X,Y,Z,W)= Σ (0,1,2,3,4,5,10,11,14)

State any one Absorption Law of Boolean Algebra and verify it using truth table.

Draw the Logic Circuit of the following Boolean Expression:
(U’+V).(V’+W’)

Derive a Canonical POS expression for a Boolean function FN, represented by the following truth table:

Reduce the following Boolean Expression to its simplest form using K-Map:

G(U,V,W,Z) = Σ (3,5,6,7,11,12,13,15)

State DeMorgan’s Laws of Boolean Algebra and verify them using truth table.

Draw the Logic Circuit of the following Boolean Expression using only NOR Gates:
( A+B).(C+D)

Derive a Canonical POS expression for a Boolean function G, represented by the following truth table:

Reduce the following Boolean expression to its simplest form using K-Map:
E(U,V,Z,W)= Ó (2,3,6,8,9,10,11,12,13)

Verify the following using Boolean Laws.
X’+ Y’Z = X’.Y’.Z’+ X’.Y.Z’+ X’Y.Z+ X’.Y’.Z+ X.Y’.Z

Write the Boolean Expression for the result of the Logic Circuit as shown below:

Derive a Canonical SOP expression for a Boolean function G, represented by the following truth table:

Reduce the following Boolean Expression to its simplest form using K-Map:
F(P,Q,R,S)= Σ(0,4,5,8,9,10,11,12,13,15)

Verify the following using Boolean Laws.
U’+ V= U’V’+U’.V +U.V

Draw the Logic Circuit for the following Boolean Expression :
(X’+Y).Z+W’

Derive a Canonical POS expression for a Boolean function F, represented by the following truth table:

Reduce the following Boolean Expression to its simplest form using K-Map :
F(X,Y,Z,W) = ∑(0,1,4,5,6,7,8,9,11,15)