Computer Science
What do you understand by Karnaugh's map? Explain.
Boolean Algebra
5 Likes
Answer
Karnaugh's map is a way to reduce an expression by using a tabular or matrix representation to its most simplified form. It is named after its inventor Maurice Karnaugh. Its advantage is that it doesn't require any algebraic derivation. It has a limitation that it will reduce the expression only when it is in canonical SOP or POS form.
Answered By
3 Likes
Related Questions
Find the complement of the following expressions:
(a) (A + B).(B + C).(A + C)
(b) A.B + (A'.B').(B.C + B'.C')
Reduce the following boolean function with the help of Karnaugh's map:
F (A, B, C, D) =Σ (0, 1, 2, 3, 12, 13, 14, 15)
Reduce the following boolean function with the help of Karnaugh's map:
F (a, b, c, d) = Σ (1, 2, 3, 11, 12, 14, 15)
Draw the truth table for the following logical operators:
NOT logic