What is the expression for the following kmap?
What is the expression for the following kmap? Assume the ? values are don't care values but if circled, they are 1. So assume 1100 has 1 instead of ?. What is the expression?
Given data,
the given problem is K-map with the don't care condition.
K-map
Karnaugh map or K-map is a map of a function used in a technique used for minimization or simplification of a Boolean expression. It results in a smaller number of logic-gate and inputs being used during the fabrication.
In numerous digital circuits and other practical problems, finding expressions that have minimum variables becomes a prerequisite. In such cases, minimization of Boolean expressions is possible that have 3, or 4 variables. It can be done using the Karnaugh map without using any theorems of Boolean algebra.
The K-map can easily take two forms, namely, Sum of Product or SOP and Product of Sum or POS, according to need of the problem. K-map is a representation that is table-like, but it gives more data than the TRUTH TABLE. Fill a grid of K-map with 1s and 0s, then solve it by creating various groups.
Don't care condition
Step by step
Solved in 2 steps with 1 images