DAV INSTITUTIONS, WEST BENGAL ZONE

MATHEMATICS QUESTION BANK FOR CLASS : XII

SESSION: 2024-25
CHAPTER: RELATIONS AND FUNCTIONS
Q. NO. QUESTIONS MARKS
SECTION – A (MCQ)
1. (a) 1 1
2. (c) reflexive and symmetric 1
3. (d) 512 1
4. (d) 60 1
5. (c) {(1, 1), (3, 3), (3, 1), (2, 3)} 1
6. (a) reflexive 1
7. (d) bijective 1
8. (d) many-one, into function 1
9. (d) A is false but R is true. 1
10. (a) Both A and R are true and R is the correct explanation of A. 1
SECTION – B
11. R = {(a, b): a ≤ b }3

½
It is observed that
∴ R is not reflexive.
Now,
(1, 2) ∈ R (as 1 < 23 = 8)
½
But,
(2, 1) ∉ R (as 2 > 13 = 1)
∴ R is not symmetric.

We have 1

But
∴ R is not transitive.
Hence, R is neither reflexive, nor symmetric, nor transitive.

12. Let x1=2 and x2=1/2 then,

f(x1)=2/5 and f(x2)=2/5 but x1≠x2

1
Hence, f(x) is not one-one.

For onto:
Again, consider a value '1' as element in co-domain R.
𝑥
⇒𝑥 2+1=1 ⇒x2+1=x ⇒ x2−x+1=0 i.e., quadratic equation in x
Here, discriminant D < 0.
Hence, there is no real value of x∈R for which f(x)=1.
1
∴f is not an onto function.
13. Let A ={1,2,3,4,5,6}
A relation R is defined on set A is
R ={a,b: b=a+1}. Therefore, R ={(1,2),(2,3),(3,4),(4,5),(5,6)}
 Now, 6ϵA but (6,6)𝜌 ∉ R. 1
Therefore, R is not reflexive.
It can be observed that (1,2)ϵR but (2,1) ∉ R. Therefore, R is not
symmetric.
1
Now, (1,2),(2,3) ϵ R but (1,3) ∉ R. Therefore R is not transitive.
Hence, R is neither reflexive nor symmetric nor transitive.
14. Let A={0,1,2,3,4,5}
R be the equivalence relation on A.
Set R={(a,b)2divides(a−b)}
We have to find equivalence class [0]
To find equivalence class {0},put b=0
1
⇒a−0 is multiple of 2 .
⇒ a is multiple of 2.
Multiples of 2 in given set are 0,2 and 4 . 1
Hence equivalence class {0}={0,2,4}

15. Let (x, y) ∈R ⋂ S

⇒ (x, y) ∈R and (x, y) ∈S
⇒ (y, x)∈R and (y, x) ∈S (∵R and S are symmetric) ½
⇒ (y, x)∈R ⋂ S
⇒ R ⋂ S is symmetric ½
Let
⇒(a,b)∈R∪S
⇒(a,b)∈R or (a,b)∈S ½
⇒(b,a)∈Ror (b,a)∈S (Since, R and S are symmetric)
⇒(b,a)∈R∪S ½
Hence, S=R∪S is symmetric
16. 𝜋 𝜋 𝜋
𝑔𝑖𝑣𝑒𝑛 𝑓(𝑥) = cos 𝑥, ∀𝑥 ∈ 𝑅, 𝑛𝑜𝑤 𝑓 ( ) = 𝑐𝑜𝑠 = 0 ⇒ 𝑓 (− )
2 2 2 1
𝜋 𝜋 𝜋 𝜋 𝜋
= 𝑐𝑜𝑠 = 0 ⇒ 𝑓 ( ) = 𝑓 (− ) 𝑏𝑢𝑡 ≠ −
2 2 2 2 2
So f(x) is not one- one .
Now f(x) = cos 𝑥, ∀𝑥 ∈ 𝑅 𝑖𝑠 𝑛𝑜𝑡 𝑜𝑛𝑡𝑜 𝑎𝑠 there is no preimage for an 1
real number.
Which does not being to the intervals ,[-1,1],the range of cos x.
SECTION – C
17. Given that 𝐴 = [−1,1]
For one – one : 𝑓(𝑥) = 𝑥|𝑥| ⇒ 𝑥1 |𝑥1 | = 𝑥2 |𝑥2 | ⇒ 𝑥1 = 𝑥2 1
Therefore f(x) is one – one ½
Now let y= 𝑥|𝑥| ⇒ 𝑦 = 𝑥 2 ∀ 𝑥 ∈ 𝐴
1
Therefore f(x) is onto .
½
Hence f(x) is bijective
18. For all a∈A let (a,a)∈R1 &(a,a)∈R2
Hence, (a,a)∈ both R1&R2
Hence, (a,a)∈R1∩R2 1
∴ R1∩R2 is reflexive.
Checking symmetric.
Given that R1 and R2 are equivalence
relations. So, R1 is symmetric,
If (a,b)∈R1, then (b,a)∈R1…(1)
R2 is symmetric,
If (a,b)∈R1, then (b,a)∈R2…(2)
From (1) and (2)
If (a,b)∈R1∩R2 then (b,a)∈R1∩R2 1
Hence, R1∩R2 is symmetric.
 Checking transitive.
