1

Practice Sheet

Relations and Functions

CLASS 12 - MATHEMATICS

Time Allowed: 5 minutes Maximum Marks : 195

Section A a) 0 b) 720
c) None of these d) 120
1) If A and B have 4 elements each then the number of
one - one onto (bijective) function from A to B is [1] 10) A relation R in set A = {1, 2, 3} is defined as R = {(1,
a) 42 b) 0 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered
c) 43 d) 24 pair in R shall be removed to make it an equivalence
relation in A? [1]
2) Let A = {2, 3, 4, 5, …, 17, 18}. Let≃ be the equiv- a) (1, 1) b) (3, 3)
alence relation on A × A, cartesian product of A with c) (1, 2) d) (2, 2)
itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the
number of ordered pairs of the equivalence class of (3, 11) R is a relation on the set Z of integers and it is given
2) is [1] by (x, y)∈ R ⇔ |x – y| ≤ 1. Then, R is [1]
a) 7 b) 4 a) An equivalence relation
c) 6 d) 5 b) Symmetric and transitive
3) If a relation R on the set {1, 2, 3, 4} is defined by R c) Reflexive and symmetric
= {(1, 2), (3, 4)}. Then R is [1] d) Reflective and transitive
√
a) Asymmetric b) Transitive 12) F : R→ R given by f (x) = x + x2 is [1]

i
c) Symmetric d) Reflexive th a) None of these b) Bijective
4) Equivalence classes Ai satisfy c) Injective d) Surjective
i. No element of Ai is related to any element of 13) For the set A = {1, 2, 3}, define a relation R in the set
Aj , i ̸= j A as follows R = {(1, 1), (2, 2), (3, 3), (1, 3)}. Then,
as
ii. No element of Ai is related to any element of Ai the ordered pair to be added to R to make it the smallest
iii. Some elements of Ai are related to any element of equivalence relation is [1]
Aj,, i ̸= j a) (3, 1) b) (2, 1)
iv. All elements of Ai are related to any element of
w

c) (1, 2) d) (1, 3)
Aj , i ̸= j i are related to any element of Aj, i ̸= j
[1] 14) The function f : A→ B defined by f(x) = - x2 + 6x -
a) B b) C 8 is a bijection, if [1]
A

c) A d) D a) A = (−∞, 3] and B = (−∞, 1]

5) Let A = {1, 2, 3} and consider the relation R = {1, 1), b) A = [−3, ∞) and B = (−∞, 1]
(2, 2), (3, 3), (1, 2), (2, 3), (1,3)}. Then R is [1] c) A = (−∞, 3] and B = [1, ∞)
d) A = [3, ∞) and B = |1, ∞)
a) Neither symmetric, nor transitive
it

b) Symmetric and transitive 15) Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on
c) Reflexive but not symmetric set A = {a, b, c}. Then, R is [1]
a) Transitive b) Anti – symmetric
rp

d) Reflexive but not transitive

c) Symmetric d) Reflexive
6) Let A = {1, 2, 3} and B = {4, 5, 6, 7} and let f =
{(1, 4), (2, 5), (3, 6)} be a function from A to B. Then, 16) Let A = {a, b, c} and the relation R be defined on A as
A

f is [1] R = {(a, a), (b, c), (a, b)}. Then, find minimum number
a) Many - one b) Bijective of ordered pairs to be added in R to make R reflexive
c) One - one d) Onto and transitive. [1]
a) 3 b) 1
7) Let R be a relation on the set N of all natural numbers, c) 2 d) 4
defined by a R b⇔ a is factor of b Then, R is [1]
17) Let f : R→ R be a function defined by f (x) = x2 −8
.
a) An equivalence relation Then, f is [1]
x2 +2

b) Reflexive and symmetric but not transitive

