17 Chapter

RELATIONS AND
FUNCTIONS-2

Trend
Analysis of JEE Main and BITSAT (Year 2010-2018)

2
Number of Questions

JEE MAIN

1 BITSAT

0
2010 2011 2012 2013 2014 2015 2016 2017 2018

Year

Chapter Utility Score (CUS)

Exam Weightage Critical Concepts Rating of CUS

Difficulty Level (chapter utility score)
Out of 10
JEE Main 3 Types of Relation, Kinds of Mapping
BITSAT 4 of Functions, Composition of 3/5 6
Functions, Invertible Functions,
Inverse of a Function.
.
 EBD_7372
206 MATHEMATICS
RELATIONS AND FUNCTIONS-2 207
 EBD_7372
208 MATHEMATICS

12. If R is a relation in a set A such that (a, a) Î R for every

Topic 1 : Types of Relations.
a Î A, then the relation R is called
(a) symmetric (b) reflexive
1. Let P = {(x, y) | x2 + y2 = 1, x, y Î R}. Then, P is
(c) transitive (d) symmetric or transitive
(a) Reflexive (b) Symmetric
13. A relation R in a set A is called empty relation, if
(c) Transitive (d) Anti-symmetric
(a) no element of A is related to any element of A
2. For real numbers x and y, we write x R y Û x – y + 2 is (b) every element of A is related to every element of A
an irrational number. Then, the relation R is (c) some elements of A are related to some elements of A
(a) Reflexive (b) Symmetric (d) None of the above
(c) Transitive (d) None of these 14. A relation R in a set A is called universal relation, if
3. Let L denote the set of all straight lines in a plane. Let a (a) each element of A is not related to every element of A
(b) no element of A is related to any element of A
relation R be defined by a R b Û a ^ b, a, b Î L . Then, R
(c) each element of A is related to every element of A
is (d) None of the above
(a) Reflexive (b) Symmetric 15. A relation R in a set A is said to be an equivalence relation,
(c) Transitive (d) None of these if R is
4. Let S be the set of all real numbers. Then, the relation (a) symmetric only (b) reflexive only
R = {(a, b) : 1 + ab > 0} on S is (c) transitive only (d) All of these
(a) Reflexive and symmetric but not transitive 16. Let R = {(3, 3) (5, 5), (9, 9), (12, 12), (5, 12), (3, 9),
(b) Reflexive and transitive but not symmetric (3, 12), (3, 5)} be a relation on the set A = {3, 5, 9, 12}.
(c) Symmetric, transitive but not reflexive Then, R is:
(d) Reflexive, transitive and symmetric (a) reflexive, symmetric but not transitive.
5. Let R be a relation on the set N be defined by (b) symmetric, transitive but not reflexive.
{(x, y) | x, y Î N, 2x + y = 41}. Then, R is (c) an equivalence relation.
(a) Reflexive (b) Symmetric
(d) reflexive, transitive but not symmetric.
(c) Transitive (d) None of these
6. Let A = {1, 2, 3} and B = {2, 4, 6, 8}. 17. A relation R in a set A is called transitive, if for all a 1, a2,
a3 Î A, (a1, a2) Î R and (a2, a3) Î R implies
Consider the rule f : A ® B, f(x) = 2x " x Î A. The
domain, codomain and range of f respectively are (a) ( a 2 ,a1 ) Î R (b) ( a1 , a3 ) Î R
(a) {1, 2, 3}, {2, 4, 6}, {2, 4, 6, 8}
(b) {1, 2, 3}, {2, 4, 6, 8}, {2, 4, 6} (c) ( a3 , a1 ) Î R (d) ( a3 , a 2 ) Î R
(c) {2, 4, 6, 8}, {2, 4, 6, 7}, {1, 2, 3} 18. If R = {(x, y) : x is father of y}, then R is
(d) {2, 4, 6}, {2, 4, 6, 8}, {1, 2, 3} (a) reflexive but not symmetric
7. The relation "less than" in the set of natural numbers is : (b) symmetric and transitive
(a) only symmetric (b) only transitive (c) neither reflexive nor symmetric nor transitive
(c) only reflexive (d) equivalence relation (d) Symmetric but not reflexive
8. Let R and S be two non-void relations in a set A. Which of 19. If R = {(x, y) : x is exactly 7 cm taller than y}, then R is
the following statements is not true. (a) not symmetric
(a) R and S transitive Þ R È S is transitive (b) reflexive
(b) R and S transitive Þ R Ç S is transitive (c) symmetric but not transitive
(c) R and S symmetric Þ R È S is symmetric (d) an equivalence relation
20. If R = {(x, y) : x is wife of y}, then R is
(d) R and S reflexive Þ R Ç S is reflexive
(a) reflexive (b) symmetric
9. The relation R = { (1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} is :
(c) transitive (d) an equivalence relation
(a) symmetric only (b) reflexive only
21. Let R be the relation in the set Z of all integers defined by
(c) an equivalence relation (d) transitive only
R = {(x, y) : x – y is an integer}. Then R is
10. Let A be the non-empty set of children in a family. The (a) reflexive (b) symmetric
relation 'x is brother of y' in A is: (c) transitive (d) an equivalence relation
(a) reflexive (b) symmetric 22. Let R be the relation in the set {1, 2, 3, 4} given by
(c) transitive (d) None of these R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}.
11. Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, (a) R is reflexive and symmetric but not transitive
2)} be a relation on A. Then R is: (b) R is reflexive and transitive but not symmetric
(a) reflexive (b) symmetric (c) R is symmetric and transitive but not reflexive
(c) transitive (d) None of these (d) R is equivalence relation
RELATIONS AND FUNCTIONS-2 209

