Line 38: Line 38:
  
 
[[Category: GATE2009]]
 
[[Category: GATE2009]]
[[Category: Graph Theory questions]]
+
[[Category: Graph Theory questions from GATE]]

Revision as of 11:38, 15 July 2014

The binary operation □ is defined as follows

$P$ $Q$ $P□Q$
T T T
T F T
F T F
F F T

Which one of the following is equivalent to $P ∨ Q$?

(A) $\neg Q □ ¬P$

(B) $P□\neg Q$

(C) $\neg P□Q$

(D) $\neg P□ \neg Q$

Solution by Happy Mittal

If we compare column of $P□ Q$ in table with $P ∨ Q$, we need T in $3^{rd}$ row of table and F in the fourth row, and for that we need $\neg Q$ instead of $Q$. So $P ∨ Q$ is equivalent to $P□\neg Q$.




blog comments powered by Disqus

The binary operation □ is defined as follows

$P$ $Q$ $P□Q$
T T T
T F T
F T F
F F T

Which one of the following is equivalent to $P ∨ Q$?

(A) $\neg Q □ ¬P$

(B) $P□\neg Q$

(C) $\neg P□Q$

(D) $\neg P□ \neg Q$

Solution by Happy Mittal[edit]

If we compare column of $P□ Q$ in table with $P ∨ Q$, we need T in $3^{rd}$ row of table and F in the fourth row, and for that we need $\neg Q$ instead of $Q$. So $P ∨ Q$ is equivalent to $P□\neg Q$.




blog comments powered by Disqus