[Class XII : Maths] 1

CHAPTER-1

RELATIONS AND FUNCTIONS

By looking at the the two thermometers shown, you can make some general comparisons
between the scales. For example, many people tend to be comfortable in outdoor tempera-
tures between 50°F and 80°F (or between 10°C and 25°C). If a meteorologist predicts an
average temperature of 0°C (or 32°F), then it is a safe bet that you will need a winter jacket.
Sometimes, it is necessary to convert a Celsius measurement to its exact Fahrenhelt mea-
surement or vice versa.
For example, what if you want to know the temperature of your child in Fahrenheit,
and the only thermometer you have measures temperature in Celsius measurement?
Converting temperature between the systems is a straightforward process. Using the function
9
F = f(C) = C + 32, any temperature in Celsius can be converted into Fahrenheit scale.
5
TOPIC TO BE COVERED AS PER CBSE LATEST CURRICULUM 2024-25
Types of relations: reflexive, symmetric, transitive and equivalence relations.
One to one and onto functions
A relation in a set A is a subset of A × A.
Thus, R is a relation in a set A = R  A × A Relations

If (a, b) R then we say that a is related to b and write, a R b

Functions
If (a, b) in R then we say that a is not related to b and write, a R b.

[Class XII : Maths] 19

 If number of elements in set A and set B are p and q respectively, Means n(A) = p, n(B) = q,
then
2
p
No. of Relation af A × A = 2
2
q
No. of Relation of B × B = 2
No. of Relation of A × B = No. of Relation of B × A = 2pq

p2
No. of NON EMPTY Relation of A × A = ( 2 – 1),

q2
No. of NON EMPTY Relation of B × B = ( 2 – 1).
No. of NON-EMPTY Relation of A × B = No. of Relation of B × A = (2pq – 1)

Q.1 If A = {a, b, c} and B = {1, 2} find the number of Relation R on (i) A × A (ii) B × B (iii) A ×
B
Ans. As n(A) = 3, n(B) = 2, so
No. of Relation R on A × A = 23 × 3 = 29 = 512
No. of Relation R on B × B = 22 × 2 = 24 = 16
No. of Relation R on A × B = 23 × 2 = 28 = 64
Q.2 A = {d, o, e} and B = {22, 23} find the number of Non-empty Relation R on (i) A × A (ii)
B×B
Ans. As n(A) = 3, n(B) = 2, so
No. of Relation Non-empty relations R on A × A = 23 × 3 – 1 = 29 – 1 = 511
No. of Relation Non-empty R on B × B = 22 × 2 –1 = 24 - 1 = 15
Different types of relations
• Empty Relation Or Void Relation
A relation R in a set A is called an empty relation, if no element of A is related to any
element of A and we denote such a relation by .
Example: Let A = {1, 2, 3, 4} and let R be a relation in A, given by R = {(a, b): a + b = 20}.
• Universal Relation
A relation R in a set A is called an universal relation, if each element of A is related to
every element of A.
Example: Let A = {1, 2, 3, 4} and let R be a relation in A, given by R = {(a, b): a + b > 0}.
• Identity Relation
A relation R in a set A is called an identity relation, where R = {(a, a), a  A}.
Example : Let A = {1, 2, 3, 4} and let R be a relation in A, given by R = {(1, 1), (2, 2),
(3, 3), (4, 4)}.

20 [Class XII : Maths]

