Assignment 2
Assignment 2
Q1. What do you understand basic logic gates explain with their expression, symbol and truth
table?
Q2. What do you understand universal logic gates explain with their expression, symbol and truth
table?
Q3. What do you understand EX-OR and EX-NOR logic gates, explain with their expression,
symbol and truth table?
Q.4 Implement EX-OR and EX-NOR logic with minimum number of NAND and NOR gates.
Q5. Please, explain following-
1. Commutative Laws
2. Associative Laws
3. Distributive Laws
Q6. Explain DE-Morgan Theorem and Redundant literal rule.
Q7. Simplify the following Boolean expression into one literal. W’X (Z’+YZ) + X (W+Y’Z).
Q8. Define ‘Minterm’ and ‘Maxterm’.
Q9. Define ‘SOP’ and ‘POS’.
Q10. Use Boolean algebra to simplify the following expression
W = A.B.C.D.E + A.C.D + A.C.F .G.H + A.B.C.D.E + A.C.D.E + E.H in sum of products form.
Q11. Simplify the given Boolean Expression F= x’+xy+xz’+xy’z’.
Q12. Simplify using K-Map A’B’C’D’+A’CD’+AB’D’+ABCD+A’BD.
Q13. Convert Y=A+BC+AB+ABC into canonical form.
Q14. Prove the following Boolean identities
i) x + xyz + yzx’ + wx + w’x + x’y = x + y
ii) ii) (X1 + X2) (X1’ X3’ + X3) (X2’ + X1X3)’ = X1’X2
Q15. Simplify F(w,x,y,z)=m(0,1,2,4,5,12,13,14) using K-map with don’t care conditions d(6,8,9).
Q16. Simplify f(A,B,C,D)= (0,2,4,5,6,7,8,10,12,13,14,15) using k-map, and design the logic
circuit after simplification.
Q17. Prove that (A+A’B+AB’ = A+B).
Q18. Simplify using K-Map, F(A, B, C, D) = (0,2,4,5,6,7,8,10,13,15).
Q19. What do understand by prime and essential prime implicants in K-map?
Q20. Find all the prime implicants for the following Boolean functions, and determine which are
essential: F (A, B, C, D) = Σm (1, 2, 4, 6, 8, 10, 11, 13, 15).
-------------------------------------------------DE_A_2--------------------------------------------