HOLIDAY HOME WORK

XII – MATHEMATICS

RELATIONS AND FUNCTIONS

Multiple choice questions

1. If the set A contains 7 elements and the set B contains 8 elements, then number of one-one
and onto mappings from A to B is
(a) 24 (b) 120 (c) 0 (d) none of these

2. Let ( )
(a) one-one (b) onto (c) bijective (d) not defined

3. Set A has 3 elements and the set B has 4 elements. Then the number of injective mappings that can be
defined from A to B is
(a) 144 (b) 12 (c) 24 (d) 64

4. Let the relation R in the set

* + *( ) | | +, then , -, equivalence
class containing 1 is
(a) * + ( )* + ( ) ( )

5. For real numbers √ . then the

relation R is
(a) Reflexive (b) symmetric (c) transitive (d) None of these

6. On the set N of natural numbers , define the relation aRb, iff H.C.F of a and b is 2, then R is
(a) Reflexive but not symmetric (b) symmetric only
(c) Reflexive and transitive (d) Not reflexive, not symmetric , not transitive

7. Let A = * +, then the number of relations containing (1,2) , (1,3) which are reflexive and
symmetric nut not transitive?
(a) 1 (b) 2 (c) 3 (d) 4

8. Let function f : R R be defined by f (x) = 2x + sin x for

(a) one-one and onto (b) one-one but NOT onto
(c) onto but NOT one-one (d) neither one-one nor onto

9. The mapping ( )
(a) one-one onto (b) noto but not one one (c) bijective (d) neither one-one nor onto

10. Let ( )

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

(c) f is onto but not one-one (d) f is neither one-one nor onto
 Short answer type questions

11. Let ( ) ( )

12. Prove that ( ) is one one but not onto.

13. Show that the function ( ) is one-one but not onto

.

14. Find the total number of functions from set A= * + to the set B= * +.

15. Let the function f : R R be defined by f (x) = cosx for all R. Show that f is neither one-one
nor onto.

| |
16. What is the range of the function ( )
( )

17. If A = * + define a relation on A which have properties of being

(a) Reflexive, transitive but not symmetric
(b) symmetric but neither reflexive nor transitive
(c) equivalence relation

18. For the set A = {1, 2, 3}, define a relation R in the set A as follows: R = {(1, 1), (2, 2), (3, 3), (1, 3)}.
Write the ordered pairs to be added to R to make it the smallest equivalence relation.

19. Let A = {a, b, c} and the relation R be defined on A as follows: R = {(a, a), (b, c), (a, b)}. Then,
write minimum number of ordered pairs to be added in R to make R reflexive and transitive.

20. Show that ( ) , -

LONG ANSWER TYPE

21. Let A = * + ( ) | |

22. Let A= R * + { } ( ) a bijective

function.

23. Show that ( ) { is both one-one and onto .

24. Show that the function ( ) is neither one-one nor

onto .

25. Let R be a relation defined on the set of natural numbers N as follow:

R = *( ) +. Find the domain and range of the relation R. Also,
find if R is an equivalence relation or not.
26. Show that the relation R on the set Z of all integers defined
by ( ) ( ) is an equivalence relation .

27. Let A = * + ( ) ( )
for ( )( ) Prove that R is an equivalence relation . Also obtain the equivalence
class ,( )- .

28. Show that the relation R on the set A= * + given by R *( ) | | + is an

equivalence relation .

29. Prove that the function ( )

30. Let N denote the set of all natural numbers and R be that relation on defined by (a,b) R(c,d)
if ad(b+c) = bc(a+d) . Show that R is an equivalence relation .