Computer Sciences > GATE 2015 SET-1 > Boolean Algebra

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The binary operator ≠ is defined by the following truth table.

Which one of the following is true about the binary operator ≠?

A

Both commutative and associative

B

Commutative but not associative

C

Not commutative but associative

D

Neither commutative nor associative

Check Answer

Explanation

Correct : a

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