23. Let A = (1, 2, 3). We define 33. Let A = {1, 2, 3}. Then, the number of relations containing
R1 = {(1, 2), (3, 2), (1, 3)} (1, 2) and (1, 3), which are reflexive and symmetric but
R2 = {(1, 3), (3, 6), (2, 1), (1, 2)}. Then, the relation on A not transitive, is
(a) R1 is relation and R2 is not (a) 1 (b) 2 (c) 3 (d) 4
(b) R1 and R2 are both is relation
(c) R1 and R2 are both non-relation Topic 2 : Mappings, Mapping of Functions, Kinds of
(d) None of these Mapping of functions.
24. Let R be a relation on the set A of ordered pairs of positive
integers defined by (x, y) R (u, v), if and only if xv = yu. 34. Which of the following functions from I to itself is a
Then, R is bijection?
(a) reflexive (b) symmetric (a) f(x) = x3 (b) f(x) = x + 2
(c) transitive (d) an equivalence relation (c) f (x) = 2x + 1 (d) f (x) = x2 + x
25. The relation R on the set Z defined by R = {(a, b) : (a – 35. Which of the following function is an odd function ?
b) is divisible by 5} divides the set Z into how many
disjoint equivalence classes ? (a) f (x) = 1 + x + x 2 - 1 - x + x 2
(a) 5 (b) 2 (c) 3 (d) 4
æ a x +1 ö
26. Let R be the relation on the set of all real numbers defined (b) f ( x ) = xç ÷
by a R b iff |a – b| £ 1. Then, R is ç a x -1 ÷
è ø
(a) Reflexive and symmetric
(b) Symmetric only æ 1- x 2 ö
(c) Transitive only f ( x) = logç
(c) ÷
ç 1+ x 2 ÷
(d) Anti-symmetric only è ø
27. Which one of the following relations on the set of real (d) f(x) = k, k is a constant
numbers R is an equivalence relation ? 36. A function f from the set of natural numbers to integers
(a) aR1b Û | a | = | b | (b) aR 2 b Û a ³ b ì n -1
ï , when n is odd
(c) aR 3b Û a divides b (d) aR 4 b Û a < b defined by f (n) = í 2 is
28. Let R be the relation defined in the set A of all triangles n
ï - , when n is even
as R = {(T1, T2) : T1 is similar to T2}. If R is an equivalence î 2
relation and there are three right angled triangles T1 with (a) neither one-one nor onto (b) one-one but not onto
sides 3, 4, 5; T2 with sides 5, 12, 13 and T3 with sides 6, 8, (c) onto but not one-one (d) one-one and onto both
10. Then, 37. Let X = {– 1, 0, 1}, Y = {0, 2} and a function f : X ® Y
(a) T1 is related to T2 (b) T2 is related to T3 defined by y = 2x4, is
(c) T1 is related to T3 (d) None of these (a) one-one onto (b) one-one into
29. For the set A = {1, 2, 3}, define a relation R in the set A as (c) many-one onto (d) many-one into
follows 38. Let X = {0, 1, 2, 3} and Y = {–1, 0, 1, 4, 9} and a function
R = {(1, 1), (2, 2), (3, 3), (1, 3)} f :X ® Y defined by y = x2, is
Then, the ordered pair to be added to R to make it the (a) one-one onto (b) one-one into
smallest equivalence relation is (c) many-one onto (d) many-one into
(a) (1, 3) (b) (3, 1) (c) (2, 1) (d) (1, 2) 39. Let g(x) = x2 – 4x – 5, then
30. On the set N of all natural numbers, define the relation R (a) g is one-one on R (b) g is not one-one on R
by a R b, iff GCD of a and b is 2. Then, R is (c) g is bijective on R (d) None of these
(a) reflexive, but not symmetric 40. The mapping f : N ® N given by f(n) = 1 + n2, n Î N
(b) symmetric only when N is the set of natural numbers, is
(c) reflexive and transitive (a) one-one and onto (b) onto but not one-one
(d) not reflexive, not symmetric, not transitive (c) one-one but not onto (d) neither one-one nor onto
31. A relation R is defined over the set of non-negative integers 41. The function f: R ® R given by f(x) = x3 – 1 is
as xRy Þ x 2 + y2 = 36 what is R? (a) a one-one function (b) an onto function
(c) a bijection (d) neither one-one nor onto
(a) {(0, 6)}
42. If N be the set of all natural numbers, consider f : N ® N
(b) {(6,0)( 11,5), (3,3, 3) such that f(x) = 2x, " x Î N, then f is
(c) {(6, 0)(0, 6)} (a) one-one onto (b) one-one into
(c) many-one onto (d) None of these
(d) ( 11,5), (2, 4 2), (5 11), (4 2, 2)}
43. The function f : A ® B defined by f(x) = 4x + 7, x Î R is
32. Let A = {1, 2, 3}and R = {(1, 2), (2, 3)} be a relation in A. (a) one-one (b) many-one
Then, the minimum number of ordered pairs may be added, (c) odd (d) even
so that R becomes an equivalence relation, is
(a) 7 (b) 5 (c) 1 (d) 4
 EBD_7372
210 MATHEMATICS

