GATEverse
← GATE CSE 2006

Q28

MCQ2 marks, −0.5

A logical binary relation ⊙\odot, is defined as follows:

ABA⊙BTrueTrueTrueTrueFalseTrueFalseTrueFalseFalseFalseTrue\begin{array}{|l|l|l|} \hline \textbf{A} & \textbf{B}& \textbf{A} \odot \textbf{B}\\\hline \text{True} & \text{True}& \text{True}\\\hline \text{True} & \text{False}& \text{True}\\\hline \text{False} & \text{True}& \text{False}\\\hline \text{False} & \text{False}& \text{True}\\\hline \end{array}

Let ∼\sim be the unary negation (NOT) operator, with higher precedence then ⊙\odot. Which one of the following is equivalent to A∧BA\wedge B ?

Sign in to save attempts.

Loading…