• Reflexive Relation
A relation R in a set A is called a Reflexive relation, if (a, a)  R, for all a  A.
Example : Let A = {1, 2, 3, 4} and let R be a relation in A, given by
R = {(1, 1), (2, 2), (3, 3), (4, 4)}.
R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 2)}.
R = {(1, 1), (2, 2), (3, 3), (4, 4), (2, 3), (1, 3), (3, 1)}.
• Symmetric Relation
A relation R in a set A is called a symmetric relation, if (a, b)  R, then (b, a) R for all
a, b A.
Example : Let A = {1, 2, 3, 4} and let R be a relation in A, given by
R = {(1, 1), (2, 2), (3, 3)}.
R = {(1, 2), (2, 1), (3, 3)}.
R = {(1, 1), (2, 2), (3, 3), (4, 4), (2, 3), (1, 3), (3, 1), (3, 2)}.
• Transitive Relation
A relation R in a set A is called a transitive relation,
if (a, b)  R and (b, c) R then (a, c) R for all a, b, c  A
Or
(a, b) R and (b, c)  R for all a, b, c  A
Example : Let {1, 2, 3, 4} and let R be a relation in A, given by
R = {(1, 1), (2, 2), (3, 3)}. (According to second condition)
R = {(1, 2), (2, 1), (1, 1), (2, 2)}. (According to first condition)
R = {(2, 3), (1, 3), (3, 1), (3, 2), (3, 3), (2, 2), (1, 1)}.
• Equivalence Relation
A relation R in a set A is said to be an equivalence relation if it is reflexive, symmetric and
transitive.
Illustration:
Let A be the set of all integers and let R be a relation in A, defined by R = {a, b}: a = b}, Prove
that R is Equivalence Relation.
Solution: Reflexivity : Let R be reflexive  (a, a)  R  a A
 a = a, which is true
Thus, R is Reflexive Relation.
Symmetricity : Let (a, b)  R  a, b  A
 a=b
 b=a

[Class XII : Maths] 21

so (b, a)  R. Thus R is symmetric Relation.
Transitivity : Let (a, b)  R and (b, c)  R  a, b, c  A
 a = b and b = c
 a=b=c
 a=c
so (a, c)  R. Thus R is transitive Relation.
As, R is reflexive, Symmetric and transitive Relation
 R is an Equivalence Relation
FUNCTIONS
Functions can be easily defined with the help of concept mapping. Let X and Y be any two
non-empty sets. “A function from X to Y is a rule or correspondence that assigns to each
element of set X, one and only one element of set Y”. Let the correspondence be ‘f’ then
mathematically we write f : X  Y.
where y = f(x), x  X and y Y. We say that ‘y’ is the imagesof ‘x’ under f (or x is the pre image
of y).
• A mapping f : X  Y is said to be a function if each element in the set X has its image in
set Y. It is also possible that there are few elements in set Y which are not the images
of any element in set X.
• Every element in set X should have one and only one image. That means it is impossible
to have more than one image for a specific element in set X.
• Functions cannot be multi-valued (A mapping that is multi-valued is called a relation from
X and Y) eg.

Testing for a function by Vertical line Test

A relation f : A  B is a function or not, it can be checked by a graph of the relation. If it is
possible to draw a vertical line which cuts the given curve at more thatn one point then the
given relation is not a function and when this vertical line means line parallel to Y-axis cuts the
curve at only one point then it is a function. Following figures represents which is not a
function and which is a function.

22 [Class XII : Maths]

 Number of Functions
Let X and Y be two finite sets having m and n elements respectively. Thus each element of
set X can be associated to any one of n elements of set Y. So, total number of functions
from set X to set Y is nm.

Real valued function: if R, be the set of real numbers and A, B are subsets of R, then the
function f : A  B is called a real function or real valued functions.
Domain, Co-Domain And Range of Function
If a function f is defined from a set A to set B then (if : A B) set A is called the domain of f and
set B is called the co-domian of f.
The set of all f-images of the elements of A is called the range of f.
In other words, we can say
Domain = All possible values of x for which f(x) exists.
Range = For all values of , all possible values of f(x).

From the figure we observe that

Domain = A = {a, b, c, d} Range = {p, q, r}, Co-Domain = {p, q, r, s} = B
EQUAL FUNCTION
Two function f and g are said to be equal functions, if and only if
(i) Domain of f = Domain of g
(ii) Co-domain of f = Co-domain of g
(iii) f(x) = g(x) for all x  their common domain

[Class XII : Maths] 23

 TYPES OF FUNCTION
One-one function (injection): A function f : A  B is said to be a one-one function or an
injection, if different elements of A have different images in B.
e.g. Let f : A  B and g : X  Y be two functions represented by the following diagrams.

Clearly, f : A  B is a one-one function. But g : X  Y is not one-one function because two