c) Reflexive and transitive but not symmetric a) One - one and onto
d) Symmetric and transitive but not reflexive b) One - one but not onto
c) Onto but not one - one
8) Let A = {1, 2, 3}. Then the number of relations contain-
d) Neither one - one nor onto
ing (1, 2) and (1, 3), which are reflexive and symmetric
but not transitive is [1] 18) If A = {1, 2, 3}, then a relation R = {(2, 3)} on A is
a) 2 b) 3 [1]
c) 1 d) 4
a) Asymmetric only
9) If set A contains 5 elements and the set B contains 6 el- b) Symmetric only
ements, then the number of one - one and onto mappings c) Symmetric and transitive only
from A to B is [1] d) Transitive only
 2

19) Set A has 3 elements, and set B has 4 elements. Then Reason (R): Let A = {1, 5, 8, 9}, B = {4, 6} and f
the number of injective mappings that can be defined = {(1, 4), (5, 6), (8, 4), (9, 6)}, then f is a surjective
from A to B is [1] function. [1]
a) 24 b) 64
c) 144 d) 12 a) Both A and R are true and R is the correct expla-
nation of A.
20) A relation R on the set N of natural numbers is defined b) Both A and R are true but R is not the correct
as R = {(a, b): a + b is even,∀ a, b ∈ N}, then R explanation of A.
is [1] c) A is true but R is false.
a) A reflexive relation but not symmetric d) A is false but R is true.
b) An equivalence relation
c) Symmetric but not transitive Section C
d) Not an equivalence relation
26) State whether the function is one – one, onto or bijective
Section B f: R→ R defined by f(x) = 1+ x2 [2]
27) Show that the functionf : Z → Z : f (x) = x3 is one -
21) Assertion (A): A function f: Z → Z defined as f(x) = one and into. [2]
x3 is injective. 28) Let S be the set of all real numbers. Show that the
Reason (R): A function f: A → B is said to be injective relation R = {(a, b): a2 + b2 = 1} is symmetric but
if every element of B has a pre - Image in A. [1] neither reflexive nor transitive. [2]
29) Define a relation on N as, xy is square of an integer for
a) Both A and R are true and R is the correct expla-
x, y∈ N
nation of A.
Determine is this relation is reflexive, symmetric and
b) Both A and R are true but R is not the correct
transitive. [2]
explanation of A.
30) Show that the relation R inR defined as R = {(a, b) : a
c) A is true but R is false.
≤ b}, is reflexive and transitive but not symmetric. [2]

i
d) A is false but R is true.
th 31) Let A and B be two sets each with finite number of
22) Assertion (A): The relation R in the set A = {1, 2, 3, elements. Assume that there is an injective map from A
4, 5, 6} defined as R = {(x, y) : y is divisible by x} to B and that there is an injective map from B to A.
is not an equivalence relation. Prove that there is a bijection from A to B. [2]
as
Reason (R): The relation R will be an equivalence relation, 32) Prove that the function f :N → N : f (x) = 3x is one -
if it is reflexive, symmetric and transitive. [1] one and into. [2]
33) Show that the function f: R→ R, defined as f(x) = x2 ,
a) Both A and R are true and R is the correct expla-
is neither one - one nor onto. [2]
w

nation of A.
34) Let A be a finite set. If f:A→ A is an onto function,
b) Both A and R are true but R is not the correct
show that f is one - one also. [2]
explanation of A.
35) Let f : N→ N be defined by
A

c) A is true but R is false.

n + 1, if n is odd
d) A is false but R is true. f (n) = Show that f is a bijec-
n − 1, if n is even
23) Assertion (A): The relation R in the set A = (1, 2, 3, tion. [2]
4) defined as R = {(x, y): y is divisible by x) is an 36) Let A = {a, b, c} and the relation R be defined on A
equivalence relation. as follows:
it

Reason (R): A relation R on the set A is equivalence if R = {(a, a), (b, c), (a, b)}.
it is reflexive, symmetric and transitive. [1] Then, write minimum number of ordered pairs to be added
rp

in R to make R reflexive and transitive. [2]

a) Both A and R are true and R is the correct expla- 37) Determine whether the relation R defined on the setR
nation of A. of all real√ numbers as R = {(a, b) : a, b ∈ R
b) Both A and R are true but R is not the correct and a−b+ 3 ∈ S , where S is the set of all irrational
A

