1.8k views

The binary operator $\neq$ is defined by the following truth table.

$$\begin{array}{|l|l|l|} \hline \textbf{p} & \textbf{q}& \textbf{p} \neq \textbf{q}\\\hline \text{0} & \text{0}& \text{0}\\\hline \text{0} & \text{1}& \text{1}\\\hline \text{1} & \text{0}& \text{1}\\\hline \text{1} & \text{1}& \text{0}\\\hline \end{array}$$

Which one of the following is true about the binary operator $\neq$ ?

1. Both commutative and associative
2. Commutative but not associative
3. Not commutative but associative
4. Neither commutative nor associative

edited | 1.8k views

option A :  as it is XOR operation
by Active (1.2k points)
selected by
+14

p=0 q=1 r=0

Commutative
p ≠ q => 0≠ 1 => 1
q ≠ p => 1≠ 0 =>1

Assosicative
p≠(q≠r)  => 0≠(1≠0) =>0≠1 =>1
(p≠q)≠r  => (0≠1)≠0 => 1≠0 => 1

+2
Although this works fine here but you can not say # is commutative/Associative by just taking a single input combination.
0
To say associative it should be true for all cases ..we can  check that by putting one of the variable as 0 and 1

The binary operator ≠ is EXOR (⊕) operator.And  EXOR (⊕) operator is Commutative as well as Associative.

## The correct answer is (A)Both commutative and associative

by Loyal (8k points)