CHAPTER 1 (RELATION AND FUNCTION)

(I) MULTIPLE CHOICE QUESTIONS

SL.NO. QUESTIONS LEARNING

OBJECTIVE
1 Let S be the set of all square in a plane with R a relation in S given by ANALYSIS
R = {(S1, S2) : S1 is congruent to S2}. Then R is
(a) an equivalence relation.
(b) only reflexive
(c) transitive not symmetric
(d) only symmetric
2 Given set A ={1, 2, 3} and a relation R = {(1, 3), (3, 1)}, the relation R CREATION
will be
(a) reflexive if (1, 1) is added
(b) symmetric if (2, 3) is added
(c) transitive if (1, 1) is added
(d) symmetric if (3, 2) is added

3 The function f :[0,∞) R given by f(x) = EVALUATION

(a) f is both one-one and onto

(b) f is one-one but not onto
(c) f is onto but not one-one
 (d) neither one-one nor onto

4 Which of the following functions from Z to itself are bijections? ANALYSIS

(a) f(x) = x3
(b) f(x)=
(c) f(x) = 2x+1
(d) f(x) =

5 Let A ={1,2,3} , B = {1,4,6,9} and R is a relation from A to B define by ‘ x EVALUATION

is greater than y ’.
Then range of R is given by:
(a) {1,4,6,9}
(b) {4,6,9}
(c) {1}
(d) none of these

6 Let N be the set of all natural numbers and let R be a relation in N, UNDERSTANDING
defined by R = {(a, b)} : a is a factor of b }.
(a) R is symmetric and transitive but not reflexive
(b) R is reflexive and symmetric but not transitive
(c) R is equivalence
(d) R is reflexive and transitive but not symmetric
7 Let N be the set of all natural numbers and let R be a relation on N APPLICATION
N,defined by (a, b) R (c, d) ad bc.
(a) R is symmetric and transitive but not reflexive
(b) R is reflexive and symmetric but not transitive
(c) R is equivalence
(d) R is reflexive and transitive but not symmetric

8 Let A be the set of all points in a plane and let O be the origin. Let KNOWLEDGE
R {(P, Q) :OP OQ}. Then, R is
(a) reflexive and symmetric but not transitive
(b) reflexive and transitive but not symmetric
(c) symmetric and transitive but not reflexive
 (d) an equivalence relation

9 If f {(1, 2), ( 3, 5), (4, 1)} and g {(2, 3), (5, 1), (1, 3)} then (g o f ) ? EVALUATION
(a) {(3, 1), (1, 3), (3, 4)}
(b) {(1, 3), (3, 1), (4, 3)}
(c) {(3, 4), (4, 3), (1, 3)}
(d) {(2, 5), (5, 2), (1, 5)}

10 Let X = {-1, 0, 1}, Y = {0, 2} and a function f : X → Y defined by y = 2x4, is UNDERSTANDING

(a) one-one onto
(b) one-one into
(c) many-one onto
(d) many-one into

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

12 Let A be the set of all 50 students of Class X in a school. Let f : A N be CREATION

function defined by f (x) = roll number of the student x.
(a) f is neither one-one nor onto.
(b) f is one-one but not onto
(c ) f is not one-one but onto
(d) none of these

13 Let R be the relation in the set N given by R = {(a, b) : a = b – 3, b > 6}. EVALUATION
Choose the correct answer.
(A) (2, 4) R
(B) (3, 8) R
(C) (6, 8) R
(D) (4, 7) R
14 The function f : R R, defined as f (x) = x2, is KNOWLEDGE
 (a) neither one-one nor onto
(b) only onto
(c) one-one
(d) none of these
15 Let R be a relation defined on Z as follows: ( x, y) R x y 1. Then APPLICATION
R is:
(a) Reflexive and transitive
(b) Reflexive and symmetric
(c) Symmetric and transitive
(d) an equivalence relation

(II) ASSERTION REASON TYPE QUESTION

SL.NO. QUESTION LEARNING

OBJECTIVE

1 Assertion (A) Let A = {a, b, c}, B = {4, 5, 6, 7} and let f = {(a, 4), (c, 5), UNDERSTANDING
(b, 7)} be a function from A to B. Then f is one-one.
Reason (R) f is bijective function
(a) Both A and R are correct; R is the correct explanation of A.
(b) Both A and R are correct; R is not the correct explanation of A.
(c) A is correct; R is incorrect.
(d) R is correct; A is incorrect

2 Assertion (A) if n (A) = 5 and n(B) = 4The number of relation from set A EVALUATION
to B is 20
Reason (R) The number of subset of A X B is 220
(a) Both A and R are correct; R is the correct explanation of A.
(b) Both A and R are correct; R is not the correct explanation of A.
(c) A is correct; R is incorrect.
(d) R is correct; A is incorrect

3 Assertion(A) T is the set of triangle such that {(T1, T2) : T1 is congruent to KNOWLEDGE
T2}. Then R is an equivalence relation.
Reason(R) Any relation R is an equivalence relation, if it is reflexive,
symmetric and transitive
(a) Both A and R are correct; R is the correct explanation of A.
 (b) Both A and R are correct; R is not the correct explanation of A.
(c) A is correct; R is incorrect.
(d) R is correct; A is incorrect

4 Assertion(A) the function f : R R, given by f (x) = 2x, is one-one and UNDERSTANDING

onto
Reason(R) A function f : X Y is said to be one-one and onto (or
bijective), if f is both one-one and onto.
(a) Both A and R are correct; R is the correct explanation of A.
(b) Both A and R are correct; R is not the correct explanation of A.
(c) A is correct; R is incorrect.
(d) R is correct; A is incorrect

