0% found this document useful (0 votes)
72 views5 pages

DPP (English) - Relations and Functions

Uploaded by

karamchd98
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
72 views5 pages

DPP (English) - Relations and Functions

Uploaded by

karamchd98
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

BOARD DPP

RELATIONS, FUNCTIONS & ITF

Section - A
Multiple Choice Questions

1. The relation R in the set {1, 2, 3} given by R = {(1,1), (2,2), (3,3), (1,2), (2,3)} is
(A) reflexive but neither symmetric nor transitive
(B) reflexive, symmetric but not transitive
(C) symmetric but neither reflexive nor transitive
(D) an equivalence relation

2. The relation R defined in the set


A = {1, 2, 3, 4, 5, 6, 7} by
R = {(a, b) : both a and b are either odd or even}. Then, R is
(A) symmetric (B) transitive
(C) an equivalence relation (D) reflexive

3. Let A = {x  Z : 0  x  10} and relation A × A is defined as


R = {(a, b) : a, b  A, |a – b| is divisible by 3}.
Find the equivalence class of [2]
(A) {2, 5, 8} (B) {0, 3, 8} (C) {3, 6, 9} (D) None of these

4. 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)}
Then, the ordered pair to be added to R to make it the smallest equivalence relation is
(A) (1, 3) (B) (3, 1) (C) (2, 1) (D) (1, 2)

5. Let A = {a, b, c} and the relation R be defined on A as R = {(a, a), (b, c), (a, b)}. Then, find
minimum number of ordered pairs to be added in R to make R reflexive and transitive.
(A) 3 (B) 4 (C) 2 (D) 1

6. let the function ƒ : N → N be defined by ƒ (x) = x – 1, x > 2 and ƒ(1) = ƒ(2) = 1.


The correct alternative will be
(A) ƒ is one-one onto (B) ƒ is many one onto
(C) ƒ is one-one but not onto (D) ƒ is many onto but not onto.

7. Let A = {1, 2, 3} and B = {4, 5, 6, 7} and let ƒ = {(1,4), (2,5), (3,6)} be a function from A to
B. Then ƒ is
(A) one-one (B) onto (C) many-one (D) bijective

8. The function ƒ : R → R defined by ƒ(x) = x2 + x is


(A) one-one (B) onto (C) many-one (D) None of these

Corporate Office : Motion Education Pvt. Ltd., 394 - Rajeev Gandhi Nagar, Kota 8003899588 | Page # 1
BOARD DPP MATHS

9. On the set of integers Z, define


x
 , x is even
ƒ : Z → Z as ƒ(x) =  2
 0, x is odd

Then, ƒ is
(A) injective but not subjective (B) neither injective nor surjective
(C) surjective but not injective (D) bijective

10. The inverse of cosine function is defined in the intervals


 −     
(A)  −, 0  (B)  , 0  (C) 0,  (D)  ,  
2   2 2 

  1 
11. sin  − sin−1  −   is equal to
3  2 
(A) 1/2 (B) 1/3 (C) 1/4 (D) 1

12. (
The value of tan−1 − cot −1 − 3 ) is equal to

 −
(A) (B) (C) 0 (D) 
2 2

ASSERTION-REASONING QUESTIONS
Note : In the following questions a statement of assertion followed by a statement of reason is
given. Choose the correct answer out of the following choices.
(A) Assertion and reason both are true, reason is correct explanation of assertion.
(B) Assertion and reason both are true but reason is not the correct explanation of assertion.
(C) Assertion is true, reason is false.
(D) Assertion is false, reason is true.

13. Assertion (A) The relation R in the set A = {1, 2, 3, 4, 5, 6} defined as R = {(x, y) : y is divisible
by x} is not an equivalence relation.
Reason (R) The relation R will be an equivalence relation, if it is reflexive, symmetric and
transitive.

