1. A
Boolean function consists of variables either in compliment form or
uncompliment form.
2. In
every Boolean function their will be a literal which is known as variable.
3. Each
literal can be present either in compliment form or uncompliment form.
4. We
can represent the Boolean functions in two ways. They are :
a. Sum
of Product (SOP) form.
b. Product
of Sum (POS) form.
→SOP form :-
i.
The word sum and product are derived
from OR and AND gates by ‘+’ and’∙’.
ii.
The product term is a group of literals
that are ANDed together.
iii.
The sum term is a group of literals that
are ORed together.
iv.
The examples for product terms are
A∙B∙C, X∙Y∙Z, PQR etc.
v.
The examples for sum terms are (A+B+C),
(P+Q+R), (X+Y+Z).
vi.
Therefore, the sum of product for three
variables can be represented as shown below
For Example :- F(A,B,C)=ABC+A`B`C+ABC`+A`BC`.
→POS
form
:-
i.
It is a group of sum terms which are
ANDed together.
ii.
For example, we can represent the three
variables Boolean function for POS form as shown below
For Example :- F(A,B,C)=(A+B+C)(A`+B`+C)(A+B+C`)(A`+B+C`)
NEXT TOPIC: CANONICAL OR STANDARD FORM