Computer Sciences > GATE 2014 SET-1 > Propositional Logic
Which one of the following propositional logic formulas is TRUE when exactly two of p, q, and r are TRUE?
A
((p ↔ q) ∧ r) ∨ (p ∧ q ∧ ¬r)
B
(¬(p ↔ q) ∧ r) ∨ (p ∧ q ∧ ¬r)
C
((p → q) ∧ r) ∨ (p ∧ q ∧ ¬r)
D
(¬(p ↔ q) ∧ r) ∧ (p ∧ q ∧ ¬r)

Correct : b

Similar Questions

Consider the following statements:P: Good mobile phones are not cheapQ: Cheap mobile phones are not goodL: P implies QM: Q implies PN: P is equivalent to QWhich...
#1275 MCQ
Consider the following statements:P: Good mobile phones are not cheapQ: Cheap mobile phones are not goodL: P implies QM: Q implies PN: P is equivalent to QWhich...
#1275 MCQ
Consider the following statements:P: Good mobile phones are not cheapQ: Cheap mobile phones are not goodL: P implies QM: Q implies PN: P is equivalent to QWhich...
#1275 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......