explanation of A. numbers}, is reflexive, symmetric and transitive. [2]

c) A is true but R is false. 38) Find the domain and range of the real function, defined
d) A is false but R is true.
by f(x)= (1+xx2
2) . Show that f is many one. [2]
24) Assertion (A): A relation R = {(a, b): |a - bl <3} 39) If A = {1, 2, 3, 4 }, define relation on A which have
defined on the set A = {1, 2, 3, 4} is reflexive. properties of being: reflexive, transitive but not symmetric
Reason (R): A relation R on the set A is said to be [2]
reflexive if for (a, b) ∈ R and (b, c) ∈ R, we have 40) Check whether the function f3 = {(a, x), (b, x), (c, z), (d,
(a, c) ∈ R. [1] z)} ; A = {a, b, c, d}, B = {x, y, z]from A to B is
one - one and onto? [2]
a) Both A and R are true and R is the correct expla-
41) Check which of the following functions is onto or into.
nation of A.
i. F : A→ B, given by f(x) = 3x, where A = {0,1,
b) Both A and R are true but R is not the correct
2} and B = {0, 3, 6}.
explanation of A.
ii. F : Z→ Z, given by f(x) = 3x + 2, where Z = set
c) A is true but R is false.
of integers.
d) A is false but R is true.
[3]
25) Assertion (A): Let A = {1, 5, 8, 9}, B = {4, 6} and 42) A relation R is defined on N× N (where N is the set of
f = {(1, 4), (5, 6), (8, 4), (9, 6)}, then f is a bijective natural numbers) as: (a, b)R(c, d) ⇔ a − c = b − d Show
function. that R is an equivalence relation. [3]
 3

43) LetN be the set of all natural numbers and R be a relation [5]
on N × N defined by (a, b) R (c, d) � ad = bc for all 62) Given a function defined by y = f(x) = √4- x2 , 0≤x≤2,
0≤y≤2. Show that f is bijective function . [5]
(a, b), (c, d) � N × N. Show that R is an equivalence
63) Given, A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an
relation on N × N. Also, find the equivalence class of
example of each of the following:
(2, 6), i.e., [(2, 6)]. [3]
i. An injective mapping from A to B
44) If N denotes the set of all natural numbers and R be the
ii. A mapping from A to B which is not injective
relation on N× N defined by (a, b) R (c, d), if ad(b +
iii. A mapping from B to A.
c) = bc(a + d). Show that R is an equivalence relation.
[5]
[3]
64) A function f : [- 4, 4]→ [0, 4]is given by
45) Show that a functionf : R → R defined as f (x) =
f(x) = √(16 - x²). Show that f is an onto function
x2 + x + 1 is neither one - one nor onto. Also, find all
but not a one - one function. Further, find all possible
the values of x for which f (x) = 3 . [3]
values of a for which f(a) = √7. [5]
46) Prove that a function f: [0,∞ ) → [- 5, ∞ ) defined as
65) Let f : W→ W be defined as f(n) = n - 1, if n is odd
f(x) = 4x2 + 4x - 5 is both one - one and onto. [3]
and f(n) = n + 1, if n is even. Show that f is invertible.
47) Given a non - empty set X, define the relation R in
Find the inverse of f. Here, W is the set of all whole
P(X) as follows:
numbers. [5]
For A, B ∈ P(X), (A, B) ∈ R iff A ⊂ B. Prove that R
66) Let L be the set of all lines in xy plane and R be the
is reflexive, transitive and not symmetric. [3]
relation in L define as R = {(L1 , L2 ) : L1 || L2 }. Show
48) Check whether the relation R defined in the set {1, 2, 3,
that R is an equivalence relation. Find the set of all lines
4, 5, 6} as R = {(a, b): b = a+1} is reflexive, symmetric
related to the line y = 2x + 4. [5]
or transitive. [3]
67) Let n be a positive integer. Prove that the relation R
49) If Z is the set of all integers and R is the relation on Z
on the set Z of all integers numbers defined by (x, y)∈
defined as R = {(a, b): a,∈ Z and a - b is divisible
R ⇔ x - y is divisible by n, is an equivalence
by 5}. Prove that R is an equivalence relation. [3]
  relation on Z. [5]
