Academic Year- 2024-25
Assignment 1 Sem - 3rd (Odd)
CO-1 Subject Name-: Digital Electronics
Subject Code: BOE310
Q1. Explain Quine Mc- cluskey method of logic minimization. How does it differ from K-
map method?
Q2. Why are NOR and NAND called universal gates? State and prove De Morgan’s law.
Q3. Explain POS and SOP forms in Boolean algebra. How are they derived?
Q3. Simplify the following Boolean functions and implement using NAND gates only.
f = Σ m(0,1,2,9,11,15) + d(8,10,14)
Q4. Use the Quine Mc Cluskey method, Simplify:
Y= Σ m(1,3,5,8,9,10,11,15)+d(2,13)
Q5. Design an XOR gate by using NAND gate implementation.
Q6. Simplify the following Boolean functions, using four-variable maps:
(a) F (w, x, y, z) = Σ (1, 4, 5, 6, 12, 14, 15)
(b) F (A, B, C, D) = Σ (2, 3, 6, 7, 12, 13, 14)
Q7. Find all the prime implicants for the following Boolean functions, and determine
which are essential:
(a) F (w, x, y, z) = Σ (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
(b) F (A, B, C, D) = Σ (0, 2, 3, 5, 7, 8, 10, 11, 14, 15)
Q8. Simplify the following functions, and implement them with two-level NAND
gate circuits:
F(A,B,C,D) = AC’D’+A’C+ABC+AB’C+A’C’D’
Q9. Simplify the following functions, and implement them with two-level NOR
gate circuits:
F(A,B,C,D)= Σ (0,3,12,15)
Q10. Convert the following Boolean function from a sum-of-products form to a simplified
product-of-sums form.
F(x, y, z) = Σ (0, 1, 2, 5, 8, 10, 13)
