Q1.Marks: +2.0UGC NET Paper 2: Computer Science 2nd January 2026 Shift 1
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R Assertion A: Let R ⊂ A × A be a binary relation as defined below:
A= N × N; ((a,b), (c,d)) ∈ R if only if a ≤ c or b ≤ d. This binary relation R is a partial order. Reason R: A binary relation will be a partial order if this satisfy reflexive, anti-symmetric and transitive property.
In the light of the above statements, choose the most appropriate answer from the options given below
1.Both A and R are correct and R is the correct explanation of A
2.Both A and R are correct but R is NOT the correct explanation of A
3.A is correct but R is not correct
4.A is not correct but R is correct✓ Correct
Solution
The correct answer is A is not correct but R is correct.
Key Points
Given relation: R ⊂ A × A, where A = ℕ × ℕ and ((a,b),(c,d)) ∈ R ⇔ a ≤ c or b ≤ d
To be a partial order, relation must be Reflexive, Anti-symmetric, and Transitive.
Reflexive: For any (a,b) ∈ A, we check (a,b) R (a,b) ⇒ a ≤ a or b ≤ b ⇒ True. Hence reflexive property holds.
Anti-symmetric test: Take (1,2) and (2,1). (1,2) R (2,1) ⇒ 1 ≤ 2 (True) (2,1) R (1,2) ⇒ 1 ≤ 2 (True) But (1,2) ≠ (2,1). Hence anti-symmetry fails.
Since anti-symmetry fails, relation is not a partial order. Therefore Assertion A is false.
Reason R: Definition of partial order is correct. Hence Reason R is true.
Additional Information
Partial Order Conditions:
Reflexive: aRa
Anti-symmetric: aRb and bRa ⇒ a=b
Transitive: aRb and bRc ⇒ aRc
Conclusion:
Relation fails anti-symmetry ⇒ Not a partial order.