50) Check whether a function f:R → − 21 , 12 defined as f(x)
68) Let A be the set of all human beings in a town at a

i
x
= 1+x 2 is one - one and onto or not. [3] th particular time. Determine whether each of the following
51) Show that a function f : R→ R defined by f(x) = 1+x 2x
2 relations are reflexive, symmetric and transitive:
is neither one - one nor onto. Further, find set A so i. R = {(x, y): x and y work at the same place}
that the given function f : R → A becomes an onto ii. R = {(x, y): x and y live in the same locality}
as
function. [3] [5]
52) A relation R is defined on N× N (where N is the set 69) Give an example of a map
of natural numbers) as (a, b) R (c, d) ⇔ ca = bd . Show i. Which is one - one but not onto
that R is an equivalence relation. [3] ii. Which is not one - one but onto
w

53) Let m be a given fixed positive integer. Let R = {(a, iii. Which is neither one - one nor onto.
b): a, b∈ Z and (a - b) is divisible by m}. Show that [5]
R is an equivalence relation on Z. [3] 70) Let A and B be two sets. Show that f: A× B → B ×
A

54) Let the function f : R→ R be defined by f(x) = cosx, ∀ A such that f(a, b) = (b, a) is a bijective function. [5]
x ∈ R. Show that f is neither one - one nor onto. [3]
55) If A = {1, 2, 3, ... , 9} and R is the relation in A× Section D
A defined by (a, b) R (c, d), if a + d = b + c for (a,
b), (c, d) in A × A. Prove that R is an equivalence 71) Read the following text carefully and answer the questions
it

relation. Also, obtain the equivalence class [(2, 5)]. [3] that follow:
56) Let A = R - {3}, B = R - {1}. Iff : A → B be Consider the mapping f : A → B is defined by f(x) =
rp

defined by f (x) = x−2 x−3 ∀x ∈ A . Then, show that f is x−2 such that f is a bijection.
x−1

bijective. [5] i. What is the domain of the function f(x)? (1)

57) Show that the function f : R→ R defined by f (x) = ii. What is the range of the function f(x)? (1)
x2 +1 , ∀x ∈ R , is neither one - one nor onto. [5] iii. If g(x) : R - {2}→ R - {1}, How can the
A

