BHARAT NATIONAL PUBLIC SCHOOL, RAM VIHAR, DELHI
MATHEMATICS DEPARTMENT
Class XII : Assignment of Chapter 1 – Relations and Functions
1. If A is a set of even natural numbers less than 8 and B is a set of prime numbers less than 7, then the
number of relations from A to B is
(a) 29 (b) 92 (c) 32 (d) 29-1
2. The number of reflexive relations on a set A consisting of n elements is equal to
(a) (b) n2 (c) 2n(n-1) (d) n2 – n
3. Two finite sets A and B have n and 2 elements respectively. The total number of relations from A to B
is 56 more than the total number of functions from A to B, then value of n is
(a) 3 (b) 5 (c) 7 (d) 9
4. If a set A and B has 3 and 2 elements respectively, then the number of relations which are not a
functions
(a) 64 (b) 8 (c) 9 (d) 56
5. Let there be a set S consisting n elements. Then the number of functions from S x S S is
(a) n2 (b) nn (c) (d) n2n
6. If the relation R defined on { 1, 2 , 3} be defined as R = { (1,2)} then R is
(a) Reflexive (b) Symmetric (c) Transitive (d) None of these
7. Set A has 3 elements and set B has 4 elements. Then the number of injective functions that can be
defined from set A to set B is
(a) 144 (b) 12 (c) 24 (d) None of these
8. Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}, Then R is
(i) Reflexive but not symmetric (ii) Reflexive but not transitive
(iii) Symmetric and transitive (iv) Equivalence Relations
9. Find the number of all one-one functions from set A = { 1, 2, 3 } to itself.
(a) 3 (b) 9 (c) 4 (d) 6.
ASSERTION AND REASON BASED QUESTIONS
10. ASSERTION: Relation R in the set A of all the books in a library of a college, given by
R = {(x, y) : x and y have same number of pages} is an equivalence relation.
REASON: A relation is said to be equivalence if it is Reflexive, Symmetric and not Transitive relation.
11. ASSERTION: The identify relation on a set A is an equivalence relation.
REASON: The universal relation of a set A is an equivalence relation.
Page 1 of 2
12. Show that f: N N, given by is both one-one and onto.
13. Show that relation R defined on a set A = { x: x Z, 0 12} such that
R = {(a , b), a,b A and is an equivalence relation.
Find the equivalence class of {1}.
14. Show that relation R defined on a set A = { x: x Z, 0 12} such that
R = {(a , b), a,b A and is an equivalence relation
Find the equivalence class of {2}.
15. Show that relation R defined on a set A = { x: x Z, 0 12} such that
R = {(a , b), a,b A and is an equivalence relation.
Find the equivalence class of {5}.
16. Show that relation R defined on a set A = { x: x Z, 0 12} such that
R = {(a , b), a,b A and is an equivalence relation
Find the equivalence class of {3}.
17. If A denote the set { x: x Z, 0 12} and R be the relation on A x A defined as
(a , b) R (c , d), if a + d = b + c. Show that R is an equivalence relation.
Find the equivalence class of {(1, 2)}.
18. If A denote the set { x: x Z, 0 12} and R be the relation on A x A defined as
(a , b) R (c , d), if ad = bc. Show that R is an equivalence relation.
Find the equivalence class of {(1, 3 )}.
19. If N denote the set of all natural numbers and R be the relation on N x N defined as
(a , b) R (c , d), if ad(b + c) = bc(a + d). Show that R is an equivalence relation.
20. Show that the functions f: R R defined by f(x) = for all x R is neither one – one nor onto.
21. Check whether the relation R in R defined by R = {(a, b) : a b2 } is reflexive, symmetric or
transitive using suitable examples.
22. Check whether the relation R in R defined by R = {(a, b) : a b 3} is reflexive, symmetric or
transitive using suitable examples.
23. Check whether the function defined as f : R R : f(x) = 3 – 4x is bijective function
24. Check whether the relation R defined in the set {1,2,3,4,5,6} as R= is reflexive,
symmetric or transitive.
25. Show that the relation R defined as R= is an equivalence relations.
26.let f: , , Show that f is one- one functions.
And also check whether f is onto or not.
Page 2 of 2
