Computer Sciences > GATE 2021 SET-1 > Boolean Algebra
Consider the following Boolean expression.
F = (X + Y + Z)(X̅ + Y)(Y̅ + Z)
Which of the following Boolean expressions is/are equivalent to F̅ (complement of F)?
F = (X + Y + Z)(X̅ + Y)(Y̅ + Z)
Which of the following Boolean expressions is/are equivalent to F̅ (complement of F)?
Explanation
Correct : b, c, d
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.