PERSONAL PAPER

mathgiri.com
PANDEYPUR

QUESTION BANK (RELATIONS AND FUNCTIONS)

Class 12 - Mathematics

1. Let A = {1, 2, 3} and let R = {(1,1), (2, 2), (3, 3), (1, 3), (3, 2), (1, 2)}. Then, R is [1]

a) symmetric and transitive but not reflexive b) reflexive and transitive but not symmetric

c) reflexive and symmetric but not transitive d) an equivalence relation

2. Which of the following functions from Z into Z are bijections? [1]

a) f (x) = x3 b) f (x) = 2x + 1

c) f (x) = x + 2 d) f (x) = x2 + 1

3. If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is [1]

a) none of these b) symmetric only

c) symmetric and transitive only d) reflexive and transitive only

[1]
(x−2)
4. let A = R - (3) and B = R - 1 Then, f : A → B : f(x) =
(x−3)
is

a) many-one and onto b) many-one and into

c) one-one and onto d) one-one and into

5. Which of the following is not an equivalence relation on Z? [1]

a) a R b ⇔ a - b is an even integer b) a R b ⇔ a + b is an even integer

c) a R b ⇔ a < b d) a R b ⇔ a = b
–
6. For real numbers x and y, define xRy if and only if x – y + √2 is an irrational number. Then the relation R is [1]

a) none of these b) reflexive

c) transitive d) symmetric
1
(n + 1), when n is odd [1]
7. Let f : N → N : f(n) = {
2

n
, when n is even.
2

then, f is

a) many-one and onto b) one-one and into

c) many-one and into d) one-one and onto

8. S is a relation over the set R of all real numbers and its is given by (a, b) ∈ S ⇔ ab ≥ 0. Then, S is [1]

a) an equivalence relation b) reflexive and symmetric only

c) symmetric and transitive only d) antisymmetric relation

9. Let A = {1, 2, 3} and let R = {(1,1), (2, 2), (3, 3), (1, 2), (2,1), (2, 3), (3, 2)}. Then, R is [1]

a) reflexive and transitive but not symmetric b) an equivalence relation

1/7
MCQ
 c) symmetric and transitive but not reflexive d) reflexive and symmetric but not transitive
x
, if x is even [1]
10. Let f : Z → Z be given by f(x) = {
2
. Then f is
0, if x is odd

a) onto but not one-one b) neither one-one nor onto

c) one-one but not onto d) one-one and onto

11. Let A = {1, 2, 3,… n} and B = {a, b}. Then the number of surjections from A to B is [1]

a) n
P2 b) none of these

c) 2n - 2 d) 2n - 1

12. Let f : R → R be defined as f (x) = 3x. Choose the correct answer. [1]

a) many – one onto b) neither one – one nor onto

c) one – one but not onto d) one – one onto

13. The function f : A → B defined by f(x) = -x2 + 6x - 8 is a bijection, if [1]

a) A = (−∞, 3] and B = (−∞, 1] b) A = [−3, ∞) and B = (−∞, 1]

c) A = (−∞, 3] and B = [1, ∞) d) A = [3, ∞) and B = |1, ∞)

14. The relation S defined on the set R of all real number by the rule a S b if a ≥ b is [1]

a) neither transitive nor reflexive but b) symmetric, transitive but not reflexive
symmetric

c) an equivalence relation d) reflexive, transitive but not symmetric

15. Let S be the set of all straight lines in a plane. Let R be a relation on S defined by LRM ⇔ L ⊥ M Then R is [1]

a) transitive but neither reflexive nor b) an equivalence relation

symmetric

c) reflexive but neither symmetric nor d) symmetric but neither reflexive nor
transitive transitive
16. Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but [1]
not transitive is

a) 4 b) 2

c) 1 d) 3
17. A relation R on the set N of natural numbers is defined as R = {(a, b): a + b is even, ∀ a, b ∈ N}, then R is [1]

a) a reflexive relation but not symmetric b) an equivalence relation

c) symmetric but not transitive d) not an equivalence relation

18. If the set A contains 5 elements and the set B contains 6 elements, then the number of one – one and onto [1]
mappings from A to B is

a) none of these b) 720

c) 120 d) 0
19. Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is [1]

a) Transitive and symmetric b) Reflexive and symmetric

2/7
MCQ
 c) Reflexive, transitive but not symmetric d) Equivalence
20. The relation R in N × N such that (a, b) R (c, d) ⇔ a + d = b + c is [1]

a) reflexive and transitive but not symmetric b) an equivalence relation

c) reflexive but symmetric d) none of these

