KENDRIYA VIDYALAYA GACHIBOWLI, GPRA CAMPUS, HYD–32

PRACTICE PAPER 01 (2023-24) (ANSWERS)

CHAPTER 01 RELATIONS AND FUNCTIONS

SUBJECT: MATHEMATICS MAX. MARKS : 40

CLASS : XII DURATION : 1½ hrs
General Instructions:
(i). All questions are compulsory.
(ii). This question paper contains 20 questions divided into five Sections A, B, C, D and E.
(iii). Section A comprises of 10 MCQs of 1 mark each. Section B comprises of 4 questions of 2 marks
each. Section C comprises of 3 questions of 3 marks each. Section D comprises of 1 question of 5
marks each and Section E comprises of 2 Case Study Based Questions of 4 marks each.
(iv). There is no overall choice.
(v). Use of Calculators is not permitted

SECTION – A
Questions 1 to 10 carry 1 mark each.

1. The relation R in the set of real numbers defined as R = {(a, b) ∈ R × R : 1 + ab > 0} is

(a) reflexive and transitive (b) symmetric and transitive
(c) reflexive and symmetric (d) equivalence relation
Ans: (c) reflexive and symmetric

2. Let the function ‘f ’ be defined by f(x) = 5x2 + 2, ∀ x ∈ R. Then ‘f ’ is

(a) onto function (b) one-one, onto function
(c) one-one, into function (d) many-one, into function
Ans : (d) many-one, into function

3. Let set X = {1, 2, 3} and a relation R is defined in X as : R = {(1, 3), (2, 2), (3, 2)}, then
minimum ordered pairs which should be added in relation R to make it reflexive and symmetric
are
(a) {(1, 1), (2, 3), (1, 2)} (b) {(3, 3), (3, 1), (1, 2)}
(c) {(1, 1), (3, 3), (3, 1), (2, 3)} (d) {(1, 1), (3, 3), (3, 1), (1, 2)}
Ans: (c), For reflexive (a, a) ∈ R for a ∈ X
So it can be (c) or (d)
For symmetric (1, 3) ∈R, then (3, 1) should belong to R. Also (2, 3) should belong to R from
above observation.

4. Let Z be the set of integers and R be a relation defined in Z such that aRb if (a – b) is divisible by
5. Then number of equivalence classes are
(a) 2 (b) 3 (c) 4 (d) 5
Ans: (d) 5
as remainder can be 0, 1, 2, 3, 4.

5. Let R be a relation defined as R = {(x, x), (y, y), (z, z), (x, z)} in set A = {x, y, z} then relation R
is
(a) reflexive (b) symmetric (c) transitive (d) equivalence
Ans: (a) reflexive, as for all a ∈ A, (a, a)∈R.

6. If R = {(x, y) : x + 2y = 8} is a relation on N, then range of R is

(a) {3} (b) {1, 2, 3}
(c) {1, 2, 3, .... 8} (d) {1, 2}
Ans: (b), as R = {(x, y) : x + 2y = 8} is a relation on N.

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 1 -

 ∴ R = {(2, 3), (4, 2), (6, 1)},
∴ range = {1, 2, 3}.

7. Let A = {a, b, c}, then the total number of distinct relations in set A are
(a) 64 (b) 32 (c) 256 (d) 512
Ans: (d), as given A = {a, b, c}.
A relation is a subset of A × A.
n(A × A) = 9
we know total subsets of a set containing n elements is 2n.
Total relations = 29 = 512

8. Let X = {x2 : x ∈ N} and the function f : N → X is defined by f(x) = x2, x ∈ N. Then this
function is
(a) injective only (b) not bijective (c) surjective only (d) bijective
Ans: (d) Function is injective as for x1, x2  N,
f(x1) = f(x2)  x12 = x22  x1 = x2, as x1, x2 > 0.
Function is surjective as for y  x
There exists x  N such that y = f(x)
 y = x2  x = y  N.
Function is bijective

For Q9 and Q10, a statement of assertion (A) is followed by a statement of reason (R). Choose
the correct answer out of the following choices.
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true but R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.

9. Assertion (A): In set A = {1, 2, 3} a relation R defined as R = {(1, 1), (2, 2)} is reflexive.
Reason (R): A relation R is reflexive in set A if (a, a)  R for all a  A.
Ans: (d) A is false but R is true.

