Sri Chaitanya Educational Institutions, India

BOOLEAN ALGEBRA
One Mark Questions
1. What is another name of Boolean algebra?
A. The Boolean algebra is also called as switching algebra.
2. What is truth table?
A. A Table which represents all possible input combinations and corresponding results.
3. What is Tautology?
A. When a result of any logical statement or expression is always TRUE (1), and then it is
called tautology.
4. What is fallacy?
A. When a result of any logical statement or expression is always FALSE (0), and then it is
called fallacy.
5. State Idempotence law.
A. This law states that when a variable is combines with itself using OR or AND operator,
the output is the same variable. That is X+X=X and X.X=X.
6. State Involution law.
A. This law states that the complement of a variable is complement of a variable is
complemented again, we get the same variable. That is X =X.
7. Name the three logical operators.
A. NOT Operator , AND Operator and OR operator.
Two Mark Questions
*8. Construct a truth table for three variables x, y and Z that will have output 1 when
xyz  100, xyz  110, xyz  111. Write Boolean expression for logic network in sop from.

x y z Output Minterms
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1 x yz
1 0 1 0

Page 5
Sri Chaitanya Educational Institutions, India
1 1 0 1 xyz
1 1 1 1 xyz

SOP= x yz  xyz  xyz

*9. What is minterm and maxterm?
A. Min term is a product of all literals (with or without bar) with in logic system. Max term
is a sum of all literals (with or without bar) with in logic system.
*10. Prove algebraically that  X  Y  Z  .  X  Y  Z   Y  Z .

A.  X  Y  Z  . X  Y  Z 
 XX  XY  XZ  YX  YY  YZ  ZX  ZY  ZZ
 0  XY  XZ  XY  Y  YZ  XZ  YZ  Z

 Y  XY  YZ  XZ  XZ  Z

 Y 1  X  Z   Z  X  X  1

Y Z
* 11. What is minterm? Write short hand notation for the minterm X Y Z .
A. Minterm is a product of all the literals (with or without the bar) within the logical
system.
The short hand notation of minterm is ‘m’.
Substitute 1’s for non-barred and 0’s for barred letters.
Binary equivalent  101
Thus  1 2 2  0  21  1 20
 1 4  0  2  1 1
 4  0 1

x yz  m .
5
*12. Convert the expression  A  C  C  D  to canonical product of sum form

 A  C  C  D  
  A  C  DD   C  D  AA 

  A  C  D   A  C  D   C  D  A  C  D  A 

  A  C  D A  C  D A  C  D 

 M 0 .M 1.M 4

Page 6
Sri Chaitanya Educational Institutions, India

*13. Construct a Boolean function of three variables X, Y and Z that has an output 1 when
exactly two of X, Y and Z are having value 0 and an output 0 in all other cases.
X Y Z F

0 0 0 0

0 0 1 1

0 1 0 1

0 1 1 0

1 0 0 1

1 0 1 0

1 1 0 0

1 1 1 0

*14. Given the Boolean function F  x, y, z   "  0, 2, 4,5, 6  reduce it by using K-Map.

F  X , Y , Z     0, 2, 4,5, 6 

 m0  m2  m4  m5  m6

Quad 1  m0  m2  m4  m6
Pairs  m4  m5
 Z  XY .
*15. Prove algebraically that (x+y)(x+z)=x+yz
Take LHS (x+y)(x+z)
=xx+xz+xy+yz
= x+xz=xy+yz (xx=x)
x(1+z)+xy+yz
x+xy+yz (1+z=1)

Page 7
Sri Chaitanya Educational Institutions, India
x+yz (1+y=1)
So the LHS=RHS due to that we can say (x+y)(x+z)=x+yz
*16. Draw general K – map for four variables A, B, C and D.
Y
X  00  Y Z  01 Y Z 11 Y Z 10  Y Z

 00 W X W XY Z W XY Z W XYZ W XYZ
0 1 3 2

 01W X W XY Z W XY Z W XYZ W XYZ

4 5 7 6

11W X W XY Z W XY Z W XY Z W XYZ
12 13 14 15

10 W X W XY Z W XY Z W XYZ W XYZ

8 9 11 10

4-variable K Map representing minterms.

*17. State and prove De Morgan’s theorems algebraically.
To prove De Morgan’s first theorm, we will use Complementary laws.
Let us assume that P = X+Y where, P, X, Y are logical variables.
Then, according to complementation law and P.P = 0.
That means, if P, X, Y are Boolean variables then this complementarity law must hold
for variable P. In other words,
If for variable P . In other words,
If i.e., X  Y  X .Y then
 X  Y   X .Y must be equal to 1 , (As X  X  1 )

And,  X  Y  X .Y must be equal to 0 (As X . X  0 )

Let us first prove that first part, i.e.,  X  Y    X Y   1

 X  Y    X .Y    X  Y   X     X  Y   Y   ref . X  YZ   X  Y  X  Z  
 1  y  X  1

 1.1  ref . X  X  1
