Question 3239 – Reading-Comprehension
October 29, 20232017 November NTA UGC NET Paper 1
October 29, 2023UGC NET CS 2018-DEC Paper-2
|
Question 19
|
Match the List 1 and List 2 and choose the correct answer from the code given below
|
(a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
|
|
|
(a)-(ii), (b)-(i),(c)-(iii), (d)-(iv)
|
|
|
(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
|
|
|
(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
|
Question 19 Explanation:
Propositions r and s are logically equivalent if the statement r ↔ s is a tautology. ∼q⇒ ∼p
According to above table,
equivalence means p ⇔ q
Contrapositive means p⇒ q : ∼q⇒ ∼p
Converse means p⇒ q : q⇒ p
Implication means p ⇔ q
According to above table,
equivalence means p ⇔ q
Contrapositive means p⇒ q : ∼q⇒ ∼p
Converse means p⇒ q : q⇒ p
Implication means p ⇔ q
Correct Answer: C
Question 19 Explanation:
Propositions r and s are logically equivalent if the statement r ↔ s is a tautology. ∼q⇒ ∼p
According to above table,
equivalence means p ⇔ q
Contrapositive means p⇒ q : ∼q⇒ ∼p
Converse means p⇒ q : q⇒ p
Implication means p ⇔ q
According to above table,
equivalence means p ⇔ q
Contrapositive means p⇒ q : ∼q⇒ ∼p
Converse means p⇒ q : q⇒ p
Implication means p ⇔ q