10. Assertion (A): In set A = {a, b, c} relation R in set A, given as R = {(a, c)} is transitive.
Reason (R): A singleton relation is transitive.
Ans: (a) Both A and R are true and R is the correct explanation of A.

SECTION – B
Questions 11 to 14 carry 2 marks each.
11. Show that the relation R in the set {1, 2, 3} given by R = {(1,1), (2, 2), (3, 3), (1, 2), (2, 3)} is
reflexive but neither symmetric nor transitive.
Ans: Given R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)} defined on R : {1, 2, 3} {1, 2, 3}
For reflexive: As (1, 1), (2,2), (3, 3) ∈ R. Hence, reflexive
For symmetric: (1, 2) ∈ R but (2, 1) ∉ R. Hence, not symmetric.
For transitive: (1, 2) ∈ R and (2, 3) ∈ R but (1, 3) ∉ R. Hence, not transitive.

12. Prove that the Greatest Integer Function f : R → R, given by f(x) = [x] is neither one-one nor
onto. Where [x] denotes the greatest integer less than or equal to x.
Ans: f : R → R given by f (x) = [x]
Injectivity: Let x1 = 2.5 and x2 = 2 be two elements of R.
f (x1) = f (2.5) = [ 2.5] = 2
f (x2) = f (2) = [2] = 2
∴ f (x1) = f (x2) for x1 ≠ x2

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 2 -

 ⇒ f (x) = [x] is not one-one i.e., not injective.
Surjectivity: Let y = 2.5 ∈ R be any element.
∴ f (x) = 2.5 ⇒ [x] = 2.5
Which is not possible as [x] is always an integer.
⇒ f (x) = [x] is not onto i.e., not surjective.

13. Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B.
Show that f is one-one.
Ans : Given f : {1, 2, 3} {4,5,6,7}
as f = {(1,4), (2,5), (3,6)}.
We have f(1) = 4, f(2) = 5, f(3) = 6.
We notice x1≠x2 ⇒ f(x1)≠f(x2).
Hence, one-one.

14. Let the function f : R R be defined by f (x) = cos x ∀ x ∈ R. Show that f is neither one-one nor
onto.
Ans: Given function f(x) = cosx, ∀ x ∈ R
   1
cos  cos    
3  3 2
So, f(x) is not one-one
Now, f(x) is also not onto as range is a subset of real numbers. (–1 ≤ cosx ≤1)
e.g. for y = 2 ∈ R (co-domain) there is no value of x ∈ R (domain) such that
y = f(x) i.e. cosx = 2 (∵ –1 ≤ cosx ≤ 1).

SECTION – C
Questions 15 to 17 carry 3 marks each.

15. Let T be the set of all triangles in a plane with R a relation in T given by R = {(T1, T2) : T1 ≅ T2}.
Show that R is an equivalence relation.
Ans: Given R = {(T1, T2) ∈ T × T : T1 ≅ T2}
For reflexive: (T1, T1) ∈ R is true as T1 ≅ T1 for all T1 ∈ T (i.e. triangle is congruent to itself).
Hence, R is reflexive.
For symmetric: (T1, T2) ∈ R ⇒T1 ≅T2 and T2 ≅T1 (T2, T1) ∈ R.
Hence, R is symmetric.
For transitive: Let(T1, T2) ∈ R and (T2, T3) ∈ R ⇒T1 ≅ T2 and T2 ≅ T3
⇒T1 ≅ T3 ⇒ (T1, T3) ∈ R.
Hence, R is transitive.
Since R is reflexive, symmetric and transitive, therefore R is an equivalence relation.

16. Show that the relation S in the set R of real numbers, defined as S = {(a, b) : a, b ∈ R and a ≤ b3}
is neither reflexive, nor symmetric, nor transitive.
Ans: Given S = {(a, b) ∈ R | a ≤ b3}
We can consider counter example.
For reflexive: Let (–2, –2) ∈ S –2 ≤(–2)3 –2 ≤ –8, false, Hence, not reflexive.
3
For symmetric: Let (–1, 2) ∈ S –1 ≤ (2) –1 ≤ 8 true,
If symmetric then (2, –1) ∈ S
2 ≤(–1)3 2 ≤ –1, false, Hence, not symmetric.
For transitive: Let (25, 3) ∈ S and (3, 2) ∈ S
25 ≤ (3)3 and 3 ≤ (2)3 25 ≤ 27 and 3 ≤ 8, true in both cases.
If transitive then (25, 2) ∈ S 25 ≤ (2)3 25 ≤ 8,false
Hence, not transitive.

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 3 -

 x
