BOOLEAN ALGEBRA RULES

SN RULES REMARKS
O.
1 0+X=X
Properties of 0.
2 0.X=0
3 1+X=1
Properties of 1.
4 1.X=X
5 X+X=X
Indempotence Law
6 X.X=X
7 X=X Involution or Double inversion
Law
8 X+X=1
Complimentary Law
9 X.X=0
10 X+Y=Y+X
Commutative Laws
11 X.Y=Y.X
 BOOLEAN ALGEBRA
SNO.
RULES(Continue.)
RULES REMARKS
12 X+
(Y+Z)=(X+Y) Associative Laws
+Z
13 X.
(YZ)=(X.Y).Z
14 X.
(Y+Z)=XY+X Distributive Laws
Z
15 X+Y.Z=(X+Y)
(X+Z)
16 (X+Y)=XY
17 (XY)=X+Y De Morgans Theorum
 Sum Of Product [SOP]
A SOP form function is the one which is
the sum of one or several product terms.
For Ex:- F=AB+AC+BC
F=ABC
F=ABC+AB+CB
Standard[Canonical] SOP:- if each term
in SOP form contains all the literals(variables),
then it is known as Standard SOP form.

MIN Term:-Each individual term in standard SOP

form is called MinTerm or Standard Product.
 Product Of Sum[POS]
A POS form function is the one which is
the product of one or more sum terms.
For Ex:- F(ABC)=(A+B)(A+C)(B+C)
F(ABC)=A+B+C
F(ABC)=(A+B+C)(A+C)

Standard[Canonical] POS:-
if each term in POS form contains all the
literals(variables), then it is known as Standard
POS form.

MAX Term:-Each individual term in standard POS

form is called Max Term or Standard Sum.
 MAXTERMS MINTERMS
Each individual term in Each individual term in
Standard POS form is Standard SOP form is
called Maxterm or called Minterm or
Standard Sum. Standard Product.

Ex:- In Ex:-In
F(ABC)=(A+B+C)(A+B+C) F(ABC)=
(A+B+C) ABC+ABC+ABC+ABC.
Here each term is Maxterm. Here each term is
Minterm.
 SUM OF PRODUCT OF
PRODUCT[SOP] SUM[POS]
Sum of Minterms Product of Maxterms
Denoted by (Sigma). Denoted by (Pi)
Consider cases in K-Map in Consider cases in K-Map in
which 1 is there. which 0 is there.
Uncomplemented Variables Uncomplemented Variables
taken as 1s i.e A--1 taken as 0 i.e A--0
Complemented Variables Complemented Variables
taken as 0 i.e A--0 taken as 1s i.e A--1
Ex:- F=ABC+AC+BC Ex:- (A+B+C)(A+C)(A+B)
Standard SOP:- if each Standard POS:-if each
term in SOP form contains term in POS form contains
all the literals. all the literals.
Ex:-F(ABC):- Ex:-F(ABC):- (A+B+C)
 Converting SOP to
Standard SOP
In order to do so, for each variable that
do not occur, multiply that term by(A+A)
or (B+B) or (C+C) as the case may be.

Now multiply all the terms and eliminate

the repeated terms by writing them once.
(AS X+X=X).

For Ex:- given F(ABC)=

AB+AB+AC+AC
 Converting SOP to Standard

SOP
For Ex:- given F(ABC)= AB+AB+AC+AC

1)AB(C+C)+AB(C+C)+AC(B+B)+AC(B+B)

2)ABC+ABC+ABC+ABC+ABC+ABC+ABC+A
BC

3)F(ABC)=ABC+ABC+ABC+ABC+ABC+ABC
.

F(ABC)=111+110+001+000+101+010
F(ABC)=(7,6,1,0,5,2) OR (0,1,2,5,6,7).
 Converting POS to
Standard POS
In order to do so, for each variable that
do not occur, Add that term by(A.A) or
(B.B) or (C.C) as the case may be.

Now convert sum terms into product of

sums and eliminate the repeated terms.
(As X.X=X)

For Ex:- given F(ABC)= (A+B)(A+C)

(B+C).
 Converting POS to Standard

POS
For Ex:- given F(ABC)= (A+B)(A+C)(B+C).

1)(A+B+CC)(A+BB+C)(AA+B+C).

2)(A+B+C)(A+B+C)(A+B+C)(A+B+C)
(A+B+C)(A+B+C).

