COMPUTER SCIENCE AND ENGINEERING
DIGITAL LOGIC
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
Corners in the same row
|
|
Corners in the same column
|
|
Diagonal corners
|
|
Overlapping combinations
|
Detailed explanation-1: -Question 1: Answer :c Diagonal corners can not be combined karnaugh-map groups Rules: No zeros allowed.
Detailed explanation-2: -Explanation: Each “1” entry in a K-map square represents a HIGH for each input truth table condition that produces a HIGH output. Thus, it represents a minterm.
Detailed explanation-3: -An XNOR gate is a basic comparator, because its output is “1” only if its two input bits are equal.
Detailed explanation-4: -1. Which statement below best describes a Karnaugh map? It is simply a rearranged truth table. The Karnaugh map eliminates the need for using NAND and NOR gates.
Detailed explanation-5: -The following combination is correct for an ODD parity data transmission system: data = 011011100 and parity = 0.