Opening your dashboard
Class 12 Maths Chapter 1 Relation and Functions: Previous Year Questions
37 questions on Chapter 1, each solved step by step. Class 12 Maths, CBSE 2026-27.
37 questions with solutions
1–5 marks · Mixed difficulty
The first 12 solutions are on this page. This chapter is a long one, so the rest open on their own page to keep this one quick to load.
- 11 mark
Question 1
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is
Solve with AIAnswer
(A) 720
(B) 120
(C) 30
- Correct
(D) 0
Option (D) is correct.
Explanation: We know that, if A and B are two non-empty finite sets containing m and n elements, respectively, then the number of one-one and onto mapping from A to B is
- n! if m = n
- 0 if m ≠ n
Given that, m = 5 and n = 6
∴ m ≠ n
Number of one-one and onto mapping = 0
Why the other options are wrong:
- (A) 720 is the number of one-one maps from to . None of them is onto, because the 5 elements of can reach only 5 of the 6 elements of .
- (B) 120 is the number of one-one onto maps between two sets that both have 5 elements. Here has 6 elements, so this count does not apply.
- (C) 30 is the number of ordered pairs in , not a number of functions.
- 21 mark
Question 2
Let A = {3, 5}. Then number of reflexive relations of A is:
Solve with AIAnswer
(A) 2
- Correct
(B) 4
(C) 0
(D) 8
Option (B) is correct.
Explanation: A reflexive relation on must contain and . The only free choices are the other two pairs of , namely and . Each can be in or out, so there are reflexive relations:
, , and .
In general, a set with elements has such free pairs, so the number of reflexive relations is . Here :
Why the other options are wrong:
- (A) 2 treats only one of the two pairs , as free.
- (C) 0 is false: is already a reflexive relation on .
- (D) 8 treats three pairs as free, but only two are.
- 31 mark
Question 3
Let be a relation in the set given by
Choose the correct answer.
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Option (B) is correct.
Explanation: The set-builder form puts two conditions on a pair. For to belong to we need the equation to hold and the inequality to hold. Test each option against both.
Option Is ? Is ? In ? (A) , and — fails — holds No (B) — holds — holds Yes (C) , and — fails — holds No (D) — holds — fails No Only passes both tests, so (B) is the answer.
Option (D) is the trap worth naming. It satisfies the equation exactly, and a student who checks only the equation will choose it. The second condition is what kills it: with we do not have , so the pair is outside however well the equation fits.
Options (A) and (C) fail the other way round. Both have , so the inequality is fine, but the arithmetic does not come out right — would need and would need .
- 41 mark
Question 4
Let set and a relation is defined in as:
, then minimum ordered pairs which should be added in relation to make it reflexive and symmetric are:
Solve with AIAnswer
(A)
(B)
(C)
- Correct
(D)
Option (D) is correct.
Explanation: on . For to be reflexive, it must contain — is already present, so and must be added.
For to be symmetric, every pair needs its reverse: requires ; requires ; is already self-paired.
So the minimum pairs to add are , , , and .
Why the other options are wrong:
- (A) leaves out , so is still not reflexive. It also leaves out , the reverse of , and adds without its reverse , so is not symmetric.
- (B) makes reflexive, but is still without its reverse , so is not symmetric.
- (C) also leaves out , and adds without , so is not symmetric.
- 51 mark
Question 5
If is a relation in set Z, then domain of is:
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Option (B) is correct.
Explanation: Given,
An integer is in the domain of exactly when some integer gives .
Since , any such must satisfy , so . Conversely, if , then works, because .
So the domain is , and the integers with are .
Thus, domain of = .
Why the other options are wrong:
- (A) drops and . They satisfy just as and do; for example .
- (C) drops and for the same reason; for example .
- (D) is the set of integers with , which comes from wrongly putting . But , so is in the domain.
- 61 mark
Question 6
A relation in set is defined as . Which of the following ordered pair in shall be removed to make it an equivalence relation in ?
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Option (B) is correct.
Explanation:
We are given on . Test the three properties on as it stands.
Reflexive? Yes. The loops , and are all present, so every element of is related to itself.
Symmetric? No. but . This is the only ordered pair that breaks the property.
Transitive? Yes. Apart from the loops, the only chain we can form through a common middle element is followed by , and it requires — which is already there. Nothing is missing, so is transitive as given.
So fails exactly one property, symmetry, and the single pair responsible is . Deleting it leaves , the identity relation on , which is reflexive, symmetric and transitive — an equivalence relation.
Here is what each choice would leave behind:
Pair removed What is left Verdict (A) is gone, so not reflexive (B) reflexive, symmetric and transitive (C) not reflexive, and still not symmetric (D) not reflexive, and still not symmetric Options (A), (C) and (D) each delete a loop, which destroys reflexivity, and none of them repairs the missing . Only (B) works.
- 71 mark
Question 7
Let the relation R in the set , given by . Then, [1], the equivalence class containing 1, is:
Solve with AIAnswer
- Correct
(A)
(B)
(C)
(D)
Option (A) is correct.
Explanation: An equivalence class of an element is:
Two numbers are related if their difference is divisible by 4.
Compute
- Start with
- Find all such that is a multiple of 4:
- So we get:
- Any other values? , so stop.
The equivalence class of 1 is:
Why the other options are wrong:
- (B) : and are not multiples of 4, so and are not related to .
- (C) : is reflexive, so and . An equivalence class is never empty.
- (D) : not every element of is related to ; for example is not a multiple of 4.
- 81 mark
Question 8
Let be the relation in the set given by
Which of the following ordered pairs belongs to ?
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Option (B) is correct.
Explanation: For an ordered pair to belong to , it must satisfy:
Check each option:
-
(A) — , but , so the second condition fails.
-
(B) — and , so both conditions hold.
-
(C) — , so the first condition fails.
-
(D) — , so the first condition fails.
- 91 mark
Question 9
Let and the relation is defined by , . Then, this function is:
Solve with AIAnswer
(A) injective only
(B) not bijective
(C) surjective only
- Correct
(D) bijective
Option (D) is correct.
Explanation: Read the codomain carefully before anything else. It is not ; it is , the set of perfect squares of natural numbers. That single fact decides the question.
One-one (injective). Let with . Then
Since , both are at least , so . The first factor can never be zero, so the second one must be: , i.e. . Hence is one-one.
Onto (surjective). Take any in the codomain . By the very definition of , there is some with . For that we have . So every element of the codomain has a pre-image, and is onto. (This is why was defined the way it was: the codomain has been trimmed down to exactly the set of outputs.)
One-one and onto together mean is bijective, so (D) is correct.