3)F(ABC)= (A+B+C)(A+B+C)(A+B+C)
(A+B+C).

F(ABC)=000+001+010+101
F(ABC)=(0,1,2,5)
 Expressing into SOP form
A) Truth Table Method:-
Q:-A Boolean function F(XYZ) is true i.e 1 only if
no. of inputs having 1 Input is odd.Draw the truth
table and express it into canonical SOP form.
X Y Z F Minter
Ans: ms
Note for SOP 0X & 1X 0 0 0 0 XYZ
0 0 1 1 XYZ
Adding All the MinTerms 0 1 0 1 XYZ
(Product Terms) for which 0 1 1 0 XYZ
Output is 1,we get
1 0 0 1 XYZ
(1,2,4,7)
1 0 1 0 XYZ
F=XYZ+XYZ+XYZ+XYZ.
1 1 0 0 XYZ
1 1 1 1 XYZ
 Algebric Method:-
Q:-Convert F=((XY)+(XZ)) into Canonical SOP form.
Ans:- ((XY)+(XZ))
=(XY).(XZ)
=(X+Y).(X+Z)
=(X+Y).(X+Z)
=X+YZ [As X+YZ=(X+Y)(X+Z)].
Now,Adding missing term in each term as m+m,it
becomes
X(Y+Y)(Z+Z)+(X+X)YZ
=(XY+XY)(Z+Z)+XYZ+XYZ
=XYZ+XYZ+XYZ+XYZ+XYZ+XYZ
= XYZ+XYZ+XYZ+XYZ+XYZ [Removing Duplicate
Terms]
 Expressing into POS form
A) Truth Table Method:-
Q:-Express in Canonical or Standard POS form for
the Truth Table given Below:-
Ans: X Y Z F Minter
Note for SOP 0X & 1X ms
0 0 0 1 X+Y+Z
Adding All the MAXTerms 0 0 1 0 X+Y+Z
(Sum Terms) for which
Output is 0,we get 0 1 0 1 X+Y+
(1,3,5) Z
0 1
F=(X+Y+Z).(X+Y+Z).(X+Y+Z) 1 0 X+Y+
Z
1 0 0 1 X+Y+
Z
 Algebric Method:-
Q:-Convert F=XY+Y(Z(Z+Y))into Canonical POS form.
Ans:- XY+Y(Z(Z+Y))=XY+Y(ZZ+ZY)
=XY+Y(Z+ZY)=(XY+Y(Z(1+Y))
=XY+YZ [SOP Form]

Step2:- XY+YZ =(XY+Y)(XY+Z) Using X+YZ=(X+Y)

(X+Z)
=(Y+XY)(Z+XY)=(Y+X)(Y+Y)(Z+X)(Z+Y)
=(X+Y)(Y)(X+Z)(Y+Z) [POS Form]

Now Converting POS to Standard POS

=(X+Y+ZZ)(XX+Y+ZZ)(X+YY+Z)(XX+Y+Z)
=(X+Y+Z)(X+Y+Z)(X+Y+Z)(X+Y+Z)(X+Y+Z)(X+Y+Z)
(X+Y+Z)(X+Y+Z) (X+Y+Z)(X+Y+Z) [Removing
Duplicate Terms]
=(X+Y+Z) (X+Y+Z) (X+Y+Z)(X+Y+Z)(X+Y+Z)
[Standard POS Form]
Method 2:-Converting SOP to POS or Vice Versa
[using Truth Table].
Using Above Ex:- XY+YZ [SOP Form]
All possible combinations of above expr. could be
XYZ+XYZ+XYZ+XYZ = XYZ+XYZ+XYZ
[Removing Duplicate]
=(011,010,110)=(3,2,6) or (2,3,6)
(0,1,4,5,7)

Now (0,1,4,5,7)=(000,001,100,101,111)
Taking 0X & 1X [POS Form]
=(X+Y+Z)(X+Y+Z)(X+Y+Z)(X+Y+Z)
(X+Y+Z)
This is the Desired Canonical POS form.
Exercise:-
Convert F(X,Y)=X+Y into Canonical SOP form.
Ans:-F=XY+XY+XY
Convert F(XYZ)=(0,2,4,5) into Canonical POS
form.
Ans:- F=(X+Y+Z)(X+Y+Z)(X+Y+Z)(X+Y+Z)
Convert F(XYZ)=(0,2,4,5) into Canonical SOP
form.
HINT:- (0,2,4,5)=(1,3,6,7).
 CONVERTING STANDARD SOP TO

STANDARD POS
Convert Standard SOP F(ABC)=ABC+ABC+ABC into
standard POS.
A)Using
DecTruth
A B Table
A BMethod:-
ABC A B A B F
. C C C C
0 0 00 1 11 1 0 0 1
1 0 01 1 10 0 0 0 0
2 0 10 1 01 0 1 0 1
3 0 11 1 00 0 0 0 0
4 1 00 0 11 0 0 0 0
5 1 01 0 10 0 0 0 0
6 1 10 0 01 0 0 1 1
7 1 11 0 00 0 0 0 0

