ANSWER THE FOLLOWING QUESTIONS

2) Draw logic diagram of original and simplified Boolean expressions of Question 1.

3) Implement the Boolean function F given below:

abc + dab + dab

1- With AND, OR and NOT gates.

2- With OR and NOT gates.

3- With AND and NOT gates.

4- With NAND and NOT gates

5- With NOR and NOT gates.

4) a- Using truth table find sum-of-minterms and product-of-maxterms form for functions F₁ and F_2.

b- Simplify the following Boolean Functions F₁ and F₂to a minimum number of literals to get Sum of products and product of sums.

(Note:- Find Sum of Minterms for F₁ and simplify it. Similarly work for F₂)

X Y Z F₁ F₂

0 0 0 1 0

0 0 1 0 1

0 1 0 1 1

0 1 1 0 1

1 0 0 1 0

1 0 1 0 1

1 1 0 1 1

1 1 1 1 0

5) Without Using truth table find sum-of-minterms and product-of- maxterms for function F given below:

F(a,b,c) = (a +bc) (c + ab)

1. Simplify the following Boolean expressions to a minimum number of literals using laws of Boolean algebra (a) ab abc b'c c ad' (b) (a d'('+bcd(a bd' +c') (c) A'D+BCD'+A'BC'D'+BC (d) [BC + (A+B') c]