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

In a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. You give a fair coin t...
#27 MCQ
Let # be a binary operator defined as X # Y = X′ + Y′ where X and Y are Boolean variables. Consider the following two statements. S1: (P # Q) # R = P # (Q # R)...
#40 MCQ
Consider the following two statements. S1: If a candidate is known to be corrupt, then he will not be elected. S2: If a candidate is kind, he will be elected....
#56 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......