21. Give an example of a function which is one-one but not onto. [1]
22. Give an example of a function which is neither one-one nor onto. [1]
23. Determine whether the below relation is reflexive, symmetric and transitive: [1]
Relation R in the set A of human beings in a town at a particular time given by
R = {(x, y) : x and y work at the same place}
24. State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} not to be transitive. [1]
25. Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of a mapping from A to B which is not injective. [1]
26. Let A = {0, 1, 2, 3} and define a relation R on A as follows: [1]
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R reflexive? symmetric? transitive?
27. Find whether function f defined as below is one-one or not: [1]
f : R → R given by f(x) = x3 + 2 for all x ∈ R.
28. Give an example of a function which is one-one and onto. [1]
29. Determine whether the relation is reflexive, symmetric and transitive: [1]
Relation R in the set A of human beings in a town at a particular time given by
R = {(x, y) : x is wife of y}
30. Let R be the equivalence relation in the set Z of integers given by R = {(a, b) : 2 divides a– b}. Write the [1]
equivalence class[0].
31. Let A be the set of all students of a boys school. Show that the relation R in A given by R = {(a, b) : a is a sister [1]
of b} is the empty relation and R′ = {(a, b) : the difference between heights of a and b is less than 3 meters} is
the universal relation.
32. If 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- [1]
one.
33. Show that the function f : R → R: f(x) = x3 is one-one and onto [1]

34. Let the function f : R → R be defined by f(x) = 4x - 1, ∀ x ∈ R. Then, show that f is one-one. [1]
35. Show that the Signum function f :R →R, given by [1]
⎧ 1, if x > 0
⎪

f(x) = ⎨ 0, if x = 0
⎩
⎪
−1, if x < 0

is neither one-one nor onto.

36. Show that the function f : R → R: f(x) = 1 + x2 is many-one into. [1]

37. Let A be the set of all 50 students of Class X in a school. Let f : A → N be function defined by f(x) = roll [1]
number of the student x. Show that f is one-one but not onto.
38. Write the smallest reflexive relation of set A = {1, 2, 3, 4} [1]
39. Let S = {a, b, c} and T = {1, 2, 3}. Find F–1 of the function F from S to T, if it exists. [1]

F = {(a, 3), (b, 2), (c, 1)}

40. If A = {a, b, c, d} and f = {a, b), (b, d), (c, a), (d, c)}, show that f is one-one from A onto A. Find f-1 [1]

3/7
MCQ
41. State whether the function is one-one, onto or bijective. Justify your answer. f: R → R defined by f(x) = 1+ x2 [2]

42. Show that the number of equivalence relations on the set {1, 2, 3} containing (1, 2) and (2, 1) is two. [2]
43. Let A = {1, 2, 3}. Then show that the number of relations containing (1, 2) and (2, 3) which are reflexive and [2]
transitive but not symmetric is three.
44. Prove that the function f : R → R : f(x) = 2x is one-one and onto. [2]
⎧
⎪
1, x > 0 [2]
45. Let f : R → R be the Signum Function defined as ⎨ 0, x = 0 and g : R → R be the Greatest Function given
⎩
⎪
−1, x < 0

by g(x) = [x], where [x] is greatest integer less than or equal to x. Then, does fog and gof coincide in (0, 1)?
46. Show that the function f : N → N : f(x) = x3 is one-one into. [2]

47. Let C be the set of complex numbers. Prove that the mapping f : C → R given by f(z) = |z|, ∀z ∈ C, is neither [2]
one-one nor onto.

48. Show that the function f : N → N : f(x) = x2 is one one into [2]

49. Show that the function f : N → N : f(x) = x

2
is one-one and into. [2]
50. Show that the relation is congruent to on the set of all triangles in a plane is an equivalence relation. [2]
51. Let Z be the set of all integers and let R be a relation on Z defined by R = (a, b) : (a - b) is even) Show that R is [2]
an equivalence relation in Z.

52. Classify the function f : N → N given by f (x) = x3 as injection, surjection or bijection. [2]

53. Let A = R – {3} and B = R- {1}. Consider the function of f: A → B defined by f(x) . .Is f one – one and [2]
x−2
=
x−3

onto.
54. Check the injectivity and surjectivity of the below function: [2]
f : R → R given by f(x) = x2
55. Show that the function f : R → R : f(x) = x
4
is neither one-one nor onto. [2]
56. State whether the function is one – one, onto or bijective f: R to R defined by f(x) = 3 – 4x [3]
57. Let R = (a,b) : a, b ∈ Z and (a - b) is divisible by 5 show that R is an equivalence relation on Z. [3]
58. Let R = {(a, b): a, b ∈ N, a > b}. [3]
Show that R is a binary relation which is neither reflexive, nor symmetric. Show that R is transitive.
59. If N denotes 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) [3]
= bc(a + d). Show that R is an equivalence relation.
60. Let L be the set of all lines in plane and R be the relation in L define if R = {(l1, L2 ): L1 is⊥ to L2 } .Show that [3]

R is symmetric but neither reflexive nor transitive.

61. On the set Z of all integers, consider the relation R = {{a, b) : (a - b) is divisible by 3}. Show that R is an [3]
equivalence relation on Z Also find the partitioning of Z into mutually disjoint equivalence classes.
62. In the set of natural numbers N, define a relation R as follows: [3]
∀ n, m ∈ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the
numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets
determined by R.
63. Let X be a nonempty set and let S be the collection of all subsets of X. Let R be a relation in S, defined by [3]
R = {(A, B) : A ⊂ B} Show that R is transitive but neither reflexive nor symmetric
64. If R is a relation defined on the set of natural numbers N as follows: R={(x,y) : x ∈ N, y ∈ N and 2x+ y = 24}, [3]
then find the domain and range of the relation R. Also, find whether R is an equivalence relation or not.
65. Show that the relation R defined in the set A of all triangles as R = {(T1, T2) : T1 is similar to T2}, is [3]