44. The smallest integer function f(x) = [x] is (a) f1 and f2 are onto (b) f2 and f4 are onto
(a) one-one (b) many-one (c) f2 and f3 are onto (d) f3 and f4 are onto
(c) Both (a) & (b) (d) None of these 53. Let f : R ® R be defined as f(x) = x4, then
45. The signum function, f : R ® R is given by (a) f is one-one onto
ì 1 if x > 0 (b) f is many-one onto
ï (c) f is one-one but not onto
f ( x ) = í 0, if x = 0 is (d) f is neither one-one nor onto
ï-1 if x < 0 54. The function f : R ® R defined by f(x) = x2 + x is.
î
(a) one-one (b) onto (a) one-one (b) onto
(c) many-one (d) None of these (c) many-one (d) None of the above
46. Which of the following functions is NOT one-one ? 55. Assertion : Let A = {–1, 1, 2, 3} and B = {1, 4, 9}, where
(a) f : R ® R defined by f ( x) = 6 x - 1. f : A ® B given by f(x) = x2, then f is a many-one function.
Reason : If x 1 ¹ x 2 Þ f(x 1 ) ¹ f(x 2), for every
(b) f : R ® R defined by f ( x) = x 2 + 7. x1, x2 Î domain, then f is one-one or else many-one.
(c) f : R ® R defined by f ( x) = x3. (a) Assertion is correct, reason is correct; reason is a
2x + 1 correct explanation for assertion.
(d) f : R - {7} ® R defined by f ( x) = . (b) Assertion is correct, reason is correct; reason is not
x-7
a correct explanation for assertion
47. Let f : R ® R be defined as f (x) = 2x3. then
(c) Assertion is correct, reason is incorrect
(a) f is one-one onto
(b) f is one-one but not onto (d) Assertion is incorrect, reason is correct.
(c) f is onto but not one-one 56. Consider the following statements
(d) f is neither one-one nor onto Statement - I : An onto function f : {1, 2, 3} ® {1, 2, 3}
is always one-one.
x2 +1 Statement - II : A one-one function f :{1, 2, 3} ® {1, 2, 3}
48. Let f : R ® R be defined as f (x) = , then
2 must be onto.
(a) f is one-one onto (a) Only I is true (b) Only II is true
(b) f is one-one but not onto (c) Both I and II are true (d) Neither I nor II is true
(c) f is onto but not one-one 57. Let A = {1, 2, 3} and B = {a, b, c}, then the number of
(d) f is neither one-one nor onto bijective functions from A to B are
49. A function f : X ® Y is said to be onto, if for every y Î Y,, (a) 2 (b) 8 (c) 6 (d) 4
there exists an element x in X such that 58. Let A = {1, 2, 3} and B = {a, b, c}, and let f = {(1, a), (2,
(a) f(x) = y (b) f(y) = x b), (P, c)}be a function from A to B. For the function f
(c) f(x) + y = 0 (d) f(y) + x = 0 to be one-one and onto, the value of P =
50. f : X ®Y is onto, if and only if (a) 1 (b) 2 (c) 3 (d) 4
(a) range of f = Y (b) range of f ¹ Y
59. The function f : R ® R defined by f (x) = sin x is :
(c) range of f < Y (d) range of f ³ Y
(a) into (b) onto
51. Let f : {x, y, z} ® {1, 2, 3} be a one-one mapping such
that only one of the following three statements is true and (c) one-one (d) many one
remaining two are false : f (x) ¹ 2, f (y) = 2, f (z) ¹ 1, then ìï x | x | -4, x Î Q
(a) f (x) > f (y) > f (z) (b) f (x) < f (y) < f (z) 60. If f : R ® R, f (x) = í , then f (x) is
(c) f (y) < f (x) < f (z) (d) f (y) < f (z) < f (x) ïî x | x | - 3 x Ï Q
52. Consider the four functions f1, f2, f3 and f4 as follows (a) one to one and onto (b) many to one and onto
(c) one to one and into (d) many to one and into
f2
f1 a 61. A function f : R ® [–1, 1] defined by
1 a 1 b
2 b 2 c f(x) = sin x, "x Î R, where R is the subset of real numbers
c d
3 d e
is one-one and onto if R is the interval:
3
e
4 f 4 f
(a) [0, 2p] (b) é p pù
êë - 2 , 2 úû
X1 (i) X2 X1 (ii) X2
(c) [ -p, p ] (d) [ 0, p ]
f3 62. Let f : R ® R be function defined by
1 a 1
f4 a f (x) = sin (2x –3), then f is
b b (a) injective (b) surjective
2 2
c c (c) bijective (d) None of these
3 3
d 63. Let f : R ® R be a function defined by
4 4
f(x) = x3 + 4, then f is
X1 X3 X1 X4
(a) injective (b) surjective
(iii) (iv)
(c) bijective (d) None of these
RELATIONS AND FUNCTIONS-2 211

64. The number of all one-one functions from set A = {1, 2, 77. If f : R ® R, g : R ® R and h : R ® R are such that
3} to itself is f (x) = x2, g(x) = tan x and h(x) = log x, then the value of
(a) 2 (b) 6 (c) 3 (d) 1 (go (foh)) (x), if x = 1 will be
65. lf A = {l,3,5,7} and B = {l,2,3,4,5,6, 7,8}, then the number (a) 0 (b) 1 (c) –1 (d) p
of one–to–one functions from A into B is 78. Let f : [4, ¥) ® [1, ¥) be a function defined by
(a) 1340 (b) 1680 (c) 1430 (d) 1880
66. If the function gof is defined and is one-one then f ( x) = 5 x ( x - 4) , then f–1 (x) is
(a) neither f nor g is one-one
(b) f and g both are necessarily one-one (a) 2 - 4 + log 5 x (b) 2 + 4 + log 5 x
(c) g must be one-one x (x - 4)
æ1ö
(d) None of the above (c) ç ÷ (d) None of these
67. The number of equivalence relations in the set {1, 2, 3} è5ø
containing (1, 2) and (2, 1) is 79. If f(x) = x – x2 + x3 – x4 + ... to ¥ for |x| < 1, then f–1(x) =
(a) 2 (b) 3 (c) 1 (d) 4
68. The function f : [0, p] ® R, f (x) = cos x is x x 1- x 1
(a) (b) (c) (d)
(a) one-one function (b) onto function 1+ x 1- x x x
(c) a many one function (d) None of these 80. Let f : R ® R, g : R ® R be two functions such that
69. The function f : R ® R defined by f(x) = 2x – 3, g(x) = x3 + 5. The function (fog)–1 (x) is
f (x) = (x – 1) (x – 2) (x – 3) is equal to
(a) one-one but not onto (b) onto but not one-one 1/ 3 1/ 3
æ x+7ö æ 7ö
(c) both one-one and onto (d) neither one-one nor onto (a) ç ÷ (b) ç x - ÷
70. The number of surjection from è 2 ø è 2ø
1/ 3 1/ 3
A = {1, 2, ......., n}, n ³ 2 onto B = {a, b} is æ x-2ö æ x-7ö
(a) nP2 (b) 2n – 2 (c) ç ÷ (d) ç ÷
è 7 ø è 2 ø
(c) 2n – 1 (d) None of these
71. The number of surjective functions from A to B where 2x - 7
81. If f : R ® R defined by f ( x ) = is an invertible
A = {1, 2, 3, 4} and B = {a, b} is 4
–1
function, then f is equal to
(a) 14 (b) 12 (c) 2 (d) 15
72. If f : R ® S , defined by f ( x) = sin x - 3 cos x + 1, is ( 4x + 5) ( 4x + 7)
(a) (b)
onto, then the interval of S is 2 2
(a) [ –1, 3] (b) [–1, 1] (c) [ 0, 1] (d) [0, 3] 3x + 2 9x + 3
(c) (d)
73. Let function f : R ® R be defined by f (x) = 2x + sin x for 2 5
x Î R , then f is
82. Consider the function f in A = R - ì
2ü
(a) one-one and onto í ý defined as
(b) one-one but NOT onto î3þ
4x + 3
(c) onto but NOT one-one f (x) = , then f –1 is equal to
(d) neither one-one nor onto 6x - 4
3 + 4x 6x - 4 3 - 4x 9 + 2x
Topic 3 : Composition of Functions, Inverse of a Function, (a) (b) (c) (d)
6x - 4 3 + 4x 6x - 4 6x - 4
Binary Operations.
83. If the binary operation * on the set of integers Z, is defined
by a * b = a + 3b2, then the value of 8 * 3 is
74. If f : R ® R and g : R ® R defined by f(x) = 2x + 3 and
(a) 32 (b) 40 (c) 36 (d) 35
g(x) = x2 + 7, then the value of x for which f(g(x)) = 25 is
(a) ± 1 (b) ± 2 (c) ± 3 (d) ± 4 x
75. If f: R ® R is given by 84. If f(x) = , then (fof of) (x) is
1+ x2
ì -1, when x is rational
f (x) = í 3x x
î1, when x is irrational, (a)
2
(b)
1+ x 1 + 3x 2
( )
then (fof) 1 - 3 is equal to
3x
(c) (d) None of these
(a) 1 (b) – 1 (c) 3 (d) 0
1 - x2
1+ x ö 3x + x 3 85. For binary operation * defined on R – {1} such that
76. Given f ( x ) = log æç ÷ an d g ( x ) = , t hen a
è 1- x ø 1 + 3x 2 a*b = is
fog(x) equals b +1
(a) – f (x) (b) 3f(x) (a) not associative (b) not commutative
(c) [f (x)]3 (d) None of these (c) commutative (d) both (a) and (b)
 EBD_7372