58) Prove that function f : [0, ∞) → [- 5, ∞) defined as f(x) function g(x) in terms of x be expressed if it is
= 4x² + 4x - 5 is both one - one and onto. [CBSE defined as g(x) = 2f(x) - 1? (2)
2023][5] OR
59) Let R be relation defined on the set of natural number Under what condition is a function f(x) considered
N as follows: to be one-one? (2)
R = {(x, y): x ∈ N, y ∈ N, 2x + y = 41}. Find the [4]
domain and range of the relation R. Also verify whether 72) Read the following text carefully and answer the questions
R is reflexive, symmetric and transitive. [5] that follow:
60) Let f : R - {4/3} →R be a function defined as f(x) = Sohan is confused in the Mathematics topic ’Relation and
(4x)/(3x +4) . Show that f is one - one and onto. equivalence relation’. To clear his concepts on the topic,
[5] he took help his elder brother. He has following notes
61) Let A = {1, 2, 3} and R = {(a, b ):a, b∈ on this topic.
A and a2 − b2 ≤5 . Write R as set of ordered Relation: A relation R from a set A to a set B is
pairs. Mention whether R is a subset of the cartesian product A × B obtained by
i. Reflexive describing a relationship between first element x and the
ii. Symmetric second element ’y’ of the ordered pairs in A × B. A
iii. Transitive relation R in a set A is called. :
Give reason in each case. Reflexive:If (a, a) ∈ R ∀a ∈ A .
 4

Symmetric: If (a1 , a1 ) ∈ R ⇒ (a2 , a1 ) ∈ R ∀ a1 , a2 ∈ Pummy observed and noted the possible outcomes of the
R. throw every time belongs to set {1, 2, 3, 4, 5, 6}. Let
Transitive: If (a1 , a1 ) ∈ R and (a2 , a3 ) ∈ R ⇒ (a2 , a3 ) A be the set of players while B be the set of all possible
∈ R ∀ a1 , a2 , a3 ∈ A outcomes.
Equivalence Relation: A relation R in a set A is an
equivalence relation if R is reflexive, symmetric and tran-
sitive.
i. Find the maximum number of equivalence relations
on the set A = {1, 2, 3}. (1)
ii. Consider the non - empty set consisting of children
in a family and a relation R defined as aRb if a A = {S, D}, B = {1, 2, 3, 4, 5, 6}
is brother of b. Then show that R is transitive but i. Pummy wants to know the number of functions from
not symmetric. (1) A to B. How many number of functions are possible?
iii. Show that relation defined by R1 = {(x, y) |x2 = y2 } (1)
x, y ∈ R is an equivalence relation. (2) ii. Pummy wants to know the number of relations pos-
OR sible from A to B. How many number of relations
Check whether the relation (R) x is greater than y are possible? (1)
for all x, y ∈ N is reflexive, symmetric or transitive. iii. Let R be a relation on B defined by R = {(1, 2),
(2) (2, 2),(1, 3), (3, 4), (3, 1), (4, 3), (5, 5),}. Is R an
[4]
equivalence relation? (2)
73) Read the following text carefully and answer the questions OR
that follow: Show that a relation, R : B → B be defined by R
Sherlin and Danju are playing Ludo at home during Covid = {(x, y) : y is divisible by x} is a reflexive and
- 19. While rolling the dice, Sherlin’s sister Raji observed transitive but not symmetric. (2)
[4]
and noted the possible outcomes of the throw every time
belongs to set {1, 2, 3, 4, 5, 6}. Let A be the set of 75) Read the following text carefully and answer the questions

i
players while B be the set of all possible outcomes.th that follow:
A relation R on a set A is said to be an equivalence
relation on A iff it is
• Reflexive i.e., (a, a)∈ R ∀ a ∈ A.
as
• Symmetric i.e., (a, b)∈ R ⇒ (b, a) ∈ R ∀ a, b ∈
A = {S, D}, B = {1, 2, 3, 4, 5, 6} A.
i. Let R � B→ B be defined by R = {(x, y): y is • Transitive i.e., (a, b)∈ R and (b, c) ∈ R ⇒ {a, c)
divisible by x}. Determine whether R is Reflexive, ∈ R ∀ a,b, c ∈ A.
w

symmetric or transitive. (1) i. If the relation R = {(1, 1), (1, 2), (1, 3), (2, 2), (2,
ii. Raji wants to know the number of functions from A 3), (3, 1), (3, 2), (3, 3)} defined on the set A -
to B. How many number of functions are possible? {1, 2, 3}, then define if R is reflexive, symmetric
A

(1) or transitive. (1)

iii. Let R be a relation on B defined by R = {(1, 2), ii. If the relation R = {(1, 2), (2, 1), (1, 3), (3, 1)}
(2, 2), (1, 3), (3, 4), (3, 1), (4, 3), (5, 5)}. Then defined on the set A = {1, 2, 3}, then check whether
describe R . (2) R is reflexive,symmetric or transitive (1)
OR iii. If the relation R on the set N of all natural numbers
it

Raji wants to know the number of relations possible defined as R - {(x, y) : y = x + 5 and x <
from A to B. How many numbers of relations are 4}, then check whether R is reflexive, symmetric or
rp

possible? (2) transitive. (2)

[4] OR
74) Read the following text carefully and answer the questions If the relation R on the set A = 1, 2, 3, .... 13,
that follow: 14 defined as R = (x, y) : 3x - y = 0, then define
A

Priyanka and Renu are playing Ludo at home during R. (2)

Covid - 19. While rolling the dice, Priyanka’s sister [4]