Scribd
Upload
6 views1 page

Boolean Algebra Question Bank IEE-2023

The document contains a question bank for Module 4 of IEE-2023, focusing on Boolean algebra and logic design. It includes tasks such as simplifying Boolean expressions, obtaining truth tables, converting functions to canonical forms, and proving various properties of Boolean algebra. Additionally, it covers the design and implementation of adder circuits, emphasizing the universality of NAND and NOR gates.

Uploaded by

tusharkumar30001953
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views1 page

Boolean Algebra Question Bank IEE-2023

The document contains a question bank for Module 4 of IEE-2023, focusing on Boolean algebra and logic design. It includes tasks such as simplifying Boolean expressions, obtaining truth tables, converting functions to canonical forms, and proving various properties of Boolean algebra. Additionally, it covers the design and implementation of adder circuits, emphasizing the universality of NAND and NOR gates.

Uploaded by

tusharkumar30001953
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Question Bank: Module4 / IEE-2023

Complement the following


F1= (x’ y z’ + x’y’z) ; F2 = x(y’z’ + yz)
2. Simplify the following Boolean expression to a minimum number of literals:
a. xy + xy’+ x’y b. xyz + x’y + xyz’ c. (yz’ + x’w) (xy’ + zw’)

3. Obtain the truth table for the following four variable functions and express
each function to sum of minterms and product of max terms
a. (ac+bd)(ab+d); b. a’b’c’ + acd + ab’d’ + b’cd c.

4. Express the following function in sum-of-min-terms form:


a. F(w,x,y,z) = 𝛴 (0,1,3,8,9,13,15) ; b. F(x,y,z) = Π (3,7,9)

5 A. Convert Y (A, B, C) = AB’C + AB + BC’ into canonical form.


B. Design the Simplified Expression using logic gates
Y (A, B, C) = AB+A(B+C) + B(B+C)
C. Prove that A’B’C’ + A’B’C + A’BC’ + A’BC + AB’C’ = A’ + (B+C)’

6. Prove the De’Morgan’s Theorem and Associative property and Distributive


Property through the truth table method.

7. Prove that: a) AB+ A’C + BC = AB + A’C


b) (A+B) (A’+C) (B+C) = (A+B)(A’+C)

8. Define Min-term and max-term. Convert SOP F= A’B + B’C + AC’ into
canonical SOP.
09. Define the term: Canonical SOP.
10. Convert POS F = (A + B) (B + C’) to canonical POS.
11. Convert SOP F = A’B + A B’ to POS.
12. Convert POS F = ( A’ + B’) (A + B) to canonical POS.
13. Simplify the following Boolean expression.
F = A’B + AB’ + AB + A
14. Proof that NAND GATE is universal GATE.
15. State and proof (using truth table method), the distributive property of
Boolean Algebra.
16. Minimize the following Boolean Expression: Y= A+B+A’B’C+A’B’C’D
17. Prove that NAND GATE and NOR Gate are the Universal Gates.
18. Determine minterm and maxterm of given function F (A, B, C) = A̅ + BC
19. Prove that: AB+A’C+BC = AB+A’C
20. Explain the HALF adder Circuit and Full Adder Circuit. Derive and show the
truth table method and logic level implementation of the above two adder circuits.

You might also like