Problem-01
Minimize the following boolean function-
F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)
Solution- Since the given boolean expression has 4 variables, so we draw a 4 x 4 K
Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(A, B, C, D)
= (A’B + AB)(C’D + CD) + (A’B’ + A’B + AB + AB’)C’D + (A’B’ + AB’)(C’D’ + CD’)
= BD + C’D + B’D’
Problem-02:
Minimize the following boolean function-
F(A, B, C, D) = Σm(0, 1, 3, 5, 7, 8, 9, 11, 13, 15)
Solution-
Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(A, B, C, D)
= (A’B’ + A’B + AB + AB’)(C’D + CD) + (A’B’ + AB’)(C’D’ + C’D)
= D + B’C’
Thus, minimized boolean expression is- F(A, B, C, D) = B’C’ + D
Problem-03:
Minimize the following boolean function-
F(A, B, C, D) = Σm(1, 3, 4, 6, 8, 9, 11, 13, 15) + Σd(0, 2, 14)
Solution-
Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(A, B, C, D)
= (AB + AB’)(C’D + CD) + (A’B’ + AB’)(C’D + CD) + (A’B’ + AB’)(C’D’ + C’D) + (A’B’ + A’B)(C’D’ +
CD’)
= AD + B’D + B’C’ + A’D’
Thus, minimized boolean expression is- F(A, B, C, D) = AD + B’D + B’C’ + A’D’
Problem-04:
Minimize the following boolean function-
F(A, B, C) = Σm(0, 1, 6, 7) + Σd(3, 5)
Solution-
Since the given boolean expression has 3 variables, so we draw a 2 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(A, B, C)
= A'(B’C’ + B’C) + A(BC + BC’)
= A’B’ + AB
Thus, minimized boolean expression is- F(A, B, C) = AB + A’B’
NOTE-
It may be noted that there is no need of considering the quad group.
This is because even if we consider that group, we will have to consider the other two
duets.
So, there is no use of considering that quad group.
Problem-05: Minimize the following boolean function- F(A, B, C) = Σm(1, 2, 5, 7) +
Σd(0, 4, 6)
Solution-
Since the given boolean expression has 3 variables, so we draw a 2 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(A, B, C)
= (A + A’)(B’C’ + B’C) + A(B’C’ + B’C + BC + BC’) + (A + A’)(B’C’ + BC’)
= B’ + A + C’
Thus, minimized boolean expression is- F(A, B, C) = A + B’ + C’
Problem-06:
Minimize the following boolean function- F(A, B, C) = Σm(0, 1, 6, 7) + Σd(3, 4, 5)
Solution-
Since the given boolean expression has 3 variables, so we draw a 2 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(A, B, C)
= (A + A’)(B’C’ + B’C) + A(B’C’ + B’C + BC + BC’)
= B’ + A
Thus, minimized boolean expression is- F(A, B, C) = A + B’
Problem-07:
Minimize the following boolean function- F(A, B, C, D) = Σm(0, 2, 8, 10, 14) + Σd(5, 15)
Solution-
Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(A, B, C, D)
= (AB + AB’)CD’ + (A’B’ + AB’)(C’D’ + CD’)
= ACD’ + B’D’
Thus, minimized boolean expression is- F(A, B, C, D) = ACD’ + B’D’
Problem-08:
Minimize the following boolean function- F(A, B, C, D) = Σm(3, 4, 5, 7, 9, 13, 14, 15)
Solution-
Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(A, B, C, D)
= A’B(C’D’ + C’D) + (A’B’ + A’B)(CD) + (AB + AB’)(C’D) + AB(CD + CD’)
= A’BC’ + A’CD + AC’D + ABC
Thus, minimized boolean expression is- F(A, B, C, D) = A’BC’ + A’CD + AC’D + ABC
Problem-09: Consider the following boolean function-
F(W, X, Y, Z) = Σm(1, 3, 4, 6, 9, 11, 12, 14)
This function is independent ________ number of variables. Fill in the blank.
Solution-
Since the given boolean expression has 4 variables, so we draw a 4 x 4 K Map.
We fill the cells of K Map in accordance with the given boolean function.
Then, we form the groups in accordance with the above rules.
Then, we have-
Now,
F(W, X, Y, Z)
= (W’X + WX)(Y’Z’ + YZ’) + (W’X’ + WX’)(Y’Z + YZ)
= XZ’ + X’Z
=X⊕Z
Thus, minimized boolean expression is- F(W, X, Y, Z) = X ⊕ Z
Clearly, the given boolean function depends on only two variables X and Z.
Hence, it is independent of other two variables W and Y.
Thus, minimized boolean expression is-
F(A, B, C, D) = BD + C’D + B’D’
