Relations and Functions 3

Previous Years’ CBSE

PREVIOUS Board
YEARS MCQS Questions

1.2 Types of Relations 10. Show that the relation R defined by (a, b) R (c, d)
a + d = b + c on the set N × N is an equivalence
VSA (1 mark) relation. (AI 2010, 2008)

1. If R = {(x, y) : x + 2y = 8} is a relation on N, 11. Let f : X Y be a function, define a relation R

write the range of R. (AI 2014) on X given by R = {(a, b) : f (a) = f (b)}. Show
that R is an equivalence relation on X.
2. Let R = {(a, a3) : a is a prime number less than 5}
(AI 2010 C)
be a relation. Find the range of R.
(Foreign 2014) 12. Prove that the relation R in the set A = {1, 2, 3, 4, 5}
given by R = {(a, b) : a – b is even}, is an
3. Let R be the equivalence relation in the set equivalence relation. (Delhi 2009)
A = {0, 1, 2, 3, 4, 5} given by
R = {(a, b) : 2 divides (a – b)}. Write the 13. Check whether the relation R defined in the
equivalence class [0]. (Delhi 2014 C) set {1, 2, 3, 4, 5, 6} as R = {(a, b) : b = a + 1} is
reflexive, symmetric or transitive. (AI 2007)
4. State the reason for the relation R in the set
{1, 2, 3} given by R = {(1, 2), (2, 1)} not to be LA (6 marks)
transitive. (Delhi 2011)
14. Let N denote the set of all natural numbers
SA (4 marks) and R be the relation on N × N defined by
(a, b) R(c, d) if ad(b + c) = bc(a + d). Show that
5. Let A = {1, 2, 3, ..., 9} and R be the relation in R is an equivalence relation. (Delhi 2015)
A × 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 15. 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
equivalence relation. Also obtain the equivalence
equivalence relation. Write all the equivalence
class [(2, 5)]. (Delhi 2014)
classes of R. (AI 2015 C)
6. Let R be a relation defined on the set of natural
numbers N as follow : 1.3 Types of Functions
R = {(x, y) x N, y N and 2x + y = 24}
VSA (1 mark)
Find the domain and range of the relation R.
Also, find if R is an equivalence relation or not. 16. Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let
(Delhi 2014 C) f = {(1, 4), (2, 5), (3, 6)} be a function from A to
B, state whether f is one-one or not. (AI 2011)
7. Show that the relation S in the set R of real
numbers defined as S = {(a, b) : a, b R and 17. What is the range of the function
a b3} is neither reflexive, nor symmetric, nor | x − 1|
f (x ) = ? (Delhi 2010)
transitive. (Delhi 2010) (x − 1)
8. Let Z be the set of all integers and R be the 18. State whether the function f : N N given by
relation on Z defined as R = {(a, b) : a, b Z f(x) = 5x is injective, surjective or both.
and (a – b) is divisible by 5}. Prove that R is an (AI 2008 C)
equivalence relation. (Delhi 2010)
SA (4 marks)
9. Show that the relation S in the set
A = {x Z : 0 x 12} given by 19. Show that f : N N, given by
S = {(a, b) : a, b Z, a – b is divisible by 4} is an x + 1, if x is odd
f (x ) =
equivalence relation. Find the set of all elements x − 1, if x is even
related to 1. (AI 2010) is both one-one and onto. (AI 2012)
4 CBSE Chapterwise-Topicwise Mathematics

20. Let f : N N be defined by 31. If f : R R is defined by

n +1 f(x) = x2 – 3x + 2, find f(f(x)). (AI 2007)
,if n is odd
f (n) = 2 for all n N
n SA (4 marks)
, if n is even
2 32. If the function f : R R be given by f(x)
Find whether the function f is bijective. = x + 2 and g : R
2
R b e g ive n by
(Delhi 2012 C, AI 2009) x
g(x) = , x 1, find fog and gof and hence
21. If f : R R be the function defined by x −1
f(x) = 4x3 + 7, show that f is a bijection. find fog (2) and gof (–3). (AI 2014)
(Delhi 2011 C) 33. Let f : W W, be defined as f(x) = x – 1, if x is
22. Show that the function f : W W defined by odd and f(x) = x + 1, if x is even. Show that f is
n + 1, if n is even invertible. Find the inverse of f, where W is the
f (n) = set of all whole numbers. (Foreign 2014)
n − 1, if n is odd
is a bijective function. (AI 2011 C) 34. Let A = R – {3}, B = R – {1}. Let f : A B be
x −2
defined by f(x) = , for all x A. Then
23. Show that the function f : R R given by x −3
f(x) = ax + b, where a, b R, a 0 is a bijective show that f is bijective. Hence find f–1(x).
function. (Delhi 2010 C) (Delhi 2014 C, 2012)
1.4 Composition of Functions and 35. Let f, g : R R be two functions defined as
f(x) = x + x and g(x) = x – x, for all x R. Then
Invertible Function find fog and gof. (AI 2014 C)
VSA (1 mark) 2
36. Show that the function f in A= R − defined
24. Let f : {1, 3, 4} {1, 2, 5} and g : {1, 2, 5} {1, 3} 3
4x + 3
given by f = {(1, 2), (3, 5), (4, 1)} and as f (x ) = is one-one and onto. Hence
6x − 4
g = {(1, 3), (2, 3), (5, 1)}. Write down gof.
find f –1. (Delhi 2013)
(AI 2014 C)
37. Consider f : R+ [4, ) given by f(x) = x2 + 4.
2x − 7 Show that f is invertible with the inverse f –1 of
25. If f : R R defined as f (x ) = is an
4 f given by f −1 (=
y) y − 4 , where R+ is the set
invertible function, write f –1(x).
(Delhi 2012 C, 2008 C) of all non-negative real numbers. (AI 2013)