distinct elements x1 and x3 have the same image under function g.
Method to check the injectivity (One-One) of a function
(i) Take two arbitrary elements x, y (say) in the domain of f.
(ii) Solve f(x) = f(y). If f(x) = f(y) give x = y only, then f : A  B is a one-one function (or an
injection). Otherwise not.
If function is given in the form of ordered pairs and if two ordered pairs do not have same
second element then function is one-one.
If the graph of the function y = f(x) is given and each line parallel to x-axis cuts the given curve
at maximum one point then function is one-one. (Strictly increasing or Strictly Decreasing
Function). E.g.

Number of one-one functions (injections) : If A and B are finite sets having m and n elements
respectively, then number of one-one functions from A and B = nPm is n  m and 0 if n < m.
If f(x) is not one-one function, then its Many-one function.
Onto function (surjection) : A function f : A  B is onto if each element of B has its pre-
image in A. In other words, Range of f = Co-domain of f. e.g. The following arrow-diagram
shows onto function.

24 [Class XII : Maths]

Number of onto function (surjection): If A and B are two sets having m and n elements
n
respectively such that 1  n  m, then number of onto functions from A to B is  (1)
r 1
nr n
C r

. rm
Into function: A function f : A  B is an into function if there exists an element in B having no
pre-image in A.
In other words, f : A  B is an into function if it is not an onto function e.g, The following arrow
diagram shows into function.

Method to find onto or into function:

(i) Solve f(x) = y by taking x as a function of y i.e., g(y)(say).
(i) Now if g(y) is defined for each y  co-domain and g(y)  domain then f(x) is onto and if any
one of the above requirements is not fulfilled, then f(x) is into.
One-one onto function (bijection) : A function f : A  B is a bijection if it is one-one as well
as onto.
In other words, a function f : A  Bis a bijection if
(i) It is one-one ie., f(x) = f(y)  x = y for all x, y A.
(ii) It is onto i.e., for all y  B, there exists x  A such that f(x) = y.
Clearly, f is a bijection since it is both injective as well as surjective.
Illustration :
Let f : R  R be defined as f(x) = 7x – 5, then show that function is one-one and onto Both.
Solution : Let f(x) = f(y)  x, y R
 7x – 5 = 7y – 5

[Class XII : Maths] 25

  x = y, so f(x) is one-one function
Now, As f(x) = 7x – 5, is a polynomial function.
so it is defined everywhere. Thus, Range = R
As, Range = co-domain, so f is onto function.
Alternative method : Graph of f(x) is a line which is strictly increasing for all values of x, so
its one-one function and Range of f(x) is R which is equal to R so onto funclion.

ILLUSTRATION:
If f :X  Y is defined, then show that f is neither one-one nor onto function.

Solution : As for elements 3 and 4 from set X we have same image c in set Y, so f is not
one-one function.
Further element d has no pre -image in set X,
so f is not onto function

ILLUSTRATION:
Prove that the function f : N  N, defined by f(x) = x2+ x + 2022 is one-one.
SOLUTION : APPROACH-I

Let f(x1) = f(x1)  x1, x2  N  = x12 + x1 + 2022 = x22 + x2 + 2022

 x 12 + x 1 = x 22 + x 2
 (x12 – x22) + (x1 – x2) = 0
 (x1 – x2) + (x1 + x2+ 1) = 0
Thus,(x1 – x2) = 0 as (x1 + x2 + 1)  0  x1, x2  N
so, f is ONE-ONE function
APPROACH-II
f(x) = x2 + x + 2022  f (x) = 2x + 1
As, x  N so, 2x + 1 > 0  f (x) = 0 (Strictly Increasing function)
so, f is ONE-ONE function

26 [Class XII : Maths]

 Type of Functions
Name of Definition Domain Range Graph
Function

1. Identify R R
Function The function f : R  R defined by
f(x) = x  x  R

2. Constant The function f : R  R defined by R (c)

Function f(x) = c  x  R

3. Polynomial The function f : R  R defined by

Function f(x) = p0 + p1x + p2x2 + ... + pnxn,
where n  N and p0, p1, p2 ..., pn
 R  x  R
4. Rational The function f defined by f(x) =
Function P( x )
, where P(x) and Q(x) are
Q( x )
polynomial functions, Q(x) 0

5. Modulus The function f : R  R defined by

R [0, )
Function  x, x  0
f(x) = |x| =   x R
  x, x  0

6. Signum The function f : R  R defined by

R {–1, 0, 1}
Function
| x |  1, x  0
 , x0 
f(x) =  x  1, x 0
 0, 
x  0 0, x  0

7. Greatest The function f : R  R defined by R Z
Integer
Function  x, x  Z

f(x) = |x| = integer less than
equal to x, x  Z


8. Linear The function f : R  R defined by R R

Function f(x) = mx + c, x  R where m and
c are constants

[Class XII : Maths] 27

 ONE–MARK QUESTIONS
EACH OF THE FOLLOWING MCQ HAS ONE OPTION CORRECT, CHOOSE THE COR-
RECT ALTERNATIVE
1. Consider the set A = {1, 2, 3}, then write smallest equivalence relation on A.
(a) { } (b) {(1, 1)} (c) {(1, 1), (2, 2), (3, 3)} (d) {(3, 3)}
2. Consider the set A containing 5 elements, then the total number of injective functions
from A onto itself are
(a) 5 (b) 25 (c) 120 (d) 125
3. Let Z be the set of integers and R be the relation defined in Z such that aRb if (a – b) is
divisible by 4, then R partitions the set Z into how many Pairwise disjoint subsets.
(a) 2 (b) 3 (c) 4 (d) 5
4. If A = {d, 0, e} then the number of relations on A × A are
(a) 3 (b) 8 (c) 15 (d) 512
5. If A = {2023, 2024) then the number of non-empty relations on A × A are
(a) 1 (b) 4 (c) 15 (d) 16
6. If A = {2023, 2024) then the number of Reflexive relations on A × A are
(a) 2 (b) 4 (c) 8 (d) 16
7. If A = {s, u, v}, then the number of Symmetric relations on A × A are
(a) 8 (b) 9 (c) 32 (d) 64
8. Let A be the set of the Letters of the name of our country the “INDIA”. Then find the
number of reflexive relations on A × A
(a) 4096 (b) 2048 (c) 1024 (d) 16
9. Let A = {x : x < 3, x W}, then the number of Symmtric relations on A × A are
2

(a) 1 (b) 2 (c) 4 (d) 8

10. If there are ‘p’ elements in set A, such that number of Reflexive relation on A × A are 4096,
then p =
(a) 4 (b) 6 (c) 8 (d) 12
11. Let A = {d, 0, e}, then Find ‘p’ if the number of Symmetric relations on A × A are 2p.
(a) 4 (b) 6 (c) 8 (d) 12
12. Find the maximum number of equivalence relations on the set A = {1, 2, 3}.
(a) 3 (b) 5 (c) 8 (d) 9

x2
13. If the function f : R — {1, –1}  A defined by f (x )  is Surjective, then A =
1 x 2
(a) R (b) R — {1, – 1} (c) [0, 1) (d) [0, ]
14. The number of injections possible from A = {1, 2, 3, 4} to B = {5, 6, 7} are
(a) 0 (b) 3 (c) 6 (d) 12

28 [Class XII : Maths]

15. If the number of one-one functions that can defined from A = {4, 8, 12, 16} to B is 5040,
then n(B) =
(a) 7 (b) 3 (c) 6 (d) 10
16. If the function f : R  A defined by f(x) = 3 sin x + 4cos x is Surjective, then A =
(a) [–7, 7] (b) [–1, 1] (c) [1, 7] (d) [–5, 5]
17. The Part of the graph of a Non-Injective function f : R  Range defined by f(x) = x2 –2x +
a is given below. If the domain of f(x) is modified as either (–, b] or [b, ] then f(x)
becomes the Injective function. What must be the value of (b – a).
(a) 6 (b) 5 (c) 4 (d) 0

18. The graph of the function f : R  A defined by y = f(x) is given below, then find A such that
function f(x) is onto function
(a) [–1, 5] (b) [–5, 5] (c) [–5, 1] (d) R

ASSERTION-REASON BASED QUESTIONS (Q.19 & Q.20)

In the following questions, a statement of assertion (A) is followed by a statement of Reason
(R). Choose the correct answer out of the following choices.
(a) Both A and R are true and R is the correct explanation of A.
[Class XII : Maths] 29
(b) Both A and R are ture but R is not the correct explanation of A.
(c) A is true but R is false
(d) A is false but R is true
19. ASSERTION (A) : A relation R = {(a, b) : |a – b| < 1} defined on the set
A = {1, 2, 3, 4} is Reflexive
Reason (R) : A realtion R on the set A is said to be reflexive if for (a, b)  R
& (b, c)  R, we have (a, c) R.
20. Assertion (A) : A function f : R  R given f(x) = |x| is one-one function.
Reason (R) : A function f : A  B is said to be Injective if
f(a) = f(b)  a = b

TWO MARKS QUESTIONS

21. If A = {a, b, c, d} and f = {(a, b), (b, d), (c, a), (d, c)}, show that f is one-one from A to A.
22. Show that the relation R on the set of all real numbers defined as R = {(a, b) : a  b3} is
not transitive.

x2
23. If the function f : R – {1, –1}  A defined by f ( x )  , is Surjective, then find A.
1  x2

24. Give an example to show that the union of two equivalence relations on a set A need not
be an equivalence relation on A.
25. How many reflexive relations are possible in a set A whose (A) = 4. Also find How many
symmetric relations are possible on a set B whose n(B) = 3.
26. Let W denote the set of words in the English dictionary. Define the relation R by R {(x, y)
W × W such that x and y have at least one letter in common). Show that this relation R
is reflexive and symmetric, but not transitive.
27. Show that the relation R in the set of all real numbers, defined as R = {(a, b): a  b2} is
neither reflexive Nor symmetric.
28. Consider a function f : R+ (7, ) given by f(x) = 16x2 + 24x + 7, where R+ is the set of
all positive real numbers. Show that function is one-one and onto both.
29. Let L be the set of all lines in a plane. A relation R in Lis given by R {(L1, L2): L1 and L2
intersect at exactly one point, L1, L2  L}, then show that the relation R is symmetric Only.
30. Show that a relation R on set of Natural numbers is given by R = {(x, y): xy is a square of
an integer} is Transitive.

THREE MARKS QUESTIONS

31. Are the following set of ordered pairs functions? If so, examine whether the mapping is
injective or surjective.
(i) {(x, y) : x is a person, y is the mother of x}.

30 [Class XII : Maths]

 (ii) {(a, b): a is a person, b is an ancestor of a}.

x2
32. Show that the function f : R  R defined byf(x) = ; x  R, is neither one-one nor
x2  1 
onto.
33. Let R be the set of real numbers and f : R R be the function defined by f (x) = 4x + 5.
Show that f is One-one and onto both.
34. Show that the relation R in the set A = {3, 4, 5, 6, 7} given by R = {(a, b) : |a – b| is divisible
by 2} is an equivalence relation. Show that all the elements of {3, 5, 7} are related to each
other and all the ements of {4, 6} are related to each other, but no element of {3, 5, 7} is
related to any element {4, 6}.
35. Check whether the relation R in the set Z of integers defined as R = ((a, b) : a + b is
"divisible by 2"} is reflexive, symmetric, transitive or Equivalence.
36. Show that that following Relations R are equivalence relation in A.
(a) Let A be the set of all triangles in a plane and let R be a relation in A, defined by
R = {(T1, T2) : T1, is congruent T2}
(b) Let A be the set of all triangles in a plane and let R be a relation in A, defined by
R = {(T1, T2) : T1, is similar T2,}
(c) Let A be the set of all lines in xy-plane and let R be a relation in A, defined by
R = {(L1, L2,) : L1, is parallel to L2}
(d) Let A be the set of all integers and let R be a relation in A, defined by
R = {(a, b) : (a – b) is even}
(e) Let A be the set of all integers and let R be a relation in A, defined by
R = {(a, b) : |a – b| is a multiple of 2}
(f) Let A be the set of all integers and let R be a relation in A, defined by
R = {(a, b) : |a – b| is a divisible by 3}
37. Check whether the following Relations are Reflexive, Symmetric or Transitive.
(a) Let A be the set of all lines in xy-plane and let R be a relation in A, defined by
R = {(L1, L2) : L1 is perpendicular to L2}
(b) Let A be the set of all real numbers and let R be a relation in A defined by
R = {(a, b): a  b}
(c) Let A be the set of all real numbers and let R be a relation in A defined by
R = {(a, b): a  b2}
(d) Let A be the set of all real numbers and let R be a relation in A defined by
R = {(a, b) : a  b3}
(e) Let A be the set of all natural numbers and let R be a relation in A defined by

