BaiTap K Map v4
BaiTap K Map v4
BaiTap K Map v4
Rule-01:
•We can either group 0’s with 0’s or 1’s with 1’s but we can not group 0’s and 1’s
together.
•X representing don’t care can be grouped with 0’s as well as 1’s.
Rule-02:
Example-
Rule-04:
•Groups can be only either horizontal or vertical.
•We can not create groups of diagonal or any other shape.
Rule-05:
•Each group should be as large as possible.
Example-
Rule-06:
•Opposite grouping and corner grouping are allowed.
•The example of opposite grouping is shown illustrated in Rule-05.
•The example of corner grouping is shown below.
Example-
Rule-07:
•There should be as few groups as possible.
Problem-01:
Minimize the following boolean function-
F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)
Problem-02:
Problem-03:
Problem-04:
Minimize the following boolean function-
F(A, B, C) = Σm(0, 1, 6, 7) + Σd(3, 5)
Problem-05:
Minimize the following boolean function-
F(A, B, C) = Σm(1, 2, 5, 7) + Σd(0, 4, 6)
Problem-06:
Minimize the following boolean function-
F(A, B, C) = Σm(0, 1, 6, 7) + Σd(3, 4, 5)
Problem-07:
Minimize the following boolean function-
F(A, B, C, D) = Σm(0, 2, 8, 10, 14) + Σd(5, 15)
Problem-08:
Minimize the following boolean function-
F(A, B, C, D) = Σm(3, 4, 5, 7, 9, 13, 14, 15)