14. Assertion (A) If A = {x  z : 0  x  12} and R is the relation in A given by R = {(a, b) : a = b.


Then, the set of all elements related to 1 is {1, 2}
Reason (R) If R1 and R2 are equivalence relation in a set A, then R1  R 2 is an equivalence
relation.

15. If R is the relation in the set A = {1, 2, 3, 4, 5} given by R = {(a, b): |a – b| is even},
Assertion (A) R is an equivalence relation.
Reason (R) All elements of {1, 3, 5} are related to all elements of {2, 4}.

16. Assertion (A) Let a relation R defined from set B to B such that B = {1, 2, 3, 4} and
R = {(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)}, then R is transitive.
Reason (R) A relation R in set A is called transitive,
if (a, b)  R and (b, c)  R  (a, c)  R,  a, b, c  A

Corporate Office : Motion Education Pvt. Ltd., 394 - Rajeev Gandhi Nagar, Kota 8003899588 | Page # 2
BOARD DPP MATHS

Section - B
2 Marks Questions

17. Let a relation R on the set of real number be defined as (a, b)  R  1 + ab > 0 for all a, b  S.
Show that R is reflexive and symmetric but not transitive.

x
18. Show that the function f : R → R, defined by f ( x ) = 2
, x  R is neither one-one nor onto.
x +1

 1 1
19. Write the value of cos −1  −  + 2 sin−1   .
 2  2

 −1  −1  1  −1    
20. The value of tan−1   + cot   + tan  sin  −   is
 3  3   2 

  3 
21. The value of tan−1 2 sin  2 cos −1   is
  2  

22. Check whether the relation R defined by R = {(a, b); a  b2} is neither reflexive nor symmetric
nor transitive.

3 Marks Questions

1 3 1− 7
23. Show that tan  sin−1  − .
2 4 3

24. Let N be the set of all natural numbers and R be a relation in N, defined by R = {(a, b) : a is a
factor of b}. Then, prove that R is reflexive and transitive but not symmetric.

25.
 1
(
Find the value of the expression sin  2 tan−1  + cos tan−1 2 2 .
 3
)
26. For real number x and y, define x R y if and only if x − y + 2 is an irrational number. Is R
transitive ? Explain your answer.

27. Let N be the set of all natural numbers and let R be a relation in N, defined by
R = {(a, b) : a is multiple of b}. Show that R is reflexive and transitive but not symmetric.

28. Show that the relation S in the set R of real numbers defined as S = {(a, b):a, b  R and a  b3}
is neither reflexive nor symmetric nor transitive.

5 Marks Questions

29. Show that the relation R on the set N × N defined by (a, b) R (c, d)  ad (b + c) = bc (a + d) is
an equivalence relation.

30. Show that the relation R on the set N × N defined by (a, b) R(c, d)  a + d = b + c for all (a, b),
(c, d) N × N is an equivalence relation.

31. Check whether f is invertible (bijective) and find f–1(x) (if possible)
n + 1
 , if n is odd
 2
Let f : N → N be defined by f(n) = 
 n , if n is even

2
Corporate Office : Motion Education Pvt. Ltd., 394 - Rajeev Gandhi Nagar, Kota 8003899588 | Page # 3
BOARD DPP MATHS

32. Check whether f is invertible (bijective) and find f–1(x) (if possible)
 x + 1, if x is odd
Let f : N → N, given by f(x) = 
 x − 1, if x is even

x
33. Show that the function f : R → x  R : −1  x  1 defined by f ( x ) = , x  R is one-one and
1+ x
onto function.

Section - C
Case Base MCQs

34. A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to
vote and voter turnout was about 67%, the highest ever.

Let I be the set of all citizens who were eligible to exercise their voting right in general election
held in 2019. A relation 'R' is defined on I as follows
R= {(V1, V2): V1, V2  I and both use their voting right in general election-2019}
Answer the following questions using the above information.

(i) Two neighbors X and Y  I. X exercised his voting right while Y did not cast her vote in general
election-2019. Which of the following is true?
(a) (X, Y)  R (b) (Y, X)  R (c) (X, X)  R (d) (X, Y)  R

(ii) Mr. 'X' and his wife 'W' both exercised their voting right in general election-2019, Which of the
following is true?
(a) both (X, W) and (W, X)  R (b)(X, W)  R but (W, X)  R
(c) both (X, W)  Rand (W, X)  R (d) (W, X)  R but (X, W)  R

(iii) Three friends F1, F2 and F3 no exercised their voting right in general election-2019, then which of
the following is true?
(a) (F1, F2)  R, (F2, F3)  R and (F1, F3)  R
(b) (F1, F2)  R, (F2, F3)  R and (F1, F3)  R
(c) (F1, F2)  R, (F2, F2)  R but (F1, F3)  R
(d) (F1, F2)  R, (F2, F3)  R and (F1, F3)  R

(iv) The above defined relation R is


(a) Symmetric and transitive but not reflexive
(b) Universal relation
(c) Equivalence relation
(d) Reflexive but not symmetric and transitive

(v) Mr. Shyam exercised his voting right in General Election-2019, then Mr. Shyam is related to which
of the following?
(a) All those eligible voters who cast their votes
(b) Family members of Mr. Shyam
(c) All citizens of India
(d) Eligible voters of India
Corporate Office : Motion Education Pvt. Ltd., 394 - Rajeev Gandhi Nagar, Kota 8003899588 | Page # 4
BOARD DPP MATHS

35. An organization conducted bike race under 2 different categories- boys and girls. Totally there
were 250 participants. 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 these participants for his college
project.
Let B = {b1, b2, b3] G = {g1, g2}, where B represents the set of boys selected and G the set of
girls who were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions.
Answer the following questions using the above information.

(i) Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
(a) 26 (b) 25 (c) 0 (d) 23

(ii) Let R: B → B be defined by R= {(x, y): x and y are students of same sex}, Then this relation R
is
(a) Equivalence
(b) Reflexive only
(c) Reflexive and symmetric but not transitive
(d) Reflexive and transitive but not symmetric

(iii) Ravi wants to know among those relations, how many functions can be formed from B to G?
(a) 22 (b) 212 (c) 32 (d) 23

(iv) Let R : B → G be defined by R = {(b1, g1), (b2, g2), (b3, g1), then R is
(a) Injective (b) Surjective
(c) Neither Surjective nor Injective (d) Surjective and Injective

(v) Ravi wants to find the number of injective functions from B to G. How many numbers of injective
functions are possible?
(a) 0 (b) 2! (c) 3! (d) 0!

Corporate Office : Motion Education Pvt. Ltd., 394 - Rajeev Gandhi Nagar, Kota 8003899588 | Page # 5

You might also like