[Class XII : Maths] 31

 R = (a, b) : a is a factor b}
OR
R {(a.b): b is divisible by a}
(f) Let A be the set of all real numbers and let R be a relation in A defined by
R {(a.b): (1+ ab) > 0}
38. Let S be the set of all real numbers. Show that the relation R = {a, b): a2 + b2 = 1} is
symmetric but neither reflexive nor transitive.
39. Check whether relation R defined in R as R = {a, b): a2 – 4ab + 3b2 = 0, a, b R} is
reflexive, symmetric and transitive.

x
40. Show that the function f : (–, 0) (–1, 0) defined by f(x) = , x (–, 0) is one-
1 | x |
one and onto.
FIVE MARKS QUESTIONS

41. For real numbers x and y, define x R y if and only if x – y + 2 is an irrational number..
Then check the reflexivity, Symmetricity and Transitivity of the relation R.
42. Determine whether the relation R defined on the set of all real numbers as
R = {(a, b) : a, b R and a – b + 3  S}
(Where S is the set of all irrational Numbers) is reflexive, symmetric or transitive.
43. Let N be the set of all natural numbers and let R be a relation on N × N, defined by Show
that R is an equivalence relation.
(i) (a, b) R (c, d)  a + d = b + c
(ii) (a, b) R (c, d)  ad = bc
1 1 1 1
(iii) (a, b) R (c, d)    
a d b c
(iv) (a, b) R (c, d)  ad (b + c) = bc (a + d)
x2
44. Let A = R – {1}, f : A  A is a mapping defined by f(x) = , show that f is one-one and
x 1
onto.
45. Let f : N  R be a function defined as f(x) = 4x2 + 12x+ 15. Show that f : N  S, where
S is the range of f, is One-One and Onto Function.
CASE STUDIES
A. A person without family is not complete in this world because family is an integral part of
all of us Human deings are considered as the social animals living in group called as
family. Family plays many important roles throughout the life.
Mr. D.N. Sharma is an Honest person who is living happily with his family. He has a son
Vidya and a Daughter Madhulika. Mr. Vidya has 2 sons Tarun and Gajender and a daugh-
ter Suman while Mrs. Madhulika has 2 sons Shashank and Pradeep and 2 daughters
Sweety and Anju. They all Lived together and everyone shares equal responsibilities

32 [Class XII : Maths]

 within the family. Every member of the family emotionally attaches to each other in their
happiness and sadness. They help each other in their bad times which give the feeling of
security.
A family provides love, warmth and security to its all members throughout the life which
makes it a complete family. A good and healthy family makes a good society and ulti-
mately a good society involves in making a good country.

On the basis of above information, answer the following questions:

Consider Relation R in the set A of members of Mr. D. N. Sharma and his family at a particular
time
(a) If R = {(x, y) : x and y live in the same locality), then R show that R is reflexive Relation.
(b) If R = {(x, y) : x is exactly 7 cm taller than y}, then R show that R is not Symmetric
relation.
(c) If R = {(x, y) : x is wife of y}, then show that R is Transitive only.

B. Let A be the Set of Male members of a Family, A = (Grand father, Father, Son) and B be
the set of their 3 Cars of different Models, B = {Model 1, Model 2, Model 3}

On the basis of The above Information, answer the following questions:

(a) If m & n represents the total number of Relations & functions respectively on A × B,
then find the value of (m + n).
(b) If p & q represents the total number of Injective function & total numbers of Surjective
functions respectively on A × B, then find the value of |p – q|.
C. An organization conducted bike race under two different categories—Boys & Girls.
There were 28 participants in all. Among all of them finally three from category 1 and
two from category 2 were selected for the final race. Ravi forms two sets B and G with

[Class XII : Maths] 33

 these Participants for his college Project.