Given that R1 and R2 are equivalence relations. So, R1 is transitive,
if (a,b)∈R1&(b,c)∈R1, then (a,c)∈R1…(3)
R2 is transitive,
If (a,b)∈R2 & (b,c)∈R2, then (a,c)∈R2…(4)
From (3)&(4)
If (a,b)∈R1∩R2 and (b,c)∈R1∩R2
then (a,c)∈R1∩R2 ∴R1∩R2 is transitive. 1

19. R={(a,b):a,bϵZ} and (a−b) is divisible by 5

(i) Let aϵZ. Then,
a−a=0, which is divisible by 5
∴(a,a)ϵR for all aϵZ.
½
So, R is reflexive.
(ii) Let (a,b)ϵR. Then,
(a,b)ϵR⇒(a−b) is divisible by 5
⇒−(a−b) is divisible by 5
⇒(b−a) is divisible by 5 1
⇒(b,a)ϵR
Thus, (a,b)ϵR⇒(b,a)ϵR
So, R is symmetric.
(iii) Let (a,b)ϵR and (b,c)ϵR. Then,
(a,b)ϵR and (b,c)ϵR
⇒(a−b) is divisible by m and (b - c) is divisible by 5
1
⇒{(a−b)+(b−c)} is divisible by 5
⇒{(a−c)} is divisible by 5
⇒(a,c)ϵR
∴(a,b)ϵR and (b,c)ϵR⇒(a,c)ϵR.
So, R is transitive.
Thus, R is reflexive, symmetric and transitive. ½
Hence, R is an equivalence relation on Z.

20. f:N→N is defined as

It can be observed that:
1+1
f(1)= 2 =1 and f(2)=2/2=1
1
∴f(1)=f(2), where 1≠2
∴f is not one-one.
Consider a natural number (n) in co-domain N
Case I: n is odd
∴n=2r+1 for some r∈N. ½
Then, there exists 4r+1∈N such that f(4r+1)=4r+1+12=2r+1
½
Case II: n is even
∴n=2r for some r∈N.
Then, there exists 4r∈N such that f(4r)=4r/2=2r 1
∴f is onto.
Hence, f is not a bijective function
21. Test for reflexivity:
𝑍 −𝑍 ½
Since ,𝑍1 +𝑍1=0, which is a real number.
1 1
So,(𝑧1,𝑧1)∈𝑅
Hence,𝑅 is a reflexive relation.
(𝑖𝑖)Test for symmetric:
Let (𝑧1,𝑧2)∈𝑅
𝑍 −𝑍 1
⇒ 𝑍1+𝑍2 =𝑥, where 𝑥 is real
1 2
𝑍1 −𝑍2
⇒ −𝑍 =−𝑥
1 +𝑍2
𝑍2 −𝑍1
⇒𝑍 =−𝑥 is also a real number.
2 +𝑍1
So,(𝑧2,𝑧1)∈𝑅
Hence,𝑅 is symmetric relation.
(𝑖𝑖𝑖)Test for transitivity:
Let (𝑧1,𝑧2)∈𝑅 and (𝑧2,𝑧3)∈𝑅
𝑍 −𝑍
Then𝑍1 +𝑍2 =𝑥
1 2
⇒𝑧1−𝑧2=𝑥𝑧1+𝑥𝑧2
⇒Z1(1−𝑥)=𝑧2(1+𝑥)
⇒𝑧1/𝑧2=(1+𝑥)/(1−𝑥) .......(1)
𝑍 −𝑍 1
Also, 𝑍2 +𝑍3 =𝑦
2 3
⇒𝑧2−𝑧3=𝑦𝑧2+𝑦𝑧3
⇒𝑧2(1−𝑦)=𝑧3(1+𝑦)
⇒ 𝑧2/𝑧3=(1+y)/(1−y) .......(2)
Dividing (1) and (2), we get
𝑧1 1+𝑥 1−𝑦
= × = z where 𝑧 is a real number.
𝑧3 1−𝑥 1+𝑦
𝑍1 −𝑍3 𝑧−1
= 𝑧+1, which is real. ½
𝑍1 +𝑍3
⇒(𝑧1,𝑧3)∈𝑅 .......(3)
From (1),(2) and (3) we have as 𝑅 is an equivalence relation.

22. A={x∈Z:0≤x≤12}={0,1,2,3,4,5,6,7,8,9,10,11,12}
R={(a,b):|a−b|is a multiple of 4} ½
For any element a∈A, we have (a,a)∈R as |a−a|=0 is a multiple of 4.
∴R is reflexive.
Now, let (a,b)∈R⇒|a−b| is a multiple of 4.
⇒|−(a−b)|=|b−a| is a multiple of 4. ½
⇒(b,a)∈R
∴ is symmetric.
Now, let (a,b),(b,c)∈R
⇒|a−b| is a multiple of 4 and |b−c| is a multiple of 4. 1
⇒(a−b) is a multiple of 4 and (b−c) is a multiple of 4.
⇒(a−c)=(a−b)+(b−c) is a multiple of 4.
⇒|a−c| is a multiple of 4.
⇒(a,c)∈R.
∴R is transitive.
Hence, R is an equivalence relation.
The set of elements related to 1 is {1,5,9} since 1
|1−1|=0 is a multiple of 4,
|5−1|=4 is a multiple of 4, and
|9−1|=8 is a multiple of 4
Hence, R is an equivalence relation.
 SECTION – D
𝑥
23. f(x)=1−𝑥 −1<x<0andf(x)=x1+x,0≤x<1
𝑥
now(i)f(x)= 1−𝑥 , −1<x<0
Let f(x1)=f(x2)
𝑥 𝑥 1
⇒1−𝑥1 = 1−𝑥2
1 2
⇒𝑥1 (1 − 𝑥2 )= 𝑥2 (1 − 𝑥1 )
⇒ 𝑥1 = 𝑥2 ⇒f is one-one
𝑥
Let y=1−𝑥
𝑦 1
⇒y−xy=x ⇒y=x+xy ⇒y=x(1+y) ⇒x=1+𝑦
𝑦 ½
⇒∃ x=1+𝑦 for all valves of y≠−1
s.t f(x)=y
⇒f(x) is onto
𝑥
(ii)f(x)= 1−𝑥 0≤x≤1
𝑥 𝑥
⇒1+𝑥1 = 1+𝑥2
1 2
⇒𝑥1 (1 + 𝑥2 )= 𝑥2 (1 + 𝑥1 ) 1
⇒ 𝑥1 = 𝑥2 ⇒ f is one -one
𝑥
Let y=1+𝑥
𝑦
⇒y+xy=x ⇒y=x-xy ⇒y=x(1-y) ⇒x=1−𝑦
𝑦 1
⇒∃ x=1−𝑦 for all valves of y≠1
⇒ f is onto
hence f(x) is one-one and onto (proved) ½