Now for Standard POS consider those cases in F in

which 0 is there. i.e (1,3,4,5,7)
i.e(001,011,100,101,111)
=(A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C)
CONVERTING STANDARD SOP TO STANDARD
POS.
B)Using Algebric Method:-

i)Calculate F and then F because F=F.

F(XYZ)=ABC+ABC+ABC
F=(ABC+ABC+ABC)=(ABC).(ABC).(ABC)
[DeMorgans Th.]
F=(A+B+C)(A+B+C)(ABC) =(A+B+C)(A+B+C)
(A+B+C)

F is in POS form. So, in computation of F we need not

to implement DeMorgans Th. Now.So, F will contain
those terms which are not present in F.
i.e F=(A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C)

Similarly for converting Standard POS to SOP same

methods A),B) will be followed.
 Karnaugh Maps
It is a graphical technique for simplifying and
manipulating the Boolean functions.
In this technique, the information contained in a
truth table or available in POS or SOP form is
represented on K-Map and then simplified.
For any logical functions containing n variables
possible combinations of 0 & 1 = 2n i.e no. of
Boxes in K-Map is also 2n.
K-Maps for 2 Variables[SOP] K-Maps for 3
Variables[SOP]
No. of Boxes=22 =4 No. of Boxes=23 =8
 K-Maps for 4 Variables [SOP]
No. of Boxes=24 =16
 Rules for SOP Reduction Using K-
Map
1)Prepare the truth table for the given function.
2)Draw an Empty K-Map for the given function based
on no. of variables involved(2 Var or 3 Var etc.)
3)As in SOP, we consider those cases in which one is
there, so enter 1s for the output as 1 in the
corresponding squares.
4)Enter 0s in all left out empty squares.
5)Encircle adjacent 1s in form of octets, quads and
pairs in the priority order as mentioned respectively
i.e Octet will get the highest priority then Quad &
then pair.Do not forget to roll the map and overlap.
6)Remove redundant groups if any.
7)Write the reduced expressions for all the groups and
OR(+) them.
Note:-Octet will give only 1 Literal.
Quad will give 2 Literals.
Pair will give 3 Literals.
 Problems:-
Q:-Simplify Boolean equation for the function:-
F(ABCD)=(7,9,10,11,12,13,14,15)
I 00 01 11 C 10 J 00 01 11 C 10
CD CD D CD CD CD D CD
00 0 0 0 0 00 0 0 0 0
AB AB
01 0 0 1 0 01 0 0 1 0
AB AB
11
K 001 011 111C 10 1 11
L 001 011 111C 10 1
AB CD CD D CD AB CD CD D CD
10
00 0
0 1
0 1
0 1
0 10
00 0
0 1
0 1
0 1
0
AB
AB AB
AB
01 0 0 1 0 01 0 0 1 0
AB AB

11
Note:-
M 001 011 111C 10 1 11 1 1 1 1
AB CD
CD D CD MABCase cannot be considered as it
is a redundant group comes completely under
10
00 0 1
Case0 1
0 so, as 1
K and 10 rules0quad will
0 priority
per 1 1 1
AB
AB AB get the priority.
01 0 0 1 0
AB
 Reducing SOP Using K-Map
Continues
So,the reduced expressions will be the sum of
Cases(I+J+K+L).
Case I gives AB
Case J gives AD
Case K gives AC
Case L gives BCD
So, The Final reduced Expression becomes
F=AB+AD+AC+BCD
More Questions:-
Reduced the following SOP Expressions:-
i) F(XYZ)=(1,3,5,7).
ii) F(a,b,c,d)=(0,2,7,8,10,15)
iii) F(WXYZ)=(0,4,8,12)
Ans (i):-Z.
Ans (ii):-BCD+BD.
Ans(iii):-YZ.
 K-Maps[POS]
