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) |
||
| Line 21: | Line 21: | ||
| T | | T | ||
|} | |} | ||
| + | |||
| + | <b>(A) </b>¬Q□¬P | ||
| + | | ||
| + | <b>(B) </b>P□¬Q | ||
| + | | ||
| + | <b>(C) </b>¬P□Q | ||
| + | | ||
| + | <b>(D) </b>¬P□¬Q | ||
| + | ==={{Template:Author|Happy Mittal|{{mittalweb}} }}=== | ||
| + | |||
| + | If we compare column of $P□Q$ in table with $P ∨ Q$, we need both $F$ in $3^{rd}$ row of table, and for that we need | ||
| + | $¬Q$ instead of $Q$. So $P ∨ Q$ is equivalent to $P□¬Q$, and therefore, option <b>(B)</b> is correct. | ||
| + | |||
| + | {{Template:FBD}} | ||
| + | |||
| + | [[Category: GATE2009]] | ||
| + | [[Category: Graph Theory questions]] | ||
The binary operation □ is defined as follows
| P | Q | P□Q |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | F |
| F | F | T |
(A) ¬Q□¬P (B) P□¬Q (C) ¬P□Q (D) ¬P□¬Q
If we compare column of $P□Q$ in table with $P ∨ Q$, we need both $F$ in $3^{rd}$ row of table, and for that we need $¬Q$ instead of $Q$. So $P ∨ Q$ is equivalent to $P□¬Q$, and therefore, option (B) is correct.
The binary operation □ is defined as follows
| P | Q | P□Q |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | F |
| F | F | T |
(A) ¬Q□¬P (B) P□¬Q (C) ¬P□Q (D) ¬P□¬Q
If we compare column of $P□Q$ in table with $P ∨ Q$, we need both $F$ in $3^{rd}$ row of table, and for that we need $¬Q$ instead of $Q$. So $P ∨ Q$ is equivalent to $P□¬Q$, and therefore, option (B) is correct.
GATECSE