COMPUTER SCIENCE AND ENGINEERING
COMPUTER ARCHITECTURE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Mapping.
|
|
|
Graphing
|
|
|
T-map
|
|
|
karnaugh-map
|
Detailed explanation-1: -Explanation: K-map(Maurice Karnaugh of Bell labs in 1953) is defined as a diagrammatic method for logic minimization and it is a pictorial view of truth table which shows the relationship between inputs and output.
Detailed explanation-2: -A Karnaugh map (K-map) is a visual method used to simplify the algebraic expressions in Boolean functions without having to resort to complex theorems or equation manipulations.
Detailed explanation-3: -K-map (Karnaugh Map) is a pictorial method used to minimize Boolean expression without having to use Boolean Algebra theorems and equation manipulation. K-map can be thought of as a special version of a truth table. Using K-map, expression with two to four variables are easily minimized.
Detailed explanation-4: -K-map (Karnaugh map) is a method of simplifying the Boolean expressions.