## Truth Table and Boolean Expressions

Question 1 |

Both commutative and associative | |

Commutative but not associative | |

Not commutative but associative | |

Neither commutative nor associative |

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.