17. Show that the function f : R R defined by f(x) = 2
, ∀ x ∈ R is neither one-one nor onto.
x 1
Ans: For one-one: For x1, x2 ∈ R
x1 x
f (x1) = f (x2) 2
 22
x1  1 x2  1
x1x2 + x1 = x12x2 + x2
2
x1x2 (x2 – x1) + (x1 – x2) = 0
(x2 – x1) (x1x2 – 1) = 0 x2 – x1 = 0 or x1x2 = 1
x1 = x2 or x1x2 = 1
1 1
Let x1 = 2 and x2 = , then we notice f (x1) = f (x2) but 2 ≠ . Hence, not one-one
2 2
Here we notice f (x) ≠ 1 for any x ∈ R
Therefore, 1 ∈ R from co-domain does not have pre-image in domain. So, not onto.

SECTION – D
Questions 18 carry 5 marks.
18. Let N denote the set of all natural numbers and R be the relation on N × N defined by
(a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.
Ans: Relation R on N × N is given by
(a, b) R(c, d) ad(b + c) = bc(a + d).
For reflexive:
For (a, b) ∈ N × N
(a, b) R(a, b) ab(b + a) = ba(a + b),
true in N
Hence, reflexive
For symmetric:
For (a, b), (c, d) ∈ N × N
(a, b) R(c, d) ad(b + c) = bc(a + d)
cb(d + a) = da(c + b) ( × and + is commutative in N)
(c, d) R(a, b) (a, b), (c, d) ∈ N × N.
Hence, symmetric
For transitive:
For (a, b), (c, d), (e, f) ∈ N × N
Let (a, b) R(c, d) and (c, d) R(e, f)
ad(b + c) = bc(a + d)
1 1 1 1
  
c b d a
and cf(d + e) = de(c + f)
1 1 1 1
  
e d f c
1 1 1 1 1 1 1 1
       
c b e d d a f c
1 1 1 1
   
b e a f
af(e + b) = be(f + a)
af(b + e) = be(a + f)
(a, b) R(e, f)
As (a, b) R(c, d), (c, d) R(e, f)
(a, b) R(e, f) Hence, transitive.
As relation R is reflexive, symmetric and transitive. Hence, R is an equivalence relation.

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 4 -

 SECTION – E (Case Study Based Questions)
Questions 19 to 20 carry 4 marks each.
19. Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s
sister Raji observed and noted that possible outcomes of the throw every time belongs to set {1,
2, 3, 4, 5, 6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1, 2, 3, 4, 5, 6}

(i) Let R : B  B be defined by R = {(x, y) : y is divisible by x}. Show that relation R is reflexive
and transitive but not symmetric.
(ii) Let R be a relation on B defined by R = {(1, 2), (2, 2), (1, 3), (3, 4), (3, 1), (4, 3), (5, 5)}.
Then check whether R is an equivalence relation.
(iii) Raji wants to know the number of functions from A to B. How many number of functions
are possible?
OR
(iii) Raji wants to know the number of relations possible from A to B. How many numbers of
relations are possible?

Ans: (i) Since every number is divisible by itself, So

(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)  R.
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 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.
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
20. 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

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 5 -

 Let I be the set of all citizens of India who were eligible to exercise their voting right in general
election held in 2019. A relation ‘R’ is defined on I as follows:
R = {(V1,V2) : V1, V2 ∈ I and both use their voting right in general election – 2019}
(i) Two neighbours X and Y  I. X exercised his voting right while Y did not cast her vote in
general election-2019. Check whether X is related to Y or not.
(ii) Mr. ‘X’ and his wife ‘W’ both exercised their voting right in general election-2019. Show
that (X, W)  R and (W, X)  R.
(iii) Three friends F1, F2 and F3 exercised their voting right in general election-2019. Show that
(F1, F2)  R, (F2, F3)  R and (F1, F3)  R.
OR
Show that the relation R defined on set I is an equivalence relation.

Ans: 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.
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 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,
(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.

Prepared by: M. S. KumarSwamy, TGT(Maths) Page - 6 -