Arjun Suresh (talk | contribs) (Created page with "The binary operation □ is defined as follows {| class="wikitable" ! P ! Q ! P□Q |- | T | T | T |- | T | F | T |- | F | T | F |- | F | F | T |}") |
Arjun Suresh (talk | contribs) |
||
| (12 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
The binary operation □ is defined as follows | The binary operation □ is defined as follows | ||
{| class="wikitable" | {| class="wikitable" | ||
| − | ! P | + | ! $P$ |
| − | ! Q | + | ! $Q$ |
| − | ! P□Q | + | ! $P□Q$ |
|- | |- | ||
| T | | T | ||
| Line 21: | Line 21: | ||
| T | | T | ||
|} | |} | ||
| + | Which one of the following is equivalent to $P \vee Q$? | ||
| + | |||
| + | (A) $\neg Q □ &neg P$ | ||
| + | |||
| + | (B) '''$P□\neg Q$''' | ||
| + | |||
| + | (C) $\neg P□Q$ | ||
| + | |||
| + | (D) $\neg P□ \neg Q$ | ||
| + | ==={{Template:Author|Happy Mittal|{{mittalweb}} }}=== | ||
| + | |||
| + | 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$. | ||
| + | |||
| + | {{Template:FBD}} | ||
| + | |||
| + | [[Category: GATE2009]] | ||
| + | [[Category: Graph Theory questions from GATE]] | ||
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 \vee Q$?
(A) $\neg Q □ &neg P$
(B) $P□\neg Q$
(C) $\neg P□Q$
(D) $\neg P□ \neg Q$
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$.
The binary operation □ is defined as follows
| P | Q | P□Q |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | F |
| F | F | T |
GATECSE