Truth Table and Boolean Expressions

Question 1
A
Both commutative and associative
B
Commutative but not associative
C
Not commutative but associative
D
Neither commutative nor associative
       Digital-Logic-Design       Truth Table and Boolean Expressions       GATE 2015 (Set-01)
Question 1 Explanation: 
It is clear that from the truth table, the binary operation # is equivalent to XOR i.e., ⊕, which satisfies both commutative and associative i.e., p#q q#p and p#(q#r) (p#q)#r
There is 1 question to complete.