5 Assertion(A) The relation R on the set N×N, defined by (a, b) R (c, APPLICATION
d) a+d = b+c for all (a, b), (c, d) ∈ N×N is an equivalence relation.
Reason (R) Any relation R is an equivalence relation, if it is reflexive,
symmetric and transitive.

(a) Both A and R are correct; R is the correct explanation of A.

(b) Both A and R are correct; R is not the correct explanation of A.
(c) A is correct; R is incorrect.
(d) R is correct; A is incorrect

(III) CASE/SOURCE BASED QUESTIONS

SL.NO. READ THE PASSAGE GIVEN BELOW AND ANSWER THE LEARNING
FOLLOWING QUESTIONS OBJECTIVE
CASE1 A company conducted interview under 2 different categories-male and CREATION
Female. Totally there were 100 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 M and F with these participants for his college
project. Let M = {m1,m2,m3} F = {f1,f2} where M represents the set of
male selected and F the set of female who were selected for the final.
Ravi decides to explore these sets for various types of relations and
functions
1. Ravi wishes to form all the relations possible from M to F. How many
such relations are possible?
a. 26
b. 25
c. 0
d. 23
2. Let R: M→M be defined by R = {( ,𝑦): and y are 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
3. Ravi wants to know among those relations, how many functions can be
formed from M to F?
a. 22
b. 212
c. 32
d. 23
4. Let 𝑅: M→F be defined by R = { (m1,m1), (m2,f2),(m3,f1)}, then R
is__________
a. Injective

b. Subjective

c. Neither Subjective nor Injective

d. Subjective and Injective

5. Ravi wants to find the number of injective functions from M to F. How

many numbers of injective functions are possible?
 a. 0
b. 2!
c. 3!
d. 0!

CASE2 A relation R on a set A is said to be an equivalence relation on A if it is UNDERSTANDING

• Reflexive i.e., (a, a) ∈ R ∀ a ∈ A.
• Symmetric i.e., (a, b) ∈ R ⇒ (b, a) ∈ R ∀ a, b ∈ A.
• Transitive i.e., (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R ∀ a, b, c ∈A. Based
on the above information, answer the following questi
1. If the relation R = {(1, 1), (1, 2), (1, 3), (2, 2), (2, 3), (3, 1), (3, 2), (3,
3)} defined on the set A = {1, 2, 3}, then R is
(a) reflexive
(b) symmetric
(c) transitive
(d) equivalence
2. If the relation R = {(1, 2), (2, 1), (1, 3), (3, 1)} defined on the set A =
{1, 2, 3}, then R is
(a) reflexive
(b) symmetric
(c) transitive
(d) equivalence
3. If the relation R on the set N of all natural numbers defined as R = {(x,
y) : y = x + 5 and (x < 4), then R is
(a) reflexive
(b) symmetric
(c) transitive
(d) equivalence

(IV) TRUE FALSE QUESTIONS:

SL.NO QUESTION LEARNING

OBJECTIVE
1 Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, UNDERSTANDING
 1), (4,4), (1, 3), (3, 3), (3, 2)}. R is an equivalence relation.
TRUE FALSE
2 The function f : N N, given by f (1) = f (2) = 1 and f (x) = x – 1, for KNOWLEDGE
every x > 2, is onto but not one-one.
TRUE FALSE
3 An integer m is said to be related to another integer n, if m is a integral KNOWLEDGE
multiple of n. This relation in Z is reflexive, symmetric and transitive.
Sol.
TRUE FALSE
4 f : X Y is onto if and only if Range of f = Y. KNOWLEDGE
TRUE FALSE
5 A function f : X Y is said to be one-one and onto (or bijective), if f is KNOWLEDGE
both one-one and onto
TRUE FALSE
6 The relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is UNDERSTANDING
transitive
TRUE FALSE
7 A relation R in a set A is said to be an equivalence relation if R is UNDERSTANDING
reflexive, symmetric and transitive
TRUE FALSE
8 Relation R in the set A = {1, 2, 3,- - - - - 13, 14} defined as R = {(x, y) : KNOWLEDGE
3x – y = 0} reflexive
TRUE FALSE
9 Let f : R R be defined as f(x) = x4 is one one UNDERSTANDING
TRUE FALSE
10 Every relation which is symmetric and transitive is reflexive also ANALYSIS
TRUE FALSE

MatriX
𝑦
1. If [ ] [ ] [ ] Then find (x-y)

2. Solve [ ][ ]
3. If A is a square matrix such that A2 =A, then find the value of 7A-(I+A)3.
𝑦
4. If[ 𝑦 ] [ ] then find the value of x+y

5. If [ ] [ ]find the value of a-2b

𝑦
6. If [ ] [ ]find x+y+z
𝑦

7. The elements of aij of a 3x3 matrix are given by aij= | |write the value of a32.

8. If [ ][ ] then find the value of x

𝑦
9. If [ ] [ ] [ ] find x+y

10 find the value of a if [ ] [ ]

11 If [ ]and A2 = KA find the value of A

13 IF A =[ ]and A2=Pa find the value of A

14 Simplify cos [ ] [ ]

15 if x[ ] 𝑦[ ] [ ].find x

16 if 3A-B= [ ]and B=[ ] find A

17Find the value of x-y+z from

𝑦
[ ] [ ]
𝑦

18 write the order of of the product matrix [ ] [ ]

19 if a matrix has 5 elements, then write the possible order of it, it can have
𝑦
20 if [ 𝑦 ] [ ]find the value of y

INVERSE TRIGONOMETRI FUNCTION

 1 
1. For  = sin 1   , find the value of 
 2
2. Find the Principal value of tan-1 ( 3 )
3. Evaluate: sin(cot-1x)
3
4. Evaluate: cos(tan-1 4 )X
5. Express in simplest form: sin-1[3x – 4x3]