Relations and Functions: CBSE Class 12 Previous Year Questions
16 different questions from Relations and Functions (NCERT Chapter 1) asked in CBSE Class 12 Maths board exams 2026.
Pick a mark group to practise, each with answers and step-by-step solutions.
Most asked Relations and Functions questions
Assertion (A) : A function f:N→N given by f(x)=x3+2,∀x∈N is one-one but not onto.
Reason (R) : Since ∀y∈N (Codomain), there does not exist x=(y−2)1/3 in N (Domain) such that f(x)=x3+2=y.
- (A)Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
- (B)Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A).
- (C)Assertion (A) is true, but Reason (R) is false.
- (D)Assertion (A) is false, but Reason (R) is true.
Show answer & solution
Answer: (C) Assertion (A) is true, but Reason (R) is false.
- x13+2=x23+2⇒x1=x2, so f is one-one.
- y=1 (or 2) has no pre-image in N, so f is not onto. A is true.
- R says that for every y∈N no such x exists, which is false: for y=3, x=1∈N.
- So A is true but R is false.
Assertion (A): A relation R on the set {1, 2, 3} defined as R = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3)} is an equivalence relation.
Reason (R): A relation that is reflexive, symmetric and transitive is an equivalence relation.
- (A)Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the Assertion (A).
- (B)Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of the Assertion (A).
- (C)Assertion (A) is true, but Reason (R) is false.
- (D)Assertion (A) is false, but Reason (R) is true.
Show answer & solution
Answer: (A) Both A and R are true and R is the correct explanation of A.
- Reflexive: (1, 1), (2, 2), (3, 3) are in R.
- Symmetric: (1, 2) and (2, 1) are both in R.
- Transitive: (1, 2), (2, 1) give (1, 1) in R; (2, 1), (1, 2) give (2, 2) in R; all other cases are trivial.
- So R is an equivalence relation; R is the definition of an equivalence relation and explains A.
Check whether f:R−{3}→R defined as f(x)=x−3x−2 is onto or not.
Show answer & solution
Answer: Not onto (1 has no pre-image).
- Let y=x−3x−2. Then xy−3y=x−2⇒x(y−1)=3y−2⇒x=y−13y−2.
- This is not defined for y=1.
- Indeed x−3x−2=1 would need x−2=x−3, which is impossible.
- So 1∈R has no pre-image; f is not onto.
Check whether f:Z×Z→Z×Z (where Z is the set of integers) defined as f(x,y)=(2y,3x) is injective or not.
Show answer & solution
Answer: Injective.
- Let f(x1,y1)=f(x2,y2).
- Then (2y1,3x1)=(2y2,3x2), so 2y1=2y2 and 3x1=3x2.
- Hence y1=y2, x1=x2, i.e. (x1,y1)=(x2,y2).
- f is injective (one-one).
A relation R on A={1,2,3} is defined as R={(1,1)(3,3),(1,2)}. Is R a symmetric relation ? Justify. Write the smallest relation set R1 such that R∪R1 becomes an equivalence relation on the set {1,2,3}.
Show answer & solution
Answer: R is not symmetric; R1={(2,1),(2,2)}
- (1,2)∈R but (2,1)∈/R, so R is not symmetric.
- For reflexivity we need (2,2); for symmetry we need (2,1).
- R∪{(2,1),(2,2)}={(1,1),(2,2),(3,3),(1,2),(2,1)} is reflexive, symmetric and transitive.
- So the smallest R1={(2,1),(2,2)}.
Let A=R−{3} and B=R−{1}. A function f:A→B is defined by f(x)=(x−3x−2). Find whether f is one-one and onto.
Show answer & solution
Answer: f is one-one and onto.
- One-one: x1−3x1−2=x2−3x2−2⇒(x1−2)(x2−3)=(x2−2)(x1−3).
- ⇒−3x1−2x2=−3x2−2x1⇒x1=x2. So f is one-one.
- Onto: for y∈B, solve y=x−3x−2: x=y−13y−2, defined since y=1.
- x=3 (else 3y−2=3y−3, impossible), so x∈A and f(x)=y.
- Hence f is onto; f is one-one and onto.
Let n be a fixed positive integer. A relation R is defined in set Z such that R={(x,y):(x−y) is divisible by n, x,y∈Z}. Determine if R is an equivalence relation.
Show answer & solution
Answer: Yes, R is an equivalence relation.
- Reflexive: x−x=0=0⋅n, so (x,x)∈R for all x∈Z.
- Symmetric: if x−y=kn then y−x=(−k)n, so (y,x)∈R.
- Transitive: if x−y=kn and y−z=mn then x−z=(k+m)n, so (x,z)∈R.
- Hence R is an equivalence relation.
A school wants the students of class XII to do a project on ‘Sustainability’ keeping the world environment in mind. They select the student participants on the basis of an essay writing competition.
7 students out of 80 are selected for the project and are categorized into two sets such that :
Girl students belong to Set A = {G1,G2,G3,G4},
Boy students belong to Set B = {B1,B2,B3}.
Based on the above information, answer the following questions :
(i) How many relations are possible from Set A → Set B ? (1)
(ii) Let R be a relation from A → B such that R = {(G1,B1),(G2,B2),(G3,B2),(G4,B3),(G1,B2)}. Is R an injective function ? Justify your answer. (1)
(iii) (a) Let the relation R from A → A be such that R = {(x, y), x, y ∈ A, x and y are students from the same colony in the city} Verify if R is an equivalence relation. (2)
OR (iii) (b) Verify if any function f : B → A is bijective. Give reason to support your answer. (2)
Show answer & solution
Answer: (i) 212=4096 (ii) No, R is not a function (G1 has two images), so it is not an injective function. (iii) (a) Yes, R is an equivalence relation. OR (iii) (b) No; since n(B) = 3 < n(A) = 4, no function from B to A can be onto, so none is bijective.
- (i) n(A×B)=4×3=12, so the number of relations is 212=4096.
- (ii) G1 is related to both B1 and B2, so R is not a function and hence not an injective function.
- (iii) (a) Reflexive: every student is from the same colony as himself/herself. Symmetric: if x and y are from the same colony, so are y and x. Transitive: if x, y and y, z are from the same colony, then x, z are too. So R is an equivalence relation.
- (iii) (b) B has 3 elements and A has 4, so a function f : B → A has at most 3 images and cannot be onto; hence no such f is bijective.
A relation R is defined on Z, the set of integers, as
R={(x,y):∣x−y∣ is divisible by a prime number 'p', x,y∈Z}
check whether R is an equivalence relation or not.
Show answer & solution
Answer: R is an equivalence relation.
- Take p as a fixed prime.
- Reflexive: ∣x−x∣=0 is divisible by p, so (x,x)∈R for all x∈Z.
- Symmetric: if (x,y)∈R then p divides ∣x−y∣=∣y−x∣, so (y,x)∈R.
- Transitive: if (x,y),(y,z)∈R then x−y=kp and y−z=mp for integers k, m.
- Adding, x−z=(k+m)p, so p divides ∣x−z∣ and (x,z)∈R.
- R is reflexive, symmetric and transitive, so R is an equivalence relation.
A function f:R−{53}⟶R−{53} is defined as f(x)=5x−33x+2. Show that f is one-one and onto.
Show answer & solution
Answer: Proved.
- One-one: let f(a)=f(b). Then (3a+2)(5b−3)=(3b+2)(5a−3).
- 15ab−9a+10b−6=15ab−9b+10a−6⇒−19a=−19b⇒a=b. So f is one-one.
- Onto: let y∈R−{53} and solve y=5x−33x+2.
- 5xy−3y=3x+2⇒x(5y−3)=3y+2⇒x=5y−33y+2, defined since y=53.
- Also x=53: otherwise 15y+10=15y−9, impossible.
- Then f(x)=y, so every y has a pre-image and f is onto.
Practise smarter: chapter-wise revision, formula sheets and step-by-step NCERT solutions on
MonoMath CBSE →