Computer Sciences > Gate 2019 > Propositional Logic

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which one of the following is NOT a valid identity?

A

(x⊕y) ⊕z = x⊕(y ⊕ z)

B

(x + y) ⊕z = x ⊕ (y + z)

C

x ⊕ y = x + y, if xy = 0

D

x ⊕ y = (xy + x′y′)′

Check Answer

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science