24. f:N→Y
f(x)=4x2+12x+15
A function is bijective if the function is one-one and onto. ½
Let x1,x2∈N, such that
f(x1)=f(x2)
½
4x12+12x1+15=4x22+12x2+15
⇒(x1−x2)(x1+x2+3)=0
∵ x1,x2 ∈N 1
⇒x1+ x2+3≠0
∴x1=x2
Thus, f(x) is one-one.
The function is onto if there exist x in N such that f(x)=y ½
∴4x2+12x+15=y
⇒4x2+12x+(15−y)=0
Here,
1
a=4
b=12
c=15−y
From quadratic formula,
−3±√𝑦−6 1
⇒𝑥 =
2
∵x∈N
−3 + √𝑦 − 6 ½
𝑥= , 𝑥 ≥ 6 ⇒ 𝑓𝑜𝑟 𝑥 ≥ 6 , 𝑓( 𝑥)𝑖𝑠 𝑜𝑛𝑡𝑜.
2
25. A={1,2,3...9}
R in A×A
(a,b) R (c,d) if (a,b)(c,d) ∈ A X A
a+b=b+c
1
Consider (a,b) R (a,b) (a,b)∈A×A
a+b=b+a
Hence, R is reflexive.
Consider (a,b) R (c,d) given by (a,b) (c,d) ∈ A×A
a+d=b+c =>c+b=d+a 1
⇒(c,d)R(a,b)
Hence R is symmetric.
Let (a,b) R (c,d) and (c,d) R (e,f)
(a,b),(c,d),(e,f),∈A×A
a+b=b+c and c+f=d+e
a+b=b+c
⇒a−c=b−d-- (1) 2
c+f=d+e-- (2)
Adding (1) and (2)
a−c+c+f=b−d+d+e
a+f=b+e
(a,b)R(e,f)
R is transitive.
R is an equivalence relation.
We select from set A={1,2,3,....9}
a and b such that 2+b=5+a
so b=a+3
Consider (1,4)
(2,5) R (1,4) ⇒2+4=5+1
[(2,5)=(1,4)(2,5),(3,6),(4,7),(5,8),(6,9)] is the equivalent class under 1
relation R.

26. We know that a relation 𝑅 is an equivalence relation if it is reflexive,

symmetric and transitive.
For reflexive:
For any (𝑎,𝑏)∈𝑁×𝑁; 𝑎𝑏=𝑏𝑎 1
⇒(𝑎,𝑏)𝑅(𝑎,𝑏)
Thus, 𝑅 is reflexive.

For symmetric:
Let (𝑎,𝑏)𝑅(𝑐,𝑑) for any 𝑎,𝑏,𝑐,𝑑,∈𝑁 1
∴𝑎𝑑=𝑏𝑐
⇒𝑐𝑏=𝑑𝑎
⇒(𝑐,𝑑)𝑅(𝑎,𝑏)
∴𝑅 is symmetric.

For transitive:
Let (𝑎,𝑏)𝑅(𝑐,𝑑) and (𝑐,𝑑)𝑅(𝑒,𝑓) for 𝑎,𝑏,𝑐,𝑑,𝑒,𝑓∈𝑁 2
Then 𝑎𝑑=𝑏𝑐 and 𝑒𝑓=𝑑𝑒
⇒𝑎𝑑𝑐𝑓=𝑏𝑐𝑑𝑒
⇒𝑎𝑓=𝑏𝑒
⇒(𝑎,𝑏)𝑅(𝑒,𝑓)
Thus, 𝑅 is transitive. 1

Hence, 𝑅 is an equivalence relation.

27. Solve for one-one.
Here we are making 3 cases:
Case (i): both x1 and x2 are odd. Case (ii): both x1 and x2 are even.
Case (iii): x1 is odd and x2 is even.
Case (i): both x1 and x2are odd.
f(x1)=x1+1 and f(x2)=x2+1⇒ f(x1)=f(x2) ⇒x1+1=x2+1 ⇒x1=x2....(1) 1

Case (ii): both x1 and x2 are even. 1

