CBSE

RELATION AND FUNCTIONS WS 1

Class 12 - Mathematics

Section A
[1]
1. Let f :

then, f is

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

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

2. The function f(x) = from R to [0, ) is [1]

a) one-one and onto b) an identity function

c) one-one and into d) a constant function

3. A function f: X Y is said to be one – one and onto if [1]

a) f is one – one b) f is onto

c) f is both one – one and onto d) f is either one – one or onto

4. Let f : R R defined by f(x) = then [1]

a) f(x) is one-one and onto b) f(x) is one-one but not onto

c) f(x) is neither one-one nor onto d) f(x) is many one but onto
5. Let f : R - {n} R be a function defined by , where m n. Then, [1]

a) f is many one into b) f is one-one onto

c) f is one-one into d) f is many one onto

6. The function f : R R defined as f(x) = x2 is [1]

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

c) onto d) one-one

7. Let f : R R be given by f (x) = [x]2 + [x + 1] - 3, where [x] denotes the greatest integer less than or equal to x. [1]
Then, f (x) is

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

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

8. The function f : X Y defined by f(x) = sin x is one-one but not onto, if X and Y respectively equal to [1]

a) [0, ] and [0, 1] b) and [-1, 1]

c) and [-1, 1] d) R and R

9. Let f: (-1, 1) B where f(x) = is one-one and onto, then B equals [1]

1/7
 a) b)

c) d)
10. Which of the following functions from to itself are bijections? [1]

a) h(x) = |x| b) k(x) = x2

c) d)

11. Let X = {x2 : x N} and the relation f : N X is defined by f(x) = x2, x N. Then, this function is [1]

a) not bijective b) injective only

c) surjective only d) bijective

12. f: [-1, 1] : f(x) = sin x is [1]

a) many one and into b) one one and into

c) many one and onto d) one one and onto

13. f:R R : f (x) = x2 is [1]

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

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

14. The function f : Z Z defined by f(x) = x + 2 is ________. [1]

a) surjective b) onto

c) bijective d) one-one
15. Let N be the set of natural numbers and the function f : N N be defined by f (n) = 2n + 3 n N. Then f is [1]

a) surjective and bijective b) bijective

c) surjective d) injective
16. The function f : R R, given by f(x) = is [1]

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

c) one-one d) onto
17. The function f : N N given f(x) = 2x is [1]

a) surjective b) many-one

c) bijective d) injective

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

a) b)

c) d)

19. A mapping f : n N, where N is the set of natural numbers is defined as f(n) = for n [1]

N. Then, f is

a) bijective b) neither injective nor surjective

c) injective but not surjective d) surjective but not injective

[1]

2/7
20. Let f : Z Z be given by . Then f is

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

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

21. f:R R given by is [1]

a) none of these b) bijective

c) injective d) surjective
22. Assertion (A): Let A and B be sets. Then, the function f : A B B A such that f(a, b) = (b, a) is bijective. [1]
Reason (R): A function f is said to be bijective, if it is both one-one and onto.

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.

23. Assertion (A): The f : R R given by f(x) = [x] + x is one-one onto. [1]
Reason (R): A function is said to be one-one and onto, if each element has unique image and range of f(x) is
equal to codomain of f(x).

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.

24. Assertion (A): Let A = {1, 5, 8, 9}, B = {4, 6} and f = {(1, 4), (5, 6), (8, 4), (9, 6)}, then f is a bijective function. [1]
Reason (R): Let A = {1, 5, 8, 9}, B = {4, 6} and f = {(1, 4), (5, 6), (8, 4), (9, 6)}, then f is a surjective function.

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.

[1]
25. Assertion (A): A function f: N N be defined by for all n N; is one-

one.
Reason (R): A function f: A B is said to be injective if a b then f(a) f(b).

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.

26. Assertion (A): f(x) = 1 + x2 is a one to one function from R+ R. [1]

Reason (R): Every strictly monotonic function is a one to one function.

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.

27. Assertion (A) Let f : R R be defined by f(x) = x2 + 1. Then, pre-images of 17 are 4. [1]
Reason (R): A function f : A B is called a one-one function, if distinct elements of A have distinct images in
B.

3/7
 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.

28. Assertion (A): A function f: Z Z defined as f(x) = x3 is injective. [1]

Reason (R): A function f: A B is said to be injective if every element of B has a pre-Image in A.

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.

29. Assertion (A): The modulus function f : R R given by f(x) = |x| is neither one-one nor onto. [1]

Reason (R): The signum function f : R R given by f(x) = is bijective.

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.

30. Assertion (A): The function f : R* R* defined by is one-one and onto, where R* is the set of all [1]
non-zero real numbers.
Reason (R): The function g : N R* defined by is one-one and onto.

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.