4/7
MCQ
 equivalence relation. Consider three right angle triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3

with sides 6, 8, 10. Which triangles among T1, T2 and T3 are related?

66. Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a – b| is divisible by 2} is an [5]
equivalence relation. Write all the equivalence classes of R.
67. Let f : W → W be defined as f(n) = n - 1, if n is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find [5]
the inverse of f. Here, W is the set of all whole numbers.
68. Let R be relation defined on the set of natural number N as follows: [5]
R = {(x, y): x ∈ N, y ∈ N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is
reflexive, symmetric and transitive.
69. Let A = R – {3} and B = R – {1}. Consider the function f: A → B defined by f(x) = (
x−2
) . Is f one-one and [5]
x−3

onto? Justify your answer.

70. Give an example of a map [5]
i. which is one-one but not onto
ii. which is not one-one but onto
iii. which is neither one-one nor onto.
71. Read the case study carefully and answer the questions that follow: [5]
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the
playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the
saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation
on L.

Based on the information given above, answer the following questions:

i. Let relation R be defined by R = {(L1, L2) : L1||L2 where L1, L2 ∈ L} then R is ________ relation.

a. Equivalence
b. Only reflexive
c. Not reflexive
d. Symmetric but not transitive
ii. Let R = {(L1, L2) ∶ L1⊥ L2 where L1, L2 ∈ L} which of the following is true?

a. R is Symmetric but neither reflexive nor transitive

b. R is Reflexive and transitive but not symmetric
c. R is Reflexive but neither symmetric nor transitive
d. R is an Equivalence relation
iii. The function f : R → R defined by f(x) = x − 4 is ________
a. Bijective
b. Surjective but not injective
c. Injective but not Surjective
d. Neither Surjective nor Injective

5/7
MCQ
 iv. Let f : R → R be defined by f(x) = x − 4. Then the range of f(x) is ________.
a. R
b. Z
c. W
d. Q
v. Let R = {(L1, L2) : L1 is parallel to L2 and L1 : y = x – 4} then which of the following can be taken as L2?

a. 2x - 2y + 5 = 0
b. 2x + y = 5
c. 2x + 2y + 7 = 0
d. x + y = 7
72. Read the case study carefully and answer the questions that follow: [5]
Raji visited the Exhibition along with her family. The Exhibition had a huge swing, which attracted many

children. Raji found that the swing traced the path of a Parabola as given by y = x2.

Based on the information given above, answer the following questions:

i. Let f : R → R be defined by f(x) = x2 is ________.

a. Neither Surjective nor Injective
b. Surjective
c. Injective
d. Bijective

ii. Let f : N → N be defined by f(x) = x2 is ________.

a. Surjective but not Injective
b. Surjective
c. Injective
d. Bijective

iii. Let f : {1, 2, 3, ... } → {1, 4, 9, ...} be defined by f(x) = x2 is ________.

a. Bijective
b. Surjective but not Injective
c. Injective but Surjective
d. Neither Surjective nor Injective

iv. Let : N → R be defined by f(x) = x2. Range of the function among the following is ________.
a. {1, 4, 9, 16, …}
b. {1, 4, 8, 9, 10, …}
c. {1, 4, 9, 15, 16, …}
d. {1, 4, 8, 16, …}

v. The function f : Z → Z defined by f(x) = x2 is ________.

a. Neither Injective nor Surjective

6/7
MCQ
 b. Injective
c. Surjective
d. Bijective
x−1
73. Consider the mapping f : A → B is defined by f(x) = x−2
such that f is a bijection. [5]
Based on the above information, answer the following questions,
i. Domain of f is
a. R - {2}
b. R
c. R - {1, 2}
d. R - {0}
ii. Range of f is
a. R
b. R - {1}
c. R - {0}
d. R - {1, 2}
iii. If g : R - {2} → R - {1} is defined by g(x) = 2f{x} - 1, then g(x) in terms of x is
x+2
a. x

x+1
b. x−2
x−2
c. x

d.
x

x−2

iv. The function g defined above, is

a. One-one
b. Many-one
c. into
d. None of these
v. A function f(x) is said to be one-one iff
a. f(x1) = f(x2) ⇒ x1 = x2
b. f(-x1) = f(-x2) ⇒ -x1 - x2
c. f{x1) = f{x2) ⇒ x1 = x2

d. None of these
74. Assertion (A): Every function is invertible. [1]
Reason (R): Only bijective functions are invertible.

a) Both A and R are true and R is the correct b) Both A and R are true but R is not the
explanation of A. correct explanation of A.

c) A is true but R is false. d) A is false but R is true.

75. Let A = {1, 2, 3, 4} and B = {a, b} be two sets. Write total number of onto functions from A to B. [2]

7/7
MCQ