K-Maps for 2 Variables[POS] K-Maps for 3
Variables[POS]
No. of Boxes=22 =4 No. of Boxes=23
=8

K-Maps for 4 Variables[POS]

No. of Boxes=24 =16
 Rules for POS Reduction Using K-Map
1)Prepare the truth table for the given function.
2)Draw an Empty K-Map for the given function based on
no. of variables involved(2 Var or 3 Var etc.)
3)As in POS, we consider those cases in which zero is
there, so enter 0s for the output as 0 in the
corresponding squares.
4)Enter 1s in all left out empty squares.
5)Encircle adjacent 0s in form of octets, quads and pairs
in the priority order as mentioned respectively i.e Octet
will get the highest priority then Quad & then pair.Do
not forget to roll the map and overlap.
6)Remove redundant groups if any.
7)Write the reduced expressions for all the groups and
AND(.) them.
Note:-Octet will give only 1 Literal.
Quad will give 2 Literals.
Pair will give 3 Literals.
 Problems:-
Q:-Simplify Boolean equation for the function:-
F(ABCD)=(0,1,3,5,6,7,10,12,14,15)
I 00(C+ 01(C+ 11(C+ 10 J 00(C+ 01(C+ 11(C+ 10
D) D) D) (C+D) D) D) D) (C+D)
00 0 0 0 1 00 0 0 0 1
(A+B) (A+B)
01 1 0 0 0 01 1 0 0 0
(A+B) (A+B)
11 0 1 0 0 11 0 1 0 0
(A+ (A+
K B) 00(C+ 01(C+ 11(C+ 10 L B) 00(C+ 01(C+ 11(C+ 10
D) D) D) (C+D) D) D) D) (C+D)
10
00 1 1 1 0 10
00 1 1 1 0
(A+B) 0 0 0 1 (A+B) 0 0 0 1
(A+B) (A+B)
01 1 0 0 0 01 1 0 0 0
(A+B) (A+B)
11 0 1 0 0 11 0 1 0 0
(A+ (A+
M B) 00(C+ 01(C+ 11(C+ 10 B)
D) D) D) (C+D)
10 1 1 1 0 10 1 1 1 0
00
(A+B) 0 0 0 1 (A+B)
(A+B)
01 1 0 0 0
(A+B)
11 0 1 0 0
 Reducing POS Using K-Map
Continues
So,the reduced expressions will be the sum of
Cases(I.J.K.L)
Case I gives A+D
Case J gives B+C
Case K gives A+B+C
Case L gives A+C+D
Case M gives A+B+D Case M will not reduce
anything
So, The Final reduced Expression becomes
F=(A+B+C+D)(A+B+C)(A+C+D)(A+D)(B+C)
More Questions:-
Reduced the following SOP Expressions:-
i) F(XYZ)=(0,1,2,3,4,10,11).
ii) F(a,b,c,d)= (0,2,7,8,10,15)
iii) F(WXYZ)= (0,3,5,6,7,11,12,15)
Reducing Expression using Algebric
Method
Q:-Simplify
ABCD+ABCD+ABCD+ABCD.
Ans:-ABCD+ABCD+ABCD+ABCD.
=ABC(D+D)+ABC(D+D)
=(ABC).1+(ABC).1 [D+D=1]
=ABC+ABC=AC(B+B)
=AC.1=AC
Q:-Reduce XYZ+XYZ+XYZ+XYZ
Ans:-Z
Q:-Reduce AB+(AC)+ABC(AB+C)
Ans:-1.
 BOARD QUESTIONS
Q1:-Five inverter are cascaded one after another. What is the
output if the input is 1?

Q2:-Prove algebraically: XY+YZ+YZ = XY+Z

Q3:-Write the POS form of a Boolean function F, which is

represented by theX following
Y Z truth
F table:
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 0
 BOARD QUESTIONS
Q4:-Write the SOP form of a Boolean function F, which is
represented by theAfollowing
B Ctruth
F table:
0 0 0 1
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
Q5:-Reduce the following Boolean expression using K-map:
F (A, B, C, D) = (0, 1, 2, 3, 4, 5, 10, 11, 15)

Q6:-Reduce the following Boolean expression using K-map:

F(A,B,C,D) = (2,3,6,10,11,14)
Q7 State and Prove Absorption Law: a)Using Truth Table b)Algebraically
Q8 State and prove DeMorgans Theorum Algebraically.