National Institute of Technology Patna

B.Tech. [SEM I CSE] (Session 2021-22)

Practice Sheet- I
Digital Design (EC-14102)

Unit: I Topic: Boolean Algebra

Date: 11/01/2022 Faculty: Dr. Rajan Agrahari

PROBLEMS
1. Using Boolean notation, write an expression that is a 1 whenever one or more of its
variables (𝐴, 𝐵, 𝐶, and 𝐷) are 1s.
2. Simplify the Boolean expression
𝐴 + 𝐵(𝐶 + 𝐷). What if only one input state is HIGH.
3. An entry light at the colony main gate is controlled by two switches one at left end of the
gate and other at the right end of the gate.
(i) Make a truth table for this system.
(ii) Write the logic equation in SOP form.
4. Prove that ((𝐴𝐵)’ + 𝐴’ + 𝐴𝐵)’ = 0.
5. Apply DeMorgan’s theorems to the following:
̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
(i) (𝐴 + ̅̅̅̅
𝐵𝐶̅ + 𝐶𝐷) + 𝐵𝐶 ̿̿̿̿
(ii) ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅̅̅̅̅̅̅̅
(𝐴 + 𝐵 )(𝐶 ̅̅̅̅̅̅̅̅
+ 𝐷)(𝐸 ̅̅̅̅̅̅̅̅
+ 𝐹 )(𝐺̅̅̅̅̅̅̅̅
+ 𝐻)
6. Using Boolean algebra, simplify the following expressions:
(i) 𝐴(𝐴 + 𝐵)
(ii) 𝐵𝐶 + 𝐵̅ 𝐶
(iii) 𝐴𝐵̅ 𝐶 + 𝐴̅𝐵𝐶 + 𝐴̅𝐵̅ 𝐶
(iv) (𝐴 + 𝐵̅ )(𝐴 + 𝐶)
(v) (𝐴 + 𝐴̅)(𝐴𝐵 + 𝐴𝐵𝐶̅ )
(vi) 𝐴̅𝐵̅ 𝐶 + (𝐴̅̅̅̅̅̅̅̅̅̅̅̅̅
+ 𝐵 + 𝐶̅ ) + 𝐴̅𝐵̅ 𝐶̅ 𝐷
(vii) (𝐵 + 𝐵𝐶)(𝐵 + 𝐵̅ 𝐶)(𝐵 + 𝐷)
(viii) 𝐴𝐵𝐶[𝐴𝐵 + 𝐶̅ (𝐵𝐶 + 𝐴𝐶)]
7. Convert the following expressions to sum-of-product (SOP) forms and convert the
expression to standard SOP form:
(i) (𝐴 + 𝐵)(𝐶 + 𝐵̅ )
(ii) 𝐴𝐵 + 𝐶𝐷(𝐴𝐵̅ + 𝐶𝐷)
(iii) 𝐴 + 𝐵[𝐴𝐶 + (𝐵 + 𝐶̅ )𝐷]
8. Write the expression for Boolean function 𝐹(𝐴, 𝐵, 𝐶) = ∑ 𝑚 (1, 4, 5, 6, 7) in POS form.
9. Use a Karnaugh map to simplify following expressions in a minimum SOP form:
(i) 𝐴̅𝐵̅ 𝐶̅ + 𝐴̅𝐵̅ 𝐶 + 𝐴𝐵̅ 𝐶
(ii) 𝐴̅(𝐵𝐶 + 𝐵𝐶̅ ) + 𝐴(𝐵𝐶 + 𝐵𝐶̅ )
(iii) 𝐴̅𝐵̅ 𝐶̅ + 𝐴𝐵̅ 𝐶̅ + 𝐴̅𝐵 𝐶̅ + 𝐴𝐵𝐶̅
(iv) 𝐴𝐶[𝐵̅ + 𝐵(𝐵 + 𝐶̅ )]
(v) 𝐷𝐸𝐹̅ + 𝐷 ̅ 𝐸𝐹̅ + 𝐷 ̅ 𝐸̅ 𝐹̅
(vi) 𝐵𝐶′ + 𝐴′𝐵 + 𝐵𝐶𝐷′ + 𝐴′𝐵′𝐷 + 𝐴𝐵′𝐶′𝐷
(vii) 𝐴 + 𝐵𝐶̅ + 𝐶𝐷
(viii) 𝐴𝐵(𝐶̅ 𝐷 ̅ + 𝐶̅ 𝐷 ) + 𝐴𝐵(𝐶̅ 𝐷 ̅ + 𝐶̅ 𝐷) + 𝐴𝐵̅ 𝐶̅ 𝐷
10. Use a Karnaugh map to reduce following expressions in a minimum POS form:
(i) (𝐴 + 𝐵 + 𝐶)(𝐴̅ + 𝐵̅ + 𝐶̅ )(𝐴 + 𝐵̅ + 𝐶)
(ii) (𝑋 + 𝑌̅)(𝑋̅ + 𝑍)(𝑋 + 𝑌̅ + 𝑍̅)(𝑋̅ + 𝑌̅ + 𝑍)
 National Institute of Technology Patna

(iii) 𝐴(𝐵 + 𝐶̅ )(𝐴̅ + 𝐶)(𝐴 + 𝐵̅ + 𝐶)(𝐴̅ + 𝐵 + 𝐶̅ )

11. Simplify the given function 𝐹 = ∏ 𝑚(0, 1, 2, 3, 4, 6, 10, 11, 13) to SOP and POS form.
12. Apply K-map to simplify the following functions:
(i) ∑ 𝑚(0, 4) while don’t care terms are (1, 2, 7).
(ii) ∑ 𝑚(1, 7, 15) while don’t care terms are (3, 11, 13).
13. Simplify the following expression by using Quine McClusky method.
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(0, 2, 3, 6, 7, 8, 10, 12, 13)