3 VARIABLE K-MAP (SUM OF PRODUCTS)
1. Given the following minterms, write the SOP expression and simplify it
using a 3-variable K-map:
F(A,B,C)=Σm(0,1,3,5)
(a) Draw the K-map.
(b) Write the simplified SOP expression.
Answer:
2. For the function below, determine the SOP expression using a 3-variable
K-map:
F(A,B,C)=Σm(2,3,6,7)
(a) Place the minterms in the K-map.
(b) Group the 1s and simplify the expression.
Answer:
3. Find the minimal SOP expression for the given function:
F(A,B,C)=Σm(1,2,3,4,5,7)
(a) Construct the K-map. (b) Identify all possible groupings of adjacent 1s.
(c) Write the minimized SOP expression. Answer:
4. A 3-variable Boolean function is given as a truth table below. Determine its
SOP expression using a K-map:
A B C F(A, B, C)
0000
0011
0101 Answer:
0111
1001
1010
1101
1111
(a) Fill the K-map. (b) Find the most simplified SOP expression.
Don’t Care Condition
[Link] the following minterms and don't care conditions, simplify the SOP
expression using a 3-variable K-map:
F(A,B,C)=Σm(1,3,4,6)+d(2,5)
(a) Construct the K-map.
(b) Use don't care conditions to simplify the expression.
Answer:
3. For the function below, determine the minimized SOP expression using a
3-variable K-map:
F(A,B,C)=Σm(0,2,3,5)+d(1,7)
(a) Place the given values in the K-map.
(b) Use don't care values for simplification.
Answer:
4. Find the minimal SOP expression for the given function with don't care
conditions: F(A,B,C)=Σm(0,1,5,7)+d(2,6) (a) Construct the K-map.
(b) Group 1s and don't care values optimally. (c) Write the simplified SOP
expression. Answer:
A 3-variable Boolean function is given in the truth table below. Find the
minimized SOP expression using a K-map:
A B C F(A, B, C)
0001
001x
0101 Answer:
0111
100x
1011
110x
1111
(a) Place the values into the K-map. (b) Use don't care values to simplify as much as
possible.(c) Write the final SOP expression.
3 VARIABLE K-MAP POS
1. Given the following maxterms, write the POS expression and simplify it
using a 3-variable K-map:
F(A,B,C)=ΠM(0,2,5,7)
Answer:
2. For the function below, determine the POS expression using a 3-variable
K-map:
F(A,B,C)=ΠM(1,3,4,6)
Answer:
3. Find the minimal POS expression for the given function:
F(A,B,C)=ΠM(0,1,3,4,6)
Answer:
4. A 3-variable Boolean function is given in the truth table below. Find the
minimized POS expression using a K-map:
A B C F(A, B, C)
0001
0011
0100
0111
1000
1010
1101
1110
Answer:
DON’T CARE CONDITION:
1. Given the following maxterms and don't care conditions, write the POS
expression and simplify it using a 3-variable K-map:
F(A,B,C)=ΠM(1,3,4,6)+d(0,7) Answer:
2. For the function below, determine the minimized POS expression using a 3-
variable K-map: F(A,B,C)=ΠM(2,3,5,7)+d(1,6)
Answer:
2. Find the minimal POS expression for the given function with don't care
conditions:
F(A,B,C)=ΠM(0,1,5,6)+d(3,7)
Answer:
3. A 3-variable Boolean function is given in the truth table below. Find the
minimized POS expression using a K-map:
A B C F(A, B, C)
0000
001x
0101
0110
100x
1010
110x
1111
Answer:
4 VARIABLE K MAP (SUM OF PRODUCTS)
1. Given the following minterms, write the SOP expression and simplify it
using a 4-variable K-map:
F(A,B,C,D)=Σm(1,3,7,9,11) Answer:
For the function below, determine the SOP expression using a 4-variable K-
map:
F(A,B,C,D)=Σm(0,2,4,6,8,10) Answer:
[Link] the minimal SOP expression for the given function:
F(A,B,C,D)=Σm(0,1,2,4,5,6,8,9,10,12) Answer:
3. A 4-variable Boolean function is given in the truth table below. Find the
minimized SOP expression using a K-map:
A
B C D F(A, B, C, D)
0000 0
0001 1
0010 1
0011 1
0100 1
0101 1
0110 0
0111 1
1000 1
1001 0
1010 1
1011 1
1100 1
1101 1
1110 1
1111 0
Answer:
DON’T CARE CONDITION
Given the following minterms and don't care conditions, find the minimized
SOP expression using a 4-variable K-map:
F(A,B,C,D)=Σm(1,3,7,9,11)+d(2,5,13) Answer:
For the function below, determine the minimized SOP expression using a 4-
variable K-map:
F(A,B,C,D)=Σm(0,2,4,6,8,10)+d(1,5,12) Answer:
Find the minimal SOP expression for the given function with don't care
conditions:
F(A,B,C,D)=Σm(0,1,2,4,5,6,8,9,10)+d(3,7,13,15)
A 4-variable Boolean function is given in the truth table below. Find the
minimized SOP expression using a K-map:
B C D F(A, B, C, D)
A
00001
0001x
00101
0011x
01000
0101x
01101
01111
1000x
10011
10101
1011x
11001
11011
1110x
11111
Answer:
4 VARIABLE K-Map (PRODUCT OF SUM)
1. Given the following maxterms, find the minimized POS expression using a
4-variable K-map:
F(A,B,C,D)=ΠM(1,3,7,9,11,15) Answer:
2. For the function below, determine the minimized POS expression using a
4-variable K-map:
F(A,B,C,D)=ΠM(0,2,4,6,8,10,12,14) Answer:
3. Find the minimal POS expression for the given function:
F(A,B,C,D)=ΠM(0,1,2,4,5,6,8,9,10,12,14)
Answer:
4. A 4-variable Boolean function is given in the truth table below. Find the
minimized POS expression using a K-map:
Answer:
A B C D F(A, B, C, D)
0000 1
0001 1
0010 0
0011 1
0100 0
0101 0
0110 1
0111 0
1000 0
1001 1
1010 1
1011 0
1100 1
1101 0
1110 1
1111 1
DON’T CARE
1. Given the following maxterms and don't care conditions, find the
minimized POS expression using a 4-variable K-map:
F(A,B,C,D)=ΠM(1,3,7,9,11)+d(2,5,13) Answer:
[Link] the function below, determine the minimized POS expression using a 4-
variable K-map:
F(A,B,C,D)=ΠM(0,2,4,6,8,10)+d(1,5,12) Answer:
2. Find the minimal POS expression for the given function with don't care
conditions:
F(A,B,C,D)=ΠM(0,1,2,4,5,6,8,9,10)+d(3,7,13,15)
Answer:
A 4-variable Boolean function is given in the truth table below. Find the
minimized POS expression using a K-map:
A B C D F(A, B, C, D)
A B C D F(A, B, C, D)
0000 1
0001 x
0010 0
0011 x
0100 0
0101 x
0110 1
0111 1
1000 x
1001 1
1010 1
1011 x
1100 1
1101 1
1110 x
1111 1
Answer: