MENU

Chapter 13 Boolean Algebra Solutions

Question - 11 : - Draw a logic circuit for the following Boolean expression : ab + c.d’.

Answer - 11 : -


Question - 12 : - Write the SOP form of a Boolean function F, which is represented in a truth table as follows :

Answer - 12 : - A’B’C + A’BC + AB’C + AB’C

Question - 13 : -
Draw the Logic Circuit for the following Boolean Expression :
(U + V). w + z

Answer - 13 : -


Question - 14 : -
Verify the following using Boolean Laws :
LT + V = LTV + LP.V + U.V

Answer - 14 : -

L.H.S.
= U’ + V
= U’ . (V + V) + V (LP + U)
= U’ . V + LP . V + U . V + U. V
= U’. V + LP. V + U. V
= R.H.S.
OR
R.H.S.
= U’V’ + U’. V + U. V
= LP . (V + V) + U. V
= U’ 1 + U.V
= U’ + U.V
= U’ +V
= L.H.S.

Question - 15 : -
Draw the Logic Circuit for the following Boolean Expression :
(X’ + Y). Z + W’

Answer - 15 : -


Question - 16 : - Write the equivalent boolean expression for the following logic circuit.

Answer - 16 : - ((X’.Y)’ + (X.Y’)’)’

Question - 17 : - Write the equivalent Boolean Expression for the. following Logic Circuit :

Answer - 17 : -

Z = (A+B)(B’ +C)
= A.B’ + AC + B.B’ + BC
= A.B’ + AC + BC

Question - 18 : - Obtain the Boolean Expression for the logic circuit shown below :

Answer - 18 : -

F = 
= 

Question - 19 : -
Name the law shown below & verify it using a truth table.
A + B . C = (A + B). (A + C).

Answer - 19 : -

This law is called “Distributive Law”.
Prove by Truth table

Question - 20 : - Obtain the Boolean Expression for the logic circuit shown below :

Answer - 20 : -

F = ( X. ) +(  + W).

F =  + Y+  + W.

Free - Previous Years Question Papers
Any questions? Ask us!
NodeJS Interview Questions Answers
ASP.Net Interview Questions Answers
Interview Questions Answers
×