2024-25 IILM University, Greater Noida
Digital Electronics & Computer Organization (DECO)
1st Year CSE 2024-25 (Odd Semester)
Tutorial Sheet (Unit - 1)
1. Explain and verify the De-Morgan’s Law of 3 Variables.
2. Write the Truth Table of 3 input NAND, NOR and XOR gates.
3. Write the truth table of the following Boolean Expressions and also draw the logical
diagram of given expressions:
a. Y = AB + B’C
b. Y = A’ + BC
c. Y = AC’ + B’D
d. Y = B + A’C
4. Write all the Minterms and Maxterms of 4 variables in Tabular form.
5. Simplify the following expressions using K-map:
a. Z(A,B,C) = Σm(0,1,3,7)
b. Z(A,B,C,D) = Σm(0,2,3,5,7,9,11,13,15)
c. Z(A,B,C,D) = Σm(0,1,4,6,9,10,12)
6. Simplify the following expressions using K-map:
a. Z(A,B,C) = Σm(0,1,3,7) + d(2,4)
b. Z(A,B,C,D) = Σm(0,2,3,5,7,9,11,13,15) + d(1,6,8,14)
c. Z(A,B,C,D) = Σm(0,1,4,6,9,10,12) + d(2,3,13,14,15)
7. Simplify the following expressions using K-map:
a. Z(A,B,C) = ∏M(0,1,2,6)
b. Z(A,B,C,D) = ∏M(0,1,3,6,7,9,10,13,14)
c. Z(A,B,C,D) = ∏M(1,3,5,9,11,12,13)
8. Simplify the following expressions using K-map:
a. Z(A,B,C) = ∏M(1,6,7).d(2,3)
b. Z(A,B,C,D) = ∏M(0,3,5,9,11,12,15).d(1,4,7,13)
c. Z(A,B,C,D) = ∏M(0,1,5,6,12).d(2,3,11,15)
9. Implement the following Boolean Expressions using NAND gate only:
a. Y = A + BC’
b. Y = A’ + B’C
DECO (1st Year CSE)/Unit-1 Page 1
