COMPUTER SCIENCE AND ENGINEERING
COMPUTER ARCHITECTURE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
A’B’-A’B-AB-AB’
|
|
|
A’B’-A’B-AB’-AB
|
|
|
AB-AB’-A’B-A’B’
|
|
|
A’B’-AB’-A’B-AB
|
Detailed explanation-1: -2 Variable K-Map 2 variables have 2n = 22 = 4 minterms. Therefore there are 4 cells (squares) in 2 variable K-map for each minterm. Consider variable A & B as two variables. The rows of the columns will be represented by variable B.
Detailed explanation-2: -Answer: – The Karnaugh map or k-map is a graphical technique for simplifying Boolean function. The k-map in a two dimensional representation of a truth table it provides a simpler method for minimizing logic expressions. The map method is ideally suited for four or less variables.
Detailed explanation-3: -Simplify the given 2-variable Boolean equation by using K-map. We put 1 at the output terms given in equation. In this K-map, we can create 2 groups by following the rules for grouping, one is by combining (X’, Y) and (X’, Y’) terms and the other is by combining (X, Y’) and (X’, Y’) terms.
Detailed explanation-4: -Specifically, here are the “rules” for K-map groups that ensure each one corresponds to a single AND gate: Groups must contain only 1’s inside. Groups must be a rectangle-although this rectangle can wrap around the top or bottom of the table. The sides of the rectangle must be a power of two: 1, 2, or 4.