Ans to the Ques No - 2

SOP: Sum of Product is the reduced form of SOP. Sum of product form is a
form of expression in Boolean algebra in that different product terms of
inputs are added jointly . This product is not arithmetical fulfill but it’s Boolean
logical AND and the Sum is Boolean logical OR.
How to solve SOP with K-Map:
Step-01: f(A,B,C,D) = ∑ 𝑚(0,7,9,12,15),
Convert this decimal number to binary number
∑ 𝑚(0000,0110,1001,1100,1111)

Step-02: For SOP A = 0, A = 1 then equation will be

∑ 𝑚(0000,0110,1001,1100,1111)

= A B C D + A BCD + A B C D + AB C D + ABCD

Step-03: Then solve this A B C D + A BCD + A B C D + AB C D + ABCD with K-Map

Example: f(A,B,C,D) = ∑ 𝑚(0,7,9,12,15)

= A B C D + A BCD + A B C D + AB C D + ABCD

CD CD CD CD CD
AB 00 01 11 10

A B 00 1

AB 01 1

AB 11 1 1

AB 10 1

∴ A B C D + A BCD + A B C D + AB C D + ABCD = A B C D + A B C D + A B C D + BCD

Example: Simplify the followings with K-Map:
f(A,B,C) = ∑ 𝑚(1,4,5,6,7)

= A B C + A B C + A B C + ABC + ABC

C 𝐶 C
AB 0 1

A B 00 1

𝐴B 01

AB 11 1 1

AB 10 1 1

∴ A B C + A B C + A B C + ABC + ABC = A + B C
Example: Simplify the followings with K-Map:
f(A,B,C) = ∑ 𝑚(2,4,6,7)

= ABC + AB C + ABC + ABC

C 𝐶 C
AB 0 1

A B 00

𝐴B 01 1

AB 11 1 1

AB 10 1

∴ ABC + AB C + ABC + ABC = CB + AB + AC

Example: Simplify the followings with K-Map:
f(A,B,C,D) = ∑ 𝑚(2,4,6,7)

= A BCD + ABC D + ABCD + ABCD

CD CD CD CD CD
AB 00 01 11 10

A B 00 1

AB 01 1 1 1

AB 11

AB 10

∴ A BCD + ABC D + ABCD + ABCD = A DC + ABC + ABD

Example: Simplify the followings with K-Map:
f(A,B,C,D) = ∑ 𝑚(1,4,5,6,7)

= A B CD + ABC D + ABCD + ABC D + ABCD

CD CD CD CD CD
AB 00 01 11 10

A B 00 1

AB 01 1 1 1 1

AB 11

AB 10

∴ A B CD + ABC D + ABCD + ABC D + ABCD = AB + A C D