212 MATHEMATICS

86. The binary operation * defined on N by a * b = a + b + ab 97. Let f (x) = – 1 + | x – 1 |, –1 £ x £ 3 and

for all a, b Î N is g (x) = 2 – | x + 1 |, –2 £ x £ 2, then (fog) (x) is equal to
(a) commutative only
(b) associative only ìx + 1 - 2 £ x £ 0 ìx - 1 - 2 £ x £ 0
(a) í (b) í
(c) both commutative and associative îx - 1 0 < x £ 2 îx + 1 0 < x £ 2
(d) None of these
87. If a binary operation * is defined by a * b = a 2 + b2 + ab + 1, ì - 1 - x -2 £ x £ 0
then (2 * 3) * 2 is equal to (c) í (d) None of these
î x -1 0<x£2
(a) 20 (b) 40 (c) 400 (d) 445
88. If a * b denote the bigger among a and b and if 98. Which of the following is not a binary operation on the
a . b = (a * b) + 3, then 4.7 = indicated set?
(a) 14 (b) 31 (c) 10 (d) 8 (a) On Z+, * defined by a * b = a – b
89. Let A = {1, 2, 3, 4, 5} and functions (b) On Z+, * defined by a * b = ab
(c) On R, * defined by a * b = ab2
f : A ® A and g : A ® A be defined by
(d) None of the above
f (1) = 3, f (2) = 5, f (3) = 3, f (4) = 1, f (5) = 2; g (1) = 4, 99. Consider a binary operation * on N defined as
g (2) = 1, g (3) = 1, g (4) = 2, g (5) = 3. Then a * b = a3 + b3
(a) fog = {(1,1), (2, 3), (3, 2), (4, 5)} (a) * is both associative and commutative
(b) fog = {(1,1), (2,3), (3,3), (4,5), (5,3)}
(b) * is commutative but not associative
(c) gof = {(1, 1), (2, 3), (3, 3), (4, 4), (5, 5)}
(c) * is associative but not commutative
(d) gof = {(2, 2), (2, 3), (3, 1), (4, 1), (5, 1)}
(d) * is neither commutative nor associative
90. Let f : (4, 6) ® (6, 8) be a function defined by 100. Assertion : f : R ® R is a function defined by
éx ù 2x + 1 3x - 1
f ( x ) = x + ê ú (where [.] denotes the greatest integer
ë2û f(x) = . Then f–1(x) = .
3 2
function), then f -1 ( x) is equal to Reason : f(x) is not a bijection.
(a) Assertion is correct, reason is correct; reason is a
éxù
(a) x-ê ú (b) -x - 2 correct explanation for assertion.
ë2û (b) Assertion is correct, reason is correct; reason is not
1
(c) x – 2 (d) a correct explanation for assertion
éx ù
x+ê ú (c) Assertion is correct, reason is incorrect
ë2û
(d) Assertion is incorrect, reason is correct.
91. If f : R ® R is given by f (x) = 1 - x 2 , then fof is ax + b
101. Let f ( x ) = . Then fof (x) = x provided that
(a) (b) x2 (c) x (d) 1– x2 cx + d
x
92. If f is an even function and g is an odd function, then the (a) d = – a (b) d = a
function fog is (c) a = b = c = d = 1 (d) a = b = 1
(a) an even function (b) an odd function ìï2x + a ; x ³ -1
(c) neither even nor odd (d) a periodic function 102. If f (x) = í 2 and
93. If f : X ® Y is a function such that there exists a function ïîbx + 3 ; x < -1
g : Y ® X such that gof = IX and fog = IY, then f must be
(a) one-one (b) onto ìx + 4 ; 0 £ x £ 4
(c) one-one and onto (d) None of these g (x) = í
94. Which of the following option is correct? î-3x - 2 ; - 2 < x < 0
(a) gof is one-one Þ g is one-one If domain of g (f (x)) is [–1, 4], then –
(b) gof is one-one Þ f is one-one (a) a = 0, b > 5 (b) a = 2, b > 7
(c) gof is onto Þ g is not onto (c) a = 2, b > 10 (d) a = 0, b Î R
(d) gof is onto Þ I is onto 103. Let f : (2, 3) ® (0, 1) be defined by f(x) = x – [x]. Then,
2 10 x - 10 - x f–1(x) equals to
95. The inverse of f (x) = is (a) x – 2 (b) x + 1 (c) x – 1 (d) x + 2
3 10 x + 10- x
104. Let A = R – {3} and B = R – {1}. If f : A ® B defined by
1 1+ x 1 2 + 3x x-2
(a)
3
log10
1- x
(b)
2
log10
2 - 3x f (x) = is invertible, then the inverse of f is
x -3
1 2 + 3x 1 2 - 3x 3y + 2 3y - 2
(c) log10 (d) log10
3 2 - 3x 6 2 + 3x (a) y -1
(b) y +1
96. The domain of the function
f ( x ) = 24- x C3x -1 + 40-6 x C8x -10 is, 3y - 2
(c) y -1
(d) None of these
(a) {2, 3} (b) {1, 2, 3}
(c) {1, 2, 3, 4} (d) None of these
RELATIONS AND FUNCTIONS-2 213