Why the other options are wrong:
Option The mistake (A) injective only Reading the codomain as instead of . On the map really is injective only, because , , , are then in the codomain and have no pre-image. But and , so they are not in this codomain at all and cannot witness a failure of ontoness. (B) not bijective The same codomain slip, stated as a negation. is bijective here. (C) surjective only Onto is right, but injectivity is then wrongly denied — usually by arguing and forgetting that is not a natural number. - 101 mark
Question 10
A function defined by is:
Solve with AIAnswer
(A) not one-one
(B) one-one
(C) not onto
- Correct
(D) neither one-one nor onto
Option (D) is correct.
Explanation:
Here and .
Is one-one? Take and . Both lie in the domain , and
So while . Two different inputs share one image, so is not one-one.
(Solving gives , i.e. . That line alone settles nothing — a one-one function could also satisfy it, if the minus case never actually occurred in its domain. What makes many-one is that really is in the domain and really does give the same value as .)
Is onto? For every real we have , so . The range is therefore , a proper subset of the codomain . Concretely, take in the codomain:
and no real number has a negative square. So has no pre-image and is not onto.
Putting the two together, is neither one-one nor onto — which is option (D).

About the other options. (B) is plainly false, as shows. (A) and (C) each record one true half of the behaviour, but each stops halfway; (D) is the only option that classifies completely, so it is the answer required.
- 111 mark
Question 11
Let set and a relation is defined in as , then minimum ordered pairs which should be added in relation to make it reflexive and symmetric are:
Solve with AIAnswer
(A)
(B)
(C)
- Correct
(D)
Option (D) is correct.
Explanation: Here and . We work out separately what each of the two properties forces us to add.
What reflexivity forces. is reflexive only if it contains for every , that is , and . Of these only is already present, so and must be added.
What symmetry forces. is symmetric only if the reverse of every pair in it is also in it.
pair in reverse needed present? no — must be added yes no — must be added Nothing further is set off by these additions: and are their own reverses, and the reverses of and are and , which were in from the start.
So exactly four pairs are needed, and no set of fewer than four can work, because , , and are each forced individually:
which is option (D).
Why the other options fail:
- (A) — leaves out , so the relation is still not reflexive. It also spots that needs but forgets that needs , and the extra it adds has no reverse , so symmetry is broken in two places.
- (B) — reflexivity is handled, but is still left without its reverse . This is the mistake of checking only the pairs that involve on the left.
- (C) — has the two reflexive pairs but again omits , and adds the unnecessary whose own reverse is missing. It is both larger than the answer and still not symmetric, so it is not minimal either.
- 121 mark
Question 12
If is a relation in set , then domain of is:
Solve with AIAnswer
(A)
- Correct
(B)
(C)
(D)
Option (B) is correct.
Explanation: The domain of a relation is the set of all first coordinates of its ordered pairs. So an integer lies in the domain of exactly when there is at least one integer with .
Since for every integer , the choice makes the condition as easy as possible, and it reduces to
That choice is also the best possible: any gives , so it demands , which is a stronger requirement. Hence is in the domain if and only if .
The integers with are , and each of them really does appear as a first coordinate:
a that works check So the domain of is .
Why the other options fail:
- (A) — drops the negative integers. Squaring destroys the sign, so and satisfy just as well as and do.
- (C) — the mirror image of the same slip, keeping only the values that are not positive.
- (D) — this is the solution set of , i.e. of . It comes from reading the condition as , putting in place of in the second square.
- 131 mark
Question 13
A relation is defined on . Which of the following is the reflexive relation?
- 141 mark
Question 14
The number of equivalence relations in the set containing the elements and is:
- 151 mark
Question 15
A relation is defined on as: if and only if .
Then, is:
- 162 marks
Question 16
Check whether the relation in the set of integers defined as is reflexive, symmetric, or transitive. Write the equivalence class containing 0, i.e. .
- 173 marks
Question 17
Show that the relation R on defined as is reflexive, and transitive but not symmetric.
- 183 marks
Question 18
Check whether the relation in the set of real numbers, defined by
is reflexive, symmetric or transitive.
- 193 marks
Question 19
A relation R on set is defined as .
Check whether the relation R is reflexive, symmetric, and transitive.
- 202 marks
Question 20
A function is defined from as , such that and . Find the function . Hence, check whether the function is one-one or onto.
- 213 marks
Question 21
Check if the relation R in the set of real numbers defined as is
(i) symmetric,
(ii) transitive.
- 223 marks
Question 22
Let denote the set of words in the English dictionary. Define the relation by
Show that this relation is reflexive and symmetric, but not transitive.
- 232 marks
Question 23
Check whether the relation in the set of integers defined as
is reflexive, symmetric, or transitive. Write the equivalence class containing 0, i.e., .
- 243 marks
Question 24
Show that the function , given by , is one-one but not onto.
- 252 marks
Question 25
Show that the function , defined by
is neither one-one nor onto.
- 263 marks
Question 26
Prove that the function , defined by
is one-one but not onto.
- 273 marks
Question 27
Let be a function. Define a relation on given by
Show that is an equivalence relation on .
- 282 marks
Question 28
Prove that the function is surjective, where is defined by
Is the function injective? Justify your answer.
- 292 marks
Question 29
Let , and be a function from A to B.
State whether f is one-one or not.
- 303 marks
Question 30
Let be defined as:
Find whether the function is bijective or not.
- 315 marks
Question 31
Define the relation in the set as follows: For , if . Prove that is an equivalence relation in .
- 325 marks
Question 32
Show that the relation in the set given by
is an equivalence relation.
- 335 marks
Question 33
A function is given by . Show that is an onto function but not a one-one function. Further, find all possible values of for which .
- 345 marks
Question 34
Show that a function defined by is neither one-one nor onto. Further, find set so that the given function becomes an onto function.
- 355 marks
Question 35
Let and . Consider the function , defined by . Show that f is one-one and onto.
- 364 marks
Question 36
An organization conducted a bike race under two different categories — Boys and Girls. There were 28 participants in all, of whom three boys and two girls were finally selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let and , where B represents the set of Boys selected and G the set of Girls selected for the final race.

Based on the above information, answer the following questions:
(i) How many relations are possible from B to G?
(ii) Among all the possible relations from B to G, how many functions can be formed from B to G?
(iii) Let be the relation on defined by . Check if R is an equivalence relation.
OR
A function is defined as . Check if this function is injective. Justify your answer.
- 374 marks
Question 37
A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever recorded.
Let be the set of all citizens of India who were eligible to exercise their voting right in the general election held in 2019. A relation is defined on as follows:
- Two neighbours and . exercised his voting right while did not cast her vote in the general election of 2019. Which of the following is true?
- (A)
- (B)
- (C)
- (D)
- Mr. and his wife both exercised their voting right in the general election of 2019. Which of the following is true?
- (A) Both and
- (B) but
- (C) but
- (D) but
- Three friends , and exercised their voting right in the general election of 2019. Then which of the following is true?
- (A) , and
- (B) , but
- (C) , and
- (D) , and
- In the above question No. 3, defined relation is
- (A) Symmetric and transitive but not reflexive
- (B) Universal relation
- (C) Equivalence relation
- (D) Reflexive but not symmetric and transitive