Let B = {b1, b2, b3} and G = {g1, g2}, represents the set of Boys selected & G the set
of Girls selected for the final race.

(a) How many relations are possible from B to G?

(b) Among all possiblerelations form B to G, how many functions can be formed from B
to G?
(c) Let R:B  B be defined by
R = {(x, y) : x & y are students of same sex}. Check R is equivalence Relation.
OR
A function f : B  G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}
Check if f is bijective. Justify your answer.

SELF ASSESSMENT-1

EACH OF THE FOLLOWING MCQ HAS ONE OPTION CORRECT, CHOOSE THE COR-
RECT ALTERNATIVE:

1. Consider the set A = {1. 2, 3} and R be the smallest equivalence relation on A.then R =

(a) {(1.1)} (b) {(1,1), (2,2)}

(c) {(1,1),(2,2),(3,3)} (d) 

2. Consider the set A containing n elements. Then, the total number of injective functions
from A onto itself is

(a) 2n (b) n

(c) n (d) n!

3. The total number of injective nappingsfrom a set with m elements to a set with n elements,
m  n is

(a) n! (b) nm

n!
(c) mn (d) (n  m )!
34 [Class XII : Maths]
4. The number of injections possible from A = {1,3,5,6} to B = {2,8,11} is

(a) 12 (b) 22

(c) 3 (d) 0

5. The number of one-one functions that can defined from

A = {4,8,12,16} to B is 5040, then n(B) =
(a) 7 (b) 8
(c) 9 (d) 10

SELF ASSESSMENT-2
EACH OF THE FOLLOWING MCQ HAS ONE OPTION CORRECT CHOOSE THE COR-
RECT ALTERNATIVE.
1. A relation R in a set A is called .............. if (a1, a2) R implies (a2, a1) R, for all a1, a2 
A.
(a) Reflexive (b) Symmetric
(c) Transitive (d) Equivalence

1
2. Let f : R – {0}  R – {0} be defined by f(x) =  x  R. Then f is
x
(a) One-One (b) Many-One
(c) Not defined (d) None of these
3. Let P = {(x, y) | x + y = 1, x, y R}. Then P is
2 2

(a) Re flexive (b) Symmetric

(c) Transitive (d) Equivalence
4. The function f : R  R defined by f(x) = [x], where [.] is greatest integer function is
(a) One-One (b) Many -One
(c) Onto (d) None of these
5. The number of bijective functions (One-one and onto both) from set A to itself when A
contains 2022 elements is
(a) 2022 (B) 2022!
(C) 2022 2
(D) 20222022

[Class XII : Maths] 35

 ANSWER
One Mark Questions
1. (c) {(1,1), (2,2), (3,3)} 2. (c) 120 3. (c) 4
4. (d) 512 5. (c) 15 6. (b) 4
7. (d) 64 8. (a) 4096 9. (d) 8
10. (a) 4 11. (b) 6 12. (b) 5
13. (c) [0,1) 14. (a) 0 15. (d) 10
16. (d) [-5,5] 17. (a) 6 18. (a) [-1,5]
19. (c) 20. (d)
A is true but R is false A is false but R is true
Two Mark Questions
23. A = R – [–1, 0)
25. Reflexive Relations = 4096 Symmetric Relation = 64
Three Mark Questions
31. (a) Yes it’s function, Not Injective but Surjective (b) No, its not a function
35. EQUIVALENCE RELATION
37. (a) Symmetric (b) Reflexive and Transitive
(c) Neither Reflexive, Symmetric nor Transitive
(d) Neither Reflexive, Symmetric nor Transitive
(e) Reflexive and Transitive
(f) Reflextive and Symmetric
39. Reflexive only
Four/Five Mark Questions
41. Reflexive only 42. Reflexive only
CASE STUDIES BASED QUESTION
B. (a) 512 +27 =539 B. (b) 0
C. (a) 64
(b) 8
(c) R is an Equivalence Relation OR (c) f is not Bijective
SELF ASSESSMENT-1
1. (c) 2. (d) 3. (d) 4. (d) 5. (d)
SELF ASSESSMENT-2
1. (b) 2. (a) 3. (b) 4. (b) 5. (b)

36 [Class XII : Maths]