1  ref .1  X  1
Now let us prove the second part i.e.,  X  Y  .  X .Y   0

 X  Y  .  X .Y   X .Y .  X  Y 

Page 8
Sri Chaitanya Educational Institutions, India
 X X Y  XYY
 0.Y  X .0

 000

 ref .X .X  0  To Prove  X Y   XY   X  Y we will make use of complimentarity law

i.e., X  X  1 And X . X  0
If XY ' s complement is X  Y then it must be true that
a) XY   X  Y   1 and b) XY  X  Y   0

To prove this part

L.H.S  XY   X  Y 

 
 X  Y  XY

 
 X Y  X . X Y Y 
 
 1 Y . X 1   ref .X  X  1
 1.1  ref .1  X  1
 1 = R.H.S

Now the second part i.e., XY .  X  Y   0

 XY X  XYY
= X XY  XYY
=0.Y+X.0
=0
=RHS
*18. A truth table has outputs 1 for each of these inputs:
ABCD=0011,ABCD=0101,ABCD=1000.Waht are the fundamental products and write
min- terms expression.
Fundamental Product are:0011- A B CD 0101- A B C D 1000-A B C D
Min-terms are:∑(3,5,8)
*19. Draw a general K-map for 3 variable X,Y and Z.

Page 9
Sri Chaitanya Educational Institutions, India
YZ YZ YZ YZ
X 000 001 011 010

X 100 101 111 110

*20. Simplify using laws of Boolean Algebra. At each step state Clearly the laws used for
simplification?
F=x.y+x.z+x.y.z
=xy(1+z)+x.z
=xy+xz
=x(y+z)
*21. State De Morgan’s theorems.
i) X  Y  X . Y
ii) X .Y  X  Y

*22. State the principle of duality.

The duality principle states that we can derive a boolean relation from another boolean
relation by performing the following steps:
Change each AND(.) with OR(+) sign and each OR(+) with AND(.) sign
Replace each 0 with 1 and each 1 with 0
e.g., 0+0=0 then dual is 1.1=1
1+0=1 then dual is 0.1=0
*23. What is the canonical form of Boolean expression? Mention the types of canonical
expressions?
Boolean Expression composed entirely either of minterms or maxterms is referred to as
Canonical Expression.
There are two types of expressions:
Sum-of –Products(S-O-P) form.
Product –of –sums(P-O-S) form.
*24. Prove algebraically that (X+Y)(Y+Z)=Y+XZ
Take LHS (X+Y)(Y+Z)=Y+XZ
=(X+Y)(Y+Z)
=XY+XZ+YY+YZ
=XY+Y+XZ+YZ
Page 10
Sri Chaitanya Educational Institutions, India
=Y(X+1)+XZ+YZ=Y+XZ+YZ
=Y(1+Z)+XZ
=Y+XZ
LHS=RHS
*25. Prove algebraically that ( X  Y )( X  Y )  X
( X  Y )( X  Y )  X
XX  X Y  XY  YY
X  X (Y  Y )  0  X.X=X  X.X  0
X+X  X+X  1
X=RHS
*26. State and prove commutative law using truth table.
The commutative law states that the order in which terms are written does not affect
their value. For example: (AB=BA, A+B=B+A)
A B A.B B.A A+B B+A

0 0 0 0 0 0

0 1 0 0 1 1

1 0 0 0 1 1

1 1 1 1 1 1

*27. Mention and prove involution law.

This law states that the double complement of a variable gives the same variable.
Y Y OUTPUT (!)

0 1 0

1 0 1

*28. What is principle of duality? Give an example.

The duality principle states that we can derive a Boolean relation from another Boolean
relation by performing the
following steps.
1) Change each AND (.) with an OR (+) sign and each OR (+) with an AND (.) sign

Page 11
Sri Chaitanya Educational Institutions, India
2) Replace each 0 with 1 and each 1 with 0.
*29. Prove that X + XY = X
Proof:
LHS = X + XY
=X(1+Y)
=X.1
=X
30. List the applications of De Morgan’s theorem.
Used for the realization of basic gates using universal gates.
Used in the simplification of Boolean expressions for efficient logic.
It is generally used for mathematical duality.
31. Draw a general K-map for 3 variables A,B and C.
BC
A BC BC BC BC

A ABC ABC ABC ABC

0 1 3 2
A
ABC ABC ABC ABC
4 5 7 6

Five Mark Questions

*32. State any two absorption laws of Boolean algebra and verify.
a) X+XY=X b) x(x +y)
Proof: X+XY = x LHS = xx + xy
LHS = X+XY = x + xy (x.x = x)
= X(1+y) = x(1+y)
= X.1 (1 +y = 1) = x.1
=X =x (1.x = x)
*33. Reduce the following Boolean expression using K-map.
F  A, B, C, D  =  1, 2, 3, 4, 5, 7, 9, 11, 12, 13, 15 