f(x1)=x1 -1 and f(x2)=x2 -1⇒ f(x1)=f(x2) ⇒x1 -1=x2 -1 ⇒x1=x2....(2)
Case (iii): x1 is odd and x2 is even.
f(x1)=x1+1 and f(x2)=x2 -1⇒ f(x1)=f(x2) ⇒x1+1=x2 -1 1
⇒ x2−x1=2
which is impossible as difference between even and odd number can
never be even.
Hence, if f(x1)=f(x2)
Then x1=x2
∴function f is one-one.
Solve for onto:
𝑥 + 1 , 𝑖𝑓 𝑥 𝑖𝑠 𝑜𝑑𝑑
𝑓(x) ={
𝑥 − 1, 𝑖𝑓 𝑥 𝑖𝑠 𝑒𝑣𝑒𝑛
Let f(x)=y, such that y∈N
If x is odd then, 1
f(x)=x+1⇒ y=x+1⇒ x=y−1
Now, when x is odd then y is even.
If x is even then,
f(x)=x−1⇒ y=x−1⇒ x=y+1 1
Now, when x is odd then y is even.
Hence, if y is a natural number, x will also be a natural number.
i.e. y ∈N
Hence, f is one-one and onto.
28. A=R−{3}, B=R−{1}
f:A→B
𝑥−2
f(x)=𝑥−3
𝑥1 − 2 𝑥2 − 2 2
𝑙𝑒𝑡 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ = ⇒ 𝑥1 = 𝑥2
𝑥1 − 3 𝑥2 − 3
So, f(x) is one-one
𝑥−2
f(x)= 𝑥−3
𝑥−2 2
y=𝑥−3
y(x−3)=x−2 ⇒yx−3y=x−2⇒ yx−x=3y−2⇒ x(y−1)=3y−2
3𝑦−2
⇒x= 𝑦−1
3𝑦−2 1
𝑥−2 −2
𝑦−1
f(x)= 𝑥−3 = 3𝑦−2 =y
−3
𝑦−1
f(x)=y
f(x) is onto.
So f(x) is bijective

SECTION – E (Case-Based)
29. (i) Since every number is divisible by itself,
So (1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6) ∈ R. 1
So, R is reflexive relation on B. Also (1, 2) ∈ R but (2, 1) does not
belong here non-symmetric.
(ii) R = {(1, 2), (2, 2), (1, 3), (3, 4), (3, 1), (4, 3), (5, 5),}
 Since (1, 1) ∈ R, so R is not reflexive. Hence ‘R’ is not an equivalence 1
relation.
(iii) As number of functions possible from set A to set B, if set A
contains m elements and set B contains n elements is given by nm. 2
Now, n(A) = 2 ; n(B) = 6
Number of possible functions = 62
OR
As, number of relations from a set with ‘m’ elements to a set with n
elements is 2mn. Now n (A) = 2 ; n (B) = 6
Required number of relations = 212

30. (i) R = {(V1, V2): V1, V2 ∈ I and both use their voting rights}
It is given that X exercised his voting right and Y didn’t cast her vote. 1
So, X is not related to Y, i.e. (X, Y) ∈ R.
(ii) R = {(V1, V2) : V1, V2 ∈ I and both use their voting rights}
It is given that Mr X and his wife W both exercised their voting rights 1
in election. So, X is related to W and W is related to X, i.e.
(X, W) ∈ R and (W, X) ∈ R
(iii) Since all the three friends F1, F2 and F3 exercised their voting
rights in election, so (F1, F2) ∈ R, 2
(F2, F3) ∈ R and (F1, F3) ∈ R.
OR
Let V be any person in I. Then V and V use their voting rights in
election Þ (V, V) ∈ R
Thus (V, V) ∈ R for all V ∈ I. So, R is reflexive relation on I.
Let V1 and V2 be two persons in A such that (V1, V2) ∈ R. Then,
(V1, V2) ∈ R ⇒ V1 and V2 both use their voting rights
⇒ V2 and V1 both use their voting rights.
⇒ (V2, V1) ∈ R
R is symmetric on I.
Let V1, V2, V3 be three person in I such that (V1, V2) ∈ R and (V2,
V3) ∈ R. Then (V1, V2) ∈ R ⇒ V1 and V2 both use their voting
rights.
and (V2, V3) ∈ R ⇒ V2 and V3 both use their voting rights. So, V1
and V3 both use their voting rights.
⇒ (V1, V3) ∈ R
So, R is transitive on I.
Hence, R is an equivalence relation.