26. If f : R R is defined by f(x) = (3 – x3)1/3, then 38. Let A = R – {2} and B = R – {1}. If f : A B is
find fof(x). (AI 2010) x −1
a function defined by f (x ) = , show that
x −2
27. If f : R R is defined by f (x) = 3x + 2, find
f is one-one and onto. Hence find f –1.
f (f (x)). (Delhi 2010 C)
(Delhi 2013 C)
28. If the function f : R R, defined by f (x) = 3x – 4,
39. Let A = R – {3} and B = R – {1}. Consider the
is invertible, find f – 1. (AI 2010C)
x −2
function f : A B defined by f (x ) = .
3x + 5 x −3
29. If f : R R defined by f (x ) = is an Is f one-one and onto ? Justify your answer.
2
invertible function, find f –1. (AI 2009 C) (AI 2012C)
40. Let f : R R be defined as f (x) = 10x + 7. Find
30. If f(x) = x + 7 and g(x) = x – 7, x R, the function g : R R such that gof = fog = IR.
find (fog) (7). (Delhi 2008) (AI 2011)
Relations and Functions 5

x+3 50. Let * be a binary operation on N given by

41. If the function f : R R is given by f (x ) = a * b = L.C.M. (a, b) for all a, b N. Find 5 * 7.
2
and g : R R is given by g(x) = 2x – 3. Find (Delhi 2012)
(i) fog and (ii) gof. Is f –1 = g? (Delhi 2009 C) 51. The binary operation * : R × R R, is defined
42. If f : R R and g : R R are defined as a * b = 2a + b. Find (2 * 3) * 4. (AI 2012)
respectively as f (x) = x 2 + 3x + 1 and 52. If the binary operation * on the set of integers
g(x) = 2x – 3. Find (a) fog (b) gof. Z, is defined by a * b = a + 3b2, then find the
(AI 2009 C, 2008) value of 8 * 3. (AI 2012 C)
43. If f be a greatest integer function and g be an 53. Let * be a binary operation defined on the set
absolute value function, find the value of of integers by a * b = 2a + b – 3. Find 3 * 4.
−3 4 (Delhi 2011 C, AI 2008)
( fog ) + ( gof ) . (Delhi 2007)
2 3
54. Let * be a binary operation defined by
LA (6 marks) a * b = 3a + 4b – 2. Find 4 * 5.
(AI 2011 C, Foreign 2008)
44. Let f : N N be a function defined as
f(x) = 9x2 + 6x – 5. Show that f : N S, where S 55. If the binary operation * on the set of integers
is the range of f, is invertible. Find the inverse of Z is defined by a * b = a + 3b2, then find the
f and hence find f –1(43) and f –1(163). value 2 * 4. (Delhi 2009)
(Delhi 2016)
56. Let * be a binary operation on N given by
45. If f, g : R R be two functions defined as a * b = H.C.F. (a, b); a, b N. Write the value
f(x) = x + x and g(x) = x – x, x R. Then of 22 * 4. (AI 2009)
find fog and gof. Hence find fog (–3), fog (5), and
gof (–2). (Foreign 2016) 57. Let * be a binary operation on set Q of rational
ab
46. Consider f : R+ [−9, [ given by numbers defined as a * b = , write the
5
f(x) = 5x2 + 6x – 9. Prove that f is invertible identity for *, if any. (Delhi 2009 C)
54 + 5 y − 3
with f −1 ( y ) = . (AI 2015) SA (4 marks)
5
58. Let S be the set of all rational numbers except 1
47. Let f : N R be a function defined as
and * be defined on S by a * b = a + b – ab, for
f(x) = 4x2 + 12x + 15. Show that f : N S, where
all a, b S.
S is the range of f, is invertible. Also find the
Prove that
inverse of f. (Foreign 2015, AI 2013 C)
(i) * is a binary operation on S.
1.5 Binary Operations (ii) * is commutative as well as associative.
(Delhi 2014 C)
VSA (1 mark)
59. Consider the binary operations * : R × R R
48. Let * be a binary operation on the set of all and o : R R R defined as a * b = |a – b| and
ab a o b = a for all, a, b R. Show that ‘ * ’ is
non-zero real numbers, given by a * b = for commutative but not associative, ‘o’ is associative
5
all a, b R – {0}. Find the value of x, given that but not commutative. (AI 2012)
2 * (x * 5) = 10. (Delhi 2014)
60. Consider the binary operation * on the set
49. Let * : R × R R, given by (a, b) a + 4b2 is {1, 2, 3, 4, 5} defined by a * b = min (a, b). Write
a binary operation. Compute (– 5) * (2 * 0). the operation table of the operation *.
(AI 2014 C) (Delhi 2011)