MATHEMATICS CLASS : XII Code : 12M-01

Chapter : Relations & Functions

Time : 1 hr. MM : 30
INSTRUCTIONS : I. All questions are compulsory.
II. The question paper consists of 13 questions. Qs. 1 to 8 are of 1 mark each, Qs. 9 to 12 are of 4 marks each and
Q. 13 is of 6 marks.
III. There is no overall choice. However, internal choice has been provided in 02 questions of four marks each and
01 question of six marks. You have to attempt only one in all such questions.
IV. Although space has been provided after each question, the student may ask for additional sheet if required.

1. If R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} be a relation in set 4. Prove that f : R ® R, given by f (x) = 2x, is one-one and
onto.
A = {1, 2, 3, 4}. Is the relation R is symmetric?

2. The relation R is defined on the set of natural numbers as

{(a, b) : a = 2b}, then find R –1.

3. Show that the relation R on the set A = {1, 2, 3} given by

R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor
transitive.
 2 CPT — Relations & Functions
5. If f (x) = x + 7 and g(x) = x – 7, x Î R, find (fog) (7).

6. Let f : R ® R and g : R ® R be two functions such that

fog (x) = sin x2 and gof (x) = sin2 x. Then, find f (x) and
g(x).

10. Show that the modulus function f : R ® R , given by

f (x) = | x | is neither one-one nor onto.
OR
Let A = R – {2} and B = R – {1}. If f : A ® B is a mapping
7. Write the inverse of the function f (x) = 5x + 7, x Î R.
x -1
defined by f ( x) = , show that f is bijective.
x-2

8. Let * be a binary operation on N given by a * b = l.c.m

(a, b), a, b Î N. Find (2 * 3) * 6.

9. Show that the relation R on the set A of all the books in a

library of a college, given by
R = { (x, y): x and y have the same number of pages}, is an
equivalent relation.
MATHEMATICS 3

3
11. Show that f : R – {0} ® R – {0} given by f (x) = is
x
invertible and it is inverse of itself.

12. Let f : N ® Y be a function defined as f (x) = 4x + 3, where

Y : {y Î N : y = 4x + 3 for some x Î N}. Show that f is
invertible. Find its inverse.
OR
x
Show that f : R – {–1} ® R – {1} given by f (x) = is
x +1
invertible. Also, find f –1.
 4 CPT — Relations & Functions

13. Let A = N × N and '*' be a binary operation on A defined by

(a, b) * (c, d) = (ac, bd) for all a, b, c, d Î N.
Show that '*' is commutative and associative binary
operation on A.
OR
Define a binary operation * on the set A = {0, 1, 2, 3, 4, 5}
as a * b = a + b (mod 6)
Show that zero is the identity for this operation and each
element a of the set is invertible with 6 – a being the
inverse of a.