105. If f : R ® R, f (x) = x3 + 2, then f –1 (x) is 114. If f : Q ® Q, f (x) = 2x ; g : Q ® Q, g (x) = x + 2, then

(a) 1/ 2
(x - 1) (b) x -2 value of (fog)–1 (20) is
(a) 5 (b) – 8 (c) 4 (d) 8
(c)(x - 2)1/ 3 (d) (x - 2)1/ 2 115. In the set N of natural numbers, define the binary operation
106. Consider the following statements * by m * n = GCD (m, n), m, n Î N. Then, which of the
I. The operation * defined on Z+ by a * b = |a – b| is a following is true?
binary operation. I. * is not a binary operation
II. The operation * defined on Z+ by a * b = a is not a II. * is a binary operation
binary operation. III. Inverse of each element of N exist
(a) Only I is true (b) Only II is true IV. Inverse of each element of N does not exist
(c) Both I and II are true (d) Neither I nor II is true (a) I and IV are true (b) II and III are true
107. The range of the function f (x) = 7 – x Px – 3 is (c) Only I is true (d) II and IV are true
(a) {1, 2, 3} (b) {1, 2, 3, 4, 5, 6}
116. Let f(x) = 2x2, g(x) = 3x + 2 and fog (x) = 18 x2 + 24x + c,
(c) {1, 2, 3, 4} (d) {1, 2, 3, 4, 5}
108. A binary operation * on the set {0, 1, 2, 3, 4, 5} is defined then c =
as (a) 2 (b) 8 (c) 6 (d) 4

ì a+b , if a + b < 6 2
a*b = í 117. Let f (x) = , x ¹ 3 The inverse of f (x) is
îa + b - 6 , if a + b ³ 6 x -3
the identity element is
(a) 0 (b) 1 (c) 2 (d) 3 2 + ax
g(x) = , x ¹ 0 . Then a =
109. Let * be a binary operation on set Q of rational numbers x
ab (a) 5 (b) 2 (c) 3 (d) 4
defined as a * b = . The identity for * is
5 x
(a) 5 (b) 3 (c) 1 (d) 6 118. If f (x) = , then (fofo........of )(x) is equal to :
110. Let * be the binary operation on N given by a * b = HCF x -1 19 times
(a, b) where, a, b Î N. The value of 22 * 4 is 19
x æ x ö 19x
(a) 1 (b) 2 (c) 3 (d) 4 (a) (b) (c) (d) x
x -1 çè x - 1÷ø x -1
111. Assertion : If f : R ® R and g : R ® R be two mappings
such that f(x) = sin x and g(x) = x2, then fog ¹ gof. pö
æ pö æ
Reason : (fog) x = f(x) g(x) = (gof) x 119. If f (x) = sin2 x + sin2 ç x + ÷ + cos x cos ç x + ÷ and
è 3ø è 3ø
(a) Assertion is correct, reason is correct; reason is a
correct explanation for assertion.
æ5ö
(b) Assertion is correct, reason is correct; reason is not g ç ÷ = 1, then gof (x) is equal to
a correct explanation for assertion è4ø
(c) Assertion is correct, reason is incorrect (a) 1 (b) 48 (c) – 48 (d) – 1
(d) Assertion is incorrect, reason is correct. 120. If g(x) = x – 2 is the inverse of the function f(x) = x + 2,
112. Let f be a function with domain X and range Y. Let A, B then graph of g (x) is the image of graph of f(x) about
Í X and C, D Í Y. Which of the following is not true? the line y = kx. Here k =
(a) f (A È B) = f (A) È f (B) (a) 1 (b) 2 (c) 3 (d) 4
(b) f (A Ç B) = f (A) Ç f (B) 121. Let A = N × N and * be the binary operation on A defined
(c) f–1 (C È D) = f–1 (C) È f–1 (D) by (a, b) * (c, d) = (a + c, b + d). Then * is
(d) f–1 (C Ç D) = f–1 (C) Ç f–1 (D) (a) commutative (b) associative
ìï x 3 - 1, x < 2 (c) Both (a) and (b) (d) None of these
113. Let f (x) = í 2 . Then 122. If the binary operation * is defined on the set Q+ of all
ïîx + 3, x ³ 2
ab æ1 1ö
ìï (x + 1)1/3 , x < 2 positive rational numbers by a * b = . Then 3 * ç * ÷
4 è5 2ø
(a) f – 1 (x) = í 1/3
ïî(x - 3) , x ³ 2 is equal to

ìï (x + 1)1/3 , x < 7 3 5 3 3
(b) f – 1 (x) = í (a) (b) (c) (d)
1/2 160 160 10 40
ïî(x - 3) , x ³ 7
123. Let S be a finite set containing n elements. Then the total
ïì (x + 1) , x < 1
1/3 number of binary operations on S is:
(c) f – 1 (x) = í 1/2 2 2
ïî(x - 3) , x ³ 7 (a) nn (b) nn (c) 2n (d) n2
(d) f – 1 (x) does not exist
 EBD_7372
214 MATHEMATICS