31. Assertion (A): Let A ={2, 4, 6} and B = {3, 5, 7, 9} and defined a function f = {(2, 3), (4, 5), (6, 7)} from A to [1]
B. Then, f is not onto.
Reason (R): A function f : A B is said to be onto, if every element of B is the image of some elements of A
under f.

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.

32. Assertion (A): The Greatest Integer Function f: R R, given by f(x) = [x] is one-one. [1]
Reason (R): A function f: A B is said to be injective if f(a) = f(b) a = b.

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.

33. Assertion (A): The function f : R R given by f(x) = x3 is injective. [1]

Reason (R): The function f : X Y is injective, if f(x) = f(y) x = y for all x, y X.

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.

4/7
34. Fill in the blanks: [1]
(a) A function f : X Y is said to be a ________ function, if the images of distinct elements of X under [1]
f are distinct.
35. The diagram is given below shows that [1]

a) f is not a function b) f is a function from A to B.

c) f is a bijection function from A to B d) f is a one - one function from A to B

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

37. Show that the function f : N N : f(x) = x3 is one - one into [1]
38. Let the function f : R R be defined by f(x) = 4x - 1, x R. Then, show that f is one-one. [1]
39. If f = {(1, 2), (2, 4), (3, 1), (4, k)} is a one-one function from set A to A, where A = {1, 2, 3, 4}, then find the [1]
value of k.
40. Show that the function f : R R : f(x) = x5 is one-one and onto. [1]

41. Show that the function f : Z Z : f(x) = x2 is many one into [1]
42. 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.
43. Show that a one – one function f : {1, 2, 3} {1, 2, 3} must be onto. [1]
44. Show that the function f : R R : f(x) = x4 is many-one and into. [1]
45. Let A be the set of all 50 students of Class X in a school. Let f : be function defined by f(x) = roll [1]
number of the student x. Show that f is one-one but not onto.
46. 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]
47. Let f: R R be defined as f(x) = x4. check whether the given function is one - one onto, or other. [1]
48. Show that the Signum function f :R R, given by [1]

is neither one-one nor onto.

49. Determine whether the function f : A B defined by f(x) = 4x + 7, x is one-one. Show that no two elements [1]
in domain have same image in codomain.
Section B
50. State True or False: [2]
(a) Let A be a finite set. Then, each injective function from A into itself is not surjective. [1]
(b) A function which is not one-one, is known as many-one function. [1]
51. Let X = {1, 2, 3} and Y = {4, 5}. Find whether the subset of X Y given at the end is a function from X to Y or [2]
not.
k = {(1,4), (2, 5)}.
52. 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.
53. 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- [2]

5/7
 one.
54. Let f:R R be define as f(x) = x4 check whether the given function is one – one onto, or other. [2]

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

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

57. Let f : N N be defined by Show that f is a bijection. [2]

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

59. Let A = [–1, 1]. Then, discuss whether the function defined on A by : k(x) = x2 [2]
is one-one, onto or bijective.
60. State whether the function is one – one, onto or bijective f: R R defined by f(x) = 1+ x2 [2]
61. Show that the function f: N N given by f (1) = f (2) = 1 and f (x) = x - 1, for every x > 2, is onto but not one- [2]
one.
62. Let X = {1, 2, 3} and Y = {4, 5}. Find whether the subset of X Y given is a function from X to Y or not. [2]
g = {(1, 4), (2, 4), (3, 4)}
63. Let X = {1, 2, 3}and Y = {4, 5}. Find whether the subset of X Y given at the end is a function from X to Y or [2]
not.
h = {(1,4), (2, 5), (3, 5)}
Section C
64. State whether the function is one – one, onto or bijective f: R to R defined by f(x) = 3 – 4x [3]
[3]
65. Show that the Signum Function f : R R, given by is neither one-one nor onto.

Section D
Question No. 66 to 69 are based on the given text. Read the text carefully and answer the questions: [4]
Consider the mapping f : A B is defined by f(x) = such that f is a bijection.
66. What is the domain of the function f(x)?
67. What is the range of the function f(x)?
68. If g(x) : R - {2} R - {1}, How can the function g(x) in terms of x be expressed if it is defined as g(x) = 2f(x) - 1?
69. Under what condition is a function f(x) considered to be one-one?
Section E
Question No. 70 to 74 are based on the given text. Read the text carefully and answer the questions: [5]
Consider the mapping f : A B is defined by f(x) = such that f is a bijection.
70. Domain of f is

a) R - {0} b) R - {2}

c) R - {1, 2} d) R
71. Range of f is

a) R b) R - {1, 2}

c) R - {1} d) R - {0}
72. If g : R - {2} R - {1} is defined by g(x) = 2f{x} - 1, then g(x) in terms of x is

a) b)

6/7
 c) d)
73. The function g defined above, is

a) one-one b) one-into

c) into d) many-one
74. 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) f(-x1) = f(-x2) -x1 - x2

7/7