Page 12
Sri Chaitanya Educational Institutions, India
CD CD CD Pair
CD
1 1 1
AB 0
0 1 3 2
1 1 1 0
AB 4 5 7 6
1 1 1 0
AB 12 13 14
15
0 1 1 0
AB 9
8 11 10
Quad

Octet

Octet: m1.m3 .m5 .m7 .m13.m15 .m9 .m11

Reduced expression :D
Quad: m4 .m5 .m12 .m13
Reduced expression: BC
Pair: m3.m2
Reduced expression: A B C
Final SOP expression is D  BC  AB C .
*34. Write a Boolean expression :F(W,X,Y,Z)=π(5,6,7,8,9,12,13,14,15).
From quad 1: X  Z
From quad 2: X  Y
From quad 3: W  X
From quad 4: W  Y
Reduced expression is:  X  Z  X  Y W  X W  Y  .

*35. a) State two Absorption law of Boolean Algebra. Verify Using Truth Table.
a) X+XY=X b) x(x +y)
Proof: X+XY = x LHS = xx + xy
LHS = X+XY = x + xy (x.x = x)
= X(1+y) = x(1+y)
= X.1 = x.1 (1 +y = 1)
=X =x (1.x = x)

Page 13
Sri Chaitanya Educational Institutions, India
x y (x+y) x(x+y)

0 0 0 0

0 1 1 0

1 0 1 1

1 1 1 1

x y xy x+xy

0 0 0 0

0 1 0 0

1 0 0 1

1 1 1 1

*36. Given the Boolean function (A,B,C,D)=∑(0,4,8,9,10,11,12,13,15) reduce it by using

Karnaugh map.

AB CD CD CD
CD CD

AB
1
0 1 3 2

AB
1
4 5 7 6
1 1 1
AB
12 13 15 14
1
1 1 1
AB
8 9 11 10
Quad3

Quad2
Quad1

Quad1 (m0+m4+m12+m8) is CD
Reduced expression for the Quad 2 (m9,m11,m13,m15) is AD
Reduced expression for the Quad 3(m8,m9,m10,m11) is AB
So the simplified Boolean function is

Page 14
Sri Chaitanya Educational Institutions, India
F(A,B,C,D)= C D  AD  AB
*37. Reduce F(A,B,C,D) = ∑(5,6,7,10,14,15) using K-map

AB CD CD CD
CD CD

AB 1
0 3 2
1 1 1
AB
4 5 7 6
Pair2
AB 1 1
12 13 15 14
1 Quad1
AB
8 9 11 10

Pair1

Quad1 (m6+m7+m14+m15) = BC
Pair1 (m10+m14) = AC D
Pair2 (m5+m7) = ABC
Final reduced expression is
F(A,B,C,D)= A BD+AC D +BC
*38. Give the Boolean function
F(W,X,Y,Z)=(0,4,8,9,10,11,12,13,15) Reduce it by Karnaugh map.0

AB CD CD CD
CD CD

1
AB 1
0 3 2

AB 1
4 5 7 6
AB 1 1 1
12 13 15 14
Quad2
AB 1 1 1 1
8 9 11 10
Quad3

Quad1

Quad1 (m0+m4+m12+m8) is CD
Reduced expression for the Quad 2 (m9,m11,m13,m15) is AD
Reduced expression for the Quad 3(m8,m9,m10,m11) is AB
So the simplified Boolean function is
F(A,B,C,D)= C D  AD  AB
Page 15
Sri Chaitanya Educational Institutions, India
*39. Using K-Map simplify the following expression in 4 variables.
F(A,B,C,D) = m1+m2+m4+m5+m9+m11+m12+m13.

AB CD CD CD
CD CD

1 1
AB 1
0 3 2

AB 1 1
4 5 7 6
AB 1 1
12 13 15 14
Quad2
AB 1 1
8 9 11 10
Pair

Quad1

Quad1 (m1+m5+m13+m9) is CD
Reduced expression for the Quad 2 (m4+m5+m12+m13) is BC
Reduced expression for the Pair (m9+m11) is ABD
Not mapped 1 is ABCD
So the simplified Boolean function is
F(A,B,C,D)= CD  BC  ABD  ABCD
40. Give the Boolean function F(A,B,C,D)=  (0,2,4,6,8,9,10,14,) Reduce it by Karnaugh
map.

C'D' C'D CD CD' (ii)

A'B' 1 0 1 3 1 2
A'B 1 4 5 7 1 6
AB 12 13 15 1 14
AB' 1 8 1 9 11 1 10
Simplification of the expressinon:
(i) Quad 1= M2. M6.M14.M10= CD (variables that are are common )
(ii) Quad 2 = MO. M2. M4. M6 = A’D’
(iii) pair = M8. M9 = AB’C’
The solution for above expression using K map is : CD’+ A’D+AB’C’

Page 16