3x + 4 BEYOND NCERT
124. If f : B ® A is defined by f ( x ) = and g : A ® B is
5x - 7 Topic 4: Composition of Relations, Inverse of a Relation.
7x + 4 ì3ü 131. The relation R is defined on the set of natural numbers as
defined by g ( x ) = , where A = R – í ý and
5x - 3 î5þ {(a, b) : a = 2b}. Then, R–1 is given by
(a) {(2, 1), (4, 2), (6, 3),...} (b) {(1, 2), (2, 4), (3, 6),...}
ì7 ü (c) R–1 is not defined (d) None of these
B = R – í ý and IA is an identity function on A and IB is
î5þ 132. Let R = {(1, 3), (2, 2), (3, 2)} and S = {(2, 1), (3, 2), (2, 3)}
identity function on B, then be two relations on set A = {1, 2, 3}. Then RoS =
(a) fog = IA and gof = IA (b) fog = IA and gof = IB (a) {(1, 3), (2, 2), (3, 2), (2, 1), (2, 3)}
(c) fog = IB and gof = IB (d) fog = IB and gof = IA (b) {(3, 2), (1, 3)}
1 (c) {(2, 3), (3, 2), (2, 2)}
125. If f : R ® R be given by f ( x ) = 3 - x 3 ( )3 , then fof (x) is (d) {(2, 3), (3, 2)}
133. If R is an equivalence relation on a set A, then R–1 is
1 (a) Reflexive only
(a) (b) x3 (c) x (d) (3 – x3)
x3 (b) Symmetric but not transitive
126. If f(x) = |x| and g(x) = |5x – 2|, then (c) Equivalence
(a) gof (x) = |5x – 2| (b) gof (x) = |5| x | – 2|
(d) None of these
(c) fog (x) = |5| x | – 2| (d) fog (x) = |5x + 2|
134. The relation R defined in A = {1, 2, 3} by aRb, if | a 2 – b2 | £
127. If f(x) = ex and g(x) = logex, then which of the following
is true? 5. Which of the following is false?
(a) R = {(1, 1), (2, 2), (3, 3), (2, 1), (1, 2), (2, 3), (3,2)}
(a) f {g ( x )} ¹ g {f ( x )} (b) f {g ( x )} = g {f ( x )} (b) R – 1 = R
(c) Domain of R = {1, 2, 3}
(c) f {g ( x )} + g {f ( x )} = 0 (d) f {g ( x )} - g {f ( x )} = 1 (d) Range of R = {5}
128. For a binary operation * on the set {1, 2, 3, 4, 5}, consider 135. If R be a relation < from A = {1, 2, 3, 4} to B = {1, 3, 5}
the following multiplication table.
i.e., (a, b) Î R Û a < b, then RoR -1 is
* 1 2 3 4 5 (a) {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
(b) {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
1 1 1 1 1 1 (c) {(3, 3), (3, 5), (5, 3), (5, 5)}
2 1 2 1 2 1 (d) {(3, 3), (3, 4), (4, 5)}
136. Assertion : If the relation R defined in A = {1, 2, 3} by
3 1 1 3 1 1 aRb, if |a2 – b2| £ 5, then R– 1 = R
Reason : For above relation, domain of R–1 = Range of R.
4 1 2 1 4 1
(a) Assertion is correct, reason is correct; reason is a
5 1 1 1 1 5 correct explanation for assertion.
(b) Assertion is correct, reason is correct; reason is not
Which of the following is correct? a correct explanation for assertion
(a) (2 * 3) * 4 = 1 (c) Assertion is correct, reason is incorrect
(b) 2 * (3 * 4) = 2 (d) Assertion is incorrect, reason is correct.
(c) * is not commutative 137. Let R be a relation on a set A such that R = R–1, then R is
(d) (2 * 3) * (4 * 5) = 2
129. If f (x) = sin x + cos x, g (x) = x2 – 1, then g (f (x)) is (a) Reflexive (b) Symmetric
invertible in the domain (c) Transitive (d) None of these
138. R is a relation from {11, 12, 13} to {8, 10, 12} defined by
é pù é p pù é p pù y = x – 3. The relation R–1 is
(a) ê0, ú (b) ê- , ú (c) ê- 2 , 2 ú (d) [0, p]
ë 2û ë 4 4û ë û (a) {(11, 8), (13, 10)}
130. The inverse of the function (b) {(8, 11), (10, 13)}
(c) {(8, 11), (9, 12), (10, 13)}
e x - e- x (d) None of these
f (x) = + 2 is
ex + e- x 139. If R Í A × B and S Í B × C be two relations, then
1/2
(SoR)–1 is equal to
1/ 2
æ x - 3ö æ x - 1ö (a) S –1 oR –1 (b) RoS
loge ç loge ç
(a)
è x - 1 ÷ø (b)
è 3 - x ÷ø (c) R–1 oS–1 (d) None of these
140. If f = {(5, 2), (6, 3)} and g = {(2, 5), (3, 6)}, then fog is
1/ 2 1/ 2
æ x + 2ö æ x +1ö (a) {(2, 2), (3, 3)} (b) {(5, 3), (6, 2)}
loge ç (d) loge çè
è x - 3 ÷ø ÷
(c) (c) {(2, 2), (5, 5)} (d) {(6, 6), (3, 3)}
x - 2ø
RELATIONS AND FUNCTIONS-2 215

NCERT Exemplar MCQs (a) nP2 (b) 2n – 2

1. Let T be the set of all triangles in the Euclidean planen (c) 2n – 1 (d) None of these
and let a relation R on T be defined as aRb, if a is congruent 1
to b, " a, b Î T. Then, R is 10. Let f : R ® R be defined by f ( x ) = "x Î R . Then f is
x
(a) reflexive but not transitive
(a) one-one (b) onto
(b) transitive but not symmetric
(c) bijective (d) f is not defined
(c) equivalence
11. Let f : R ® R be defined by f(x) = 3x2 – 5 and g : R ® R
(d) None of these
x
2. Consider the non-empty set consisting of children in a family by g ( x ) = 2 . Then gof is
and a relation R defined as a R b if a is brother of b. Then R x +1
is
3x 2 - 5 3x 2 - 5
(a) symmetric but not transitive (a) (b)
(b) transitive but not symmetric 9x 4 - 30x 2 + 26 9x 4 - 6x 2 + 26
(c) neither symmetric nor transitive
(d) both symmetric and transitive 3x 2 3x 2
(c) (d)
3. The maximum number of equivalence relations on the set x 4 + 2x 2 - 4 9x 4 + 30x 2 - 2
A = {1, 2, 3} are 12. Which of the following functions from Z into Z are bijective?
(a) 1 (b) 2 (a) f(x) = x3 (b) f(x) = x + 2
(c) 3 (d) 5 (c) f(x) = 2x + 1 (d) f(x) = x2 + 1
4. If a relation R on set {1, 2, 3} be defined by R = {(1, 2)}, 13. If f : R ® R be the function defin ed by
then R is f(x) = x 3 + 5, then f –1 (x) is equal to:
(a) reflexive (b) transitive (a) (x + 5)1/3 (b) (x – 5)1/3
(c) symmetric (d) None of these (c) (5 – x)1/3 (d) (5 – x)
5. Let us define a relation R in R as aRb if a ³ b. Then R is 14. If f : A ® B and g : B ® C be the bijective functions, then
(a) an equivalence relation (gof )–1 is
(b) reflexive, transitive but not symmetric (a) f –1og–1 (b) fog
(c) symmetric, transitive but not reflexive (c) g–1of –1 (d) gof
(d) neither transitive nor reflexive but symmetric
ì3ü 3x + 2
6. The relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} 15. Let f : R – í ý ® R be defined by f ( x ) = . Then
on set A = {1, 2, 3} is î5þ 5x - 3
(a) Reflexive but not symmetric (a) f –1(x) = f(x) (b) f –1(x) = – f(x)
(b) Reflexive but not transitive
1
(c) Symmetric and transitive (c) (fof )x = – x (d) f –1(x) = f(x)
19
(d) Neither symmetric nor transitive
7. The identity element for the binary operation * defined on 16. If f (x) is defined on [0, 1] by the rule

ab ì x : x is rational
Q – {0} as a * b = , " a, b Î Q – {0} is f (x) = í
2 î1 - x : x is irrational
(a) 1 (b) 0 then for all x Î R, f (f(x)) is
(c) 2 (d) None of these (a) constant (b) 1 + x
8. If the set A contains 5 elements and the set B contains 6 (c) x (d) None of these
elements, then the number of one-one and onto mapping 17. If f : [2, ¥) ® R be the function defined by f (x) = x2 – 4x
from A to B is + 5, then the range of f is
(a) 720 (b) 120 (a) R (b) [1, ¥)
(c) 0 (d) None of these (c) [4, ¥) (d) [5, ¥)
9. If A = {1, 2, 3, ....., n} and B = {a, b}. Then, the number of 18. Let f : N ® R be the function defined by
surjections from A into B is
 EBD_7372
216 MATHEMATICS

2x - 1 (a) f is one-one onto (b) f is one-one into

f (x) = and g : Q ® R be another function defined
2 (c) f is many-one onto (d) f is many-one into
3 23. If r = {(x, y) |x2 + y2 = 1; x, y Î R}. Then, r is
by g(x) = x + 2. Then (gof) is
2 [BITSAT 2015, A]
7 (a) reflexive (b) symmetric
(a) 1 (b) 0 (c) (d) 3 (c) transitive (d) anti-symmetric
2
19. Let f : R ® R be defined by ax + b
24. Let f (x) = , then fof (x) = x, provided that :
cx + d
ì 2x : x>3
ï 2 [BITSAT, 2016, A]
f ( x ) = íx : 1 < x £ 3 (a) d = – a (b) d = a
ï 3x : x £1
î (c) a = b = 1 (d) a = b = c = d = 1

Then f (– 1) + f (2) + f (4) is é 1 1ù x

25. The function f : R ® ê - , ú defined as f(x) = , is :
(a) 9 (b) 14 ë 2 2û 1 + x2
(c) 5 (d) None of these [JEE MAIN 2017, A]
20. Let f : R ® R be given by f(x) = tan x. Then f –1(1) is (a) neither injective nor surjective
(b) invertible
p ì p ü
(a) (b) ínp + : n Î Z ý (c) injective but not surjective
4 î 4 þ (d) surjective but not injective
(c) does not exist (d) None of these 26. Let f and g be functions from R to R defined as
Past Year MCQs
ì 7 x 2 + x - 8, x £ 1 ì | x |, x < -3
ï ï
1 f ( x) = í 4 x + 5, 1 < x £ 7 , g ( x) = í0, - 3 £ x < 2
21. If g is the inverse of a function f and f ' ( x ) = , then
1 + x5 ï 8 x + 3, x > 7 ï 2
î î x + 4, x ³ 2
g ¢ ( x ) is equal to: [JEE MAIN 2014, C]
Then [BITSAT 2017, S]

1 (a) (fog) (–3) = 8 (b) (fog) (9) = 683

(b) 1 + { g ( x )}
5
(a)
1 + { g ( x )}
5
(c) (gof) (0) = – 8 (d) (gof) (6) = 427
(c) 1 + x5 (d) 5x4

x-m
22. Let f : R ® R be a function defined by f (x) = ,
x-n
where m ¹ n , then [BITSAT 2014, A]

Exercise 3 : Try If You Can

(c) gof(x) is surjective function
ì æp öü
1. If f ( x ) = (1 + tan x) í1 + tan ç - x ÷ý and let g(x) be (d) None of these
î è4 øþ
ax 2 + 6 x - 8
defined for all real x, then which of the following statements 2. If the function f : R ® R defined by f ( x ) =
is/are true for gof(x)? a + 6 x - 8x2
(a) domain of gof(x) is R is onto for a Î [m, n], then mn - 3 is equal to.
(b) gof(x) is constant " x Î D f (a) 4 (b) 19
(c) 5 (d) None of these
RELATIONS AND FUNCTIONS-2 217

9. Let f (x) = sin x and g (x) = loge | x |. If the ranges of the

3. Let f : R + ® {-1, 0, 1} defined by
composition functions fog and gof ar e R1 and R 2 ,
respectively, then
f ( x ) = sgn( x - x 4 + x 7 - x8 - 1) where sgn denotes
(a) R1 = {u: – 1 £ u < 1}, R2 = {v: – ¥ < v < 0}
signum function. Then f(x) is (b) R1 = {u: – ¥ < u < 0}, R2 = {v: – ¥ < v < 0}
(a) many-one and onto (b) many-one and into (c) R1 = {u: – 1 < u < 1}, R2 = {v: – ¥ < v < 0}
(c) one-one and onto (d) one-one and into (d) R1 = {u: – 1 £ u £ 1}, R2 = {v: – ¥ < v £ 0}
4. Let f (x) = x2 + ax + b cos x, a being an integer and b is a 10. A relation R on the set of complex numbers is defined
real number. Find the number of ordered pairs (a, b) for z –z
by z1 R z2 if and only if 1 2 is real, then R is
which the equations f (x) = 0 and f ( f (x)) = 0 have the z1 + z2
same (nonempty) set of real roots (a) Not reflexive (b) Symmetric
(a) 1 (b) 2 (c) 3 (d) 4 (c) Not transitive (d) None of these
æ 2 log10 x + 2 ö 11.
log y
For positive real numbers x and y, let f (x, y) = x 2 . If
5. If f ( x) = log100 x ç ÷ ; g ( x ) = { x}; where {x}
è -x ø the sum of the solutions of the equation
denotes the fractional part of x. If the function (fog)(x) m
exists, then the maximum possible range of g(x) is 4096 f ( f (x, x), x) = x13 can be expressed as ( where m,
n
(a) (0, 10–1) (b) (0, 10–2) n are coprime numbers), then (m – 10n) is
(c) -2 -2 -1
(0, 10 ) È (10 , 10 ) (d) None of these (a) 1 (b) 2
(c) –1 (d) None of these
6. Let f(x) = max {1 + sinx, 1, 1 – cosx}, x Î [0, 2p] and
12. If two roots of the equation
g(x) = max{1, |x – 1|}, xÎR, then which of the following
is incorrect. ( p - 1)( x 2 + x + 1)2 - ( p + 1)( x 4 + x 2 + 1) = 0 are real and
(a) g(f(0)) = 1 (b) g(f(1)) = 1 1- x æ æ 1 öö
distinct and f ( x ) = , then f ( f ( x)) + f ç f ç ÷ ÷ is
(c) f(g(1)) = 1 (d) f(g(0)) = 1 + sin1 1+ x è è x øø
equal to
7. Let X and Y be two non-empty sets. Let f : X ® Y be a
(a) p (b) –p (c) 2p (d) –2p
function. For AÌ X and B Ì Y, define 13. Let f (z) = sin z and g(z) = cos z. If * denotes a composition
f ( A)= { f ( x) : x Î A}; f -1 ( B) = {x Î X : f ( x) Î B}, then of functions, then the value of (f + ig) * (f – ig) is :
–iz iz
–e -e
-1 -1
(a) i e (b) ie
(a) f(f ( B )) = B (b) f(f ( B)) Ì B –iz
(c) – i e– e (d) None of these
(c) f -1 ( f ( A)) = A (d) f -1 ( f ( A)) Ì A
ì 2 p - 2ü
8. If f (x) = 3 | x | - x - 2 and g (x) = sin x, then domain of 14. If A = íx : - £ x £ ý , B = {y : – 1 £ y £ 1|} and f
î 5 5 þ
definition of fog (x) is (x) = cos (5x + 2), then the mapping f : A ® B is
ì pü (a) one-one but not onto (b) onto but not one-one
(a) í 2 np + ý (c) both one-one and onto (d) neither one-one nor onto
î 2 þ n ÎI
15. Let f and g be functions from R to R defined as
7p 11p ö ì7 x 2 + x - 8, x £ 1 ì | x |, x < -3
æ
(b) U çè 2np +
6
, 2 np +
6 ø
÷ ïï ï
f ( x ) = í4x + 5, 1 < x £ 7 g ( x ) = í0, - 3 £ x < 2
n ÎI
ï 8x + 3, x > 7 ï x 2 + 4, x ³ 2
ïî î
ì 7p ü Then
(c) í 2 np + ý
î 6 þ n ÎI (a) (fog) (–3) = 8 (b) (fog) (9) = 683
(c) (gof) (0) = – 8 (d) (gof) (6) = 427
p é 7p 11p ù
(d) {(4m + 1) : m Î I } U ê 2n p + , 2 np +
2 nÎI ë 6 6 úû
 EBD_7372
218 MATHEMATICS

ANSWER KEYS
Exercise 1 : Topic-wise MCQs
1 (b) 15 (d) 29 (b) 43 (a) 57 (c) 71 (a) 85 (d) 99 (b) 113 (b) 127 (b)
2 (a) 16 (d) 30 (b) 44 (b) 58 (c) 72 (a) 86 (c) 100 (c) 114 (d) 128 (a)
3 (b) 17 (b) 31 (c) 45 (c) 59 (d) 73 (a) 87 (d) 101 (a) 115 (d) 129 (b)
4 (a) 18 (c) 32 (a) 46 (b) 60 (d) 74 (b) 88 (c) 102 (a) 116 (b) 130 (b)
5 (d) 19 (a) 33 (a) 47 (a) 61 (b) 75 (b) 89 (b) 103 (d) 117 (c) 131 (b)
6 (b) 20 (c) 34 (b) 48 (d) 62 (d) 76 (b) 90 (c) 104 (c) 118 (a) 132 (c)
7 (b) 21 (d) 35 (a) 49 (a) 63 (c) 77 (a) 91 (c) 105 (c) 119 (a) 133 (c)
8 (a) 22 (b) 36 (d) 50 (a) 64 (b) 78 (b) 92 (a) 106 (a) 120 (a) 134 (d)
9 (b) 23 (a) 37 (c) 51 (c) 65 (b) 79 (b) 93 (c) 107 (a) 121 (c) 135 (c)
10 (c) 24 (d) 38 (b) 52 (d) 66 (d) 80 (d) 94 (b) 108 (a) 122 (a) 136 (b)
11 (c) 25 (a) 39 (b) 53 (d) 67 (a) 81 (b) 95 (b) 109 (a) 123 (a) 137 (b)
12 (b) 26 (a) 40 (c) 54 (c) 68 (a) 82 (a) 96 (a) 110 (b) 124 (b) 138 (b)
13 (a) 27 (a) 41 (c) 55 (a) 69 (b) 83 (d) 97 (d) 111 (c) 125 (c) 139 (c)
14 (c) 28 (c) 42 (b) 56 (c) 70 (b) 84 (b) 98 (a) 112 (b) 126 (b) 140 (a)
Exercise 2 : Exemplar & Past Year MCQs
1 (c) 4 (d) 7 (c) 10 (d) 13 (b) 16 (c) 19 (a) 22 (b) 25 (d)
2 (b) 5 (b) 8 (c) 11 (a) 14 (a) 17 (b) 20 (b) 23 (b) 26 (b)
3 (d) 6 (a) 9 (d) 12 (b) 15 (a) 18 (d) 21 (b) 24 (a)
Exercise 3 : Try If You Can
1 (b) 3 (b ) 5 (c) 7 (b) 9 (d) 11 (a) 13 (b) 15 (b)
2 (c) 4 (d) 6 (c) 8 (d) 10 (b) 12 (a) 14 (c)