Electrical Engineering > GATE 2016 SET-2 > Boolean Algebra
The output expression for the Karnaugh map shown below is
| ABC | 00 | 01 | 11 | 10 |
| 0 | 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
Explanation
Correct : b
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.