UGC NET CS 2011 June-Paper-2
April 8, 2024Question 6925 – Engineering-Mathematics
April 8, 2024Question 6380 – Engineering-Mathematics
Let P, Q, R and S be Propositions. Assume that the equivalences P ⇔ (Q ∨ ¬ Q) and Q ⇔ R hold. Then the truth value of the formula (P ∧ Q) ⇒ ((P ∧ R) ∨ S) is always:
Correct Answer: A
Question 1013 Explanation:
Given data,
— Equivalence condition(Both RHS and LHS should be TRUE)= P ⇔ (Q V ~Q)
— Holding condition(Both RHS and LHS may TRUE/FALSE)= Q ⇔ R
— Equivalence condition(Both RHS and LHS should be TRUE)= P ⇔ (Q V ~Q)
— Holding condition(Both RHS and LHS may TRUE/FALSE)= Q ⇔ R
True
False
Same as truth table of Q
Same as truth table of S