AUSTIN EDUCATORS

2nd Floor, Pragathi Plaza,Urwa,Chilimbi,Mangalore-575006

Test / Exam Name: Relations & Functions Standard: 12th Science Subject: Mathematics

Q1. Find which of the binary operations are commutative and which are associative. 1 Mark
Consider a binary operation * on N defined as a * b = a3 + b3. Choose the
correct answer.
1. Is * both associative and commutative?
2. Is * commutative but not associative?
3. Is * commutative but not associative?
4. Is * neither commutative nor associative?

Ans:
a * b = a3 + b3 = b3 + a3 = b * a
∴ The operation is commutative.

Again, (a * b) * c = a * (a3 + b3) = a3(a3 + b3)3

And (a * b) * c= (a3 + b3) * c = (a3 + b3)3 + c3 ≠ a ∗ (b ∗ c)
∴ The operation * is not associative.

 Therefore, option (B) is correct.

2. Is * commutative but not associative?

Q2. Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and 1 Mark
symmetric but not transitive is:
1. 1
2. 2
3. 3
4. 4.

Ans:
The given set is A = {1, 2, 3}.
The smallest relation containing (1, 2) and (1, 3) which is reflexive and symmetric, but not transitive is given by:
R = {(1, 1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 1), (3, 1)}
This is because relation R is reflexive as (1,  1),  (2,  2),  (3,  3) ∈ R.
Relation R is symmetric since (1,  2),  (2,  1) ∈ R and (1,  3),  (3,  1) ∈ R.
But relation R is not transitive as (3,  1),  (1,  2) ∈ R,  but (3,  2) ∉ R.
Now, if we add any two pairs (3, 2) and (2, 3) (or both) to related R, then relation R will become transitive.
Hence, the total number of desired relations is one.
The correct answer is A.
1. 1.

Q3. Choose the correct answer from the given four options. 1 Mark
x, if x is rational
Let f : [0, 1] → [0, 1] be defined by f(x) = {  Then (fof)x is:
1 − x, if x is irrational

1. constant
2. 1 + x
3. x
4. none of these.

Ans:
3. x
Solution:
x, if x is rational
We are given that, f : [0, 1] → [0, 1] be defined by f(x) = {
1 − x, if x is irrational

Now, (fof)x = f(f(x))

= x

Q4. Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is: 1 Mark
1. 1
 2. 2
3. 3
4. 4.

Ans:
The given set is A = {1, 2, 3}.
The smallest equivalence relation containing (1, 2) is given by,
R1 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
Now, we are left with only four pairs i.e., (2, 3), (3, 2), (1, 3), and (3, 1).
If we add any one pair [say (2, 3)] to R1, then for symmetry we must add (3, 2). Also, for transitivity we required to add (1, 3) and (3,
1).
Hence, the only equivalence relation (bigger than R1) is the universal relation.
This shows that the total number of equivalence relations containing (1, 2) is two.
2. 2.

Q5. Choose the correct answer from the given four options. 1 Mark
Let f : R → R be defined by f(x) = 3x2 – 5 and g : R → R by g(x) = x
2
x +1
.  Then gof is:
2

1.
3x −5

4 2
9x −30x +26
2

2.
3x −5

4 2
9x −6x +26
2

3. 4
x +2x −4
3x
2

4. 4
9x +30x −2
3x
2

Ans:
2

1.
3x −5

4 2
9x −30x +26

Solution:
Given that, f(x) = 3x2 - 5 and g(x) = 2
x

x +1

gof(x) = g(f(x))
= g(3x2 - 5)
2
3x −5
=
2 2
(3x −5) +1
2
3x −5
=
4 2
9x −30x +25+1
2
3x +5
=
4 2
9x −30x +26

Q6. Choose the correct answer from the given four options. 1 Mark
⎧ 2x : x > 3

Let f : R → R be defined by f(x) = ⎨ x 2

: 1 < x ≤ 3  Then f(-1) + f(2) + f(4) is:
⎩
3x : x ≤ 1

1. 9
2. 14
3. 5
4. none of these.

Ans:
1. 9
Solution:
⎧ 2x : x > 3

We are given that, f(x) = ⎨ x 2

: 1 < x ≤ 3
⎩
3x : x ≤ 1

Now, f(-1) + f(2) + f(4) = 3(-1) + (2)2 + 2 × 4

= -3 + 4 + 8
=9

Q7. Number of binary operations on the set {a, b} are: 1 Mark

1. 10
2. 16
3. 20
4. 8.

Ans:
A binary operation * on {a, b} is a function from {a, b} × {a, b} → {a, b} i.e., * is a function from {(a, a), (a, b), (b, a), (b, b)}.
Hence, the total number of binary operations on the set {a, b} is 24 i.e., 16.
 The correct answer is B.
2. 16.

Q8. Choose the correct answer from the given four options. 1 Mark
Let f : A → B and g : B → C be the bijective functions. Then (gof)-1 is:
1. f-1og-1
2. fog
3. g-1of-1
4. gof

Ans:
1. f-1og-1
Solution:
Given that, f : A → B and g : B → C be the bijective functions.
−1 −1 −1 −1
(f og )o(gof) = f o(g ogof)

= f
−1
o(g
−1
 (As composition of functions is associative)
og)of

of) (where IB is identity function on B)

−1
= (f oIB
−1
= (f oIB )of
−1
= f of

= IA

Thus (gof) −1
= f
−1
og
−1

Q9. Choose the correct answer out of the given four options. 1 Mark
Let T be the set of all triangles in the Euclidean plane and let a relation R on T be defined as aRb, if a is
congruent to b ∀ a,  b ∈ T. Then, R is:
1. Reflexive but not transitive.
2. Transitive but not symmetric.
3. Equivalence.
4. None of these.

Ans:
3. Equivalence.
Solution:
Consider that aRb, if a is congruent to b, ∀ a, b ∈ T
Then, aRa ⇒  a ≅ a,
Which is true for all a ∈ T
So, R is reflexive, ....(i)
Let aRb ⇒  a ≅ b
⇒  b ≅ a ⇒  b ≅ a

⇒  bRa

So, R is symmetric. ...(ii)

Let aRb and bRc
⇒  a ≅ b and b ≅ c

⇒  a ≅ c ⇒  aRc

So, R is transitive. .....(iii)

Hence, R is equivalence relation.

Q10. Choose the correct answer from the given four options. 1 Mark
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto
mappings from A to B is:
1. 720
2. 120
3. 0
4. none of these.

Ans:
3. 0
Solution:
Since, the number of elements in B is more than A.
Hence, there cannot be any one-one and onto mapping from A to B.
Q11. Choose the correct answer from the given four options.
Let us define a relation R in R as aRb if a ≥ b. Then R is: 1 Mark
1. An equivalence relation.
2. Reflexive, transitive but not symmetric.
3. Symmetric, transitive but not reflexive.
4. Neither transitive nor reflexive but symmetric.

Ans:
2. Reflexive, transitive but not symmetric.
Solution:
We are given that, aRb if a ≥ b
⇒ aRa ⇒ a ≥ a which is true.
For relation aRb to be symmetric, we must have a ≥ b and b ≥ a which can’t be possible.
Hence, R is not symmetric.
For relation aRb to be transitive, we must have aRb and bRc.
⇒ a ≥ b and b ≥ c
⇒ a ≥ c
Hence, R is transitive.

Q12. Choose the correct answer from the given four options. 1 Mark
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:
1. Reflexive but not symmetric.
2. Reflexive but not transitive.
3. Symmetric and transitive.
4. Neither symmetric, nor transitive.

Ans:
1. Reflexive but not symmetric.
Solution:
Given that, A = {1, 2, 3}
and R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}
∵  (1, 1), (2, 2), (3, 3) ∈ R

Hence, R is reflexive.
(1, 2) ∈ R but (2, 1) ∉ R

Hence, R is not symmetric.

(1, 2) ∈ R and (2, 3) ∈ R

⇒  (1, 3) ∈ R

Hence, R is transitive.

Q13. Let f: R → R be defined as f(x) = 3x. Choose the correct answer. 1 Mark
1. f is one-one onto
2. f is many-one onto
3. f is one-one but not onto
4. f is neither one-one nor onto.

Ans:
f: R → R is defined as f(x) = 3x.
Let x, y ∈ R such that f(x) = f(y).
⇒ 3x = 3y
⇒x=y
∴ f is one-one.

y y y
Also, for any real number (y) in co-domain R, there exists  3  in R such that f ( 3 ) = 3(
3
) = y

∴ f is onto.
Hence, function f is one-one and onto.
The correct answer is A.
1. f is one-one onto.

Q14. Let f : R − { − 4
} → R  be a function defined as f (x) = 4x
.  The inverse of f is the map g: Range  1 Mark
3 3x+4

f : R − { −
4

3
} → R  given by:
 3y
1. g(y) = 3−4y

4y
2. g(y) = 4−3y

4y
3. g(y) = 3−4y

3y
4. g(y) = 4−3y
.  

Ans:
Given: f : R − { − 4

3
} → R and f (x) =
4x

3x+4

Now, Range of f → R − { − 4

3
}

Let y = f (x)    ∴  y = 4x

3x+4
   ⇒  3xy + 4y = 4x

4y
⇒    x(4 − 3y) = 4y   ⇒  x =
4−3y

4y
−1
∴   f (y) = g(y) =
3−4y

Therefore, option (B) is correct.

4y
2. g(y) = 4−3y
.

Q15. Choose the correct answer from the given four options. 1 Mark
Let f : N → R be the function defined by f(x) =  and g : Q → R be another function defined by
2x−1

g(x) = x + 2. Then (gof)  is: 3

1. 1
2. 1
3. 7

4. None of these.

Ans:
4. none of these.
Solution:
We have f(x) =  and g(x) = x + 2
2x−1

3 3
gof( ) = g(f( ))
2 2

3
2× −1
2
= g( )
2

= g(1) = 1 + 2 = 3

Q16. Let f: R → R be defined as f(x) = x4. Choose the correct answer. 1 Mark
1. f is one-one onto
2. f is many-one onto
3. f is one-one but not onto
4. f is neither one-one nor onto.

Ans:
f: R → R is defined as f(x) = x4.
Let x, y ∈ R such that f(x) = f(y).
⇒ x4 = y4
⇒ x = ±y

∴  f(x1) = f(x2) does not imply that x1 = x2

For instance,
f(1) = f(-1) = 1
∴ f is not one-one.

Consider an element 2 in co-domain R. It is clear that there does not exist any x in domain R such that f(x) = 2.
∴ f is not onto.

Hence, function f is neither one-one nor onto.

The correct answer is D.
4. f is neither one-one nor onto.

Q17. Let R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}. Choose 1 Mark
the correct answer.
1. (2, 4) ∈ R
2. (3, 8) ∈ R
3. (6, 8) ∈ R
4. (8, 7) ∈ R.
Ans:
Given: a = b − 2, b >  6
(A) a = 2, b = 4 , Here b > 6 is not true, therefore, this option is incorrect
(B) a = 3, b = 8 and a = b - 2 ⇒ 3 = 8-2 ⇒ 3 = 6, which is false.
  Therefore, this option is incorrect    
(C) a = 6, b = 8 and b = b - 2 ⇒ 6 = 8 - 2 ⇒ 6 = 6, which is true.
  Therefore, this option is correct    
(D) a = 8, b = 7 and a = b - 2 ⇒ 8 = 7 - 2 ⇒ 8 = 5, which is false.

3. (6, 8) ∈ R.

Q18. If f: R → R be given by f (x) = (3 − x 1 Mark

1
3
)3 ,  then fof(x) is:
1

1. x3

2. x3
3. x
4. (3 - x3).

Ans:
1

f: R → R and f (x) = (3 − x 3

)3
1
1
1
3 3
3
3 3
⇒   f [f (x)] = [3 − [f (x) ] = [3 − {(3 − x ) 3 } ]

1 1
3 3
= [3 − (3 − x )] 3 = (3 − 3 + x ) 3 = x

Therefore, option (C) is correct.

3. x.

Q19. Choose the correct answer from the given four options. 1 Mark
Which of the following functions from Z into Z are bijections?
1. f(x) = x3
2. f(x) = x + 2
3. f(x) = 2x + 1
4. f(x) = x2 + 1

Ans:
2. f(x) = x + 2
Solution:
Consider, the second option i.e., f(x) = x + 2
Now, f(x1) = f(x2)
⇒ x1 + 2 = x2 + 2
⇒ x1 = x2
Hence, f(x) = x + 2 is one-one function.
Now, let us suppose, y = x + 2
x = y − 2 ∈ Z,  ∀ y ∈ x

Hence, f(x) is one-one and onto.

Q20. Choose the correct answer from the given four options. 1 Mark
Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a is
brother of b. Then R is:
1. Symmetric but not transitive.
2. Transitive but not symmetric.
3. Neither symmetric nor transitive.
4. Both symmetric and transitive.

Ans:
2. Transitive but not symmetric.
Solution:
We are given that a relation R defined aRb ⇒ a is brother of b.
aRa ⇒ a is brother of a, which is not true.
Hence, R is not reflexive.
aRb ⇒ a is brother of b.
This does not mean b is also a brother of a and b can be a sister of a.
 Hence, it is not symmetric.
aRb ⇒ a is brother of b
and bRc ⇒ b is a brother of c.
So, a is brother of c.
Hence, R is transitive.

Q21. Choose the correct answer from the given four options. 1 Mark
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is:
1. Reflexive.
2. Transitive.
3. Symmetric.
4. None of these.

Ans:
2. Transitive.
Solution:
R on the set {1, 2, 3} be defined by R = {(1, 2)}
It is clear that R is transitive.

Q22. Choose the correct answer from the given four options. 1 Mark
Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is:
1. nP2
2. 2n – 2
3. 2n – 1
4. None of these.

Ans:
2. 2n – 2
Solution:
Given that, A = {1, 2, 3, ..... n} and B = {a, b}
If function is subjective then its range must be set B = {a, b}
Now number of onto functions = Number of ways 'n' distinct objects can be distributed in two boxes 'a' and 'b' in such a way that no
box remains empty.
Now for each object there are two options, either it is put in box 'a' or in box 'b'
So total number of ways of 'n' different objects = 2 × 2 × 2 .... n times = 2n
But in one case all the objects are put box 'a' and in one case all the objects are put in box 'b'
So, number of subjective functions = 2n - 2

Q23. Choose the correct answer from the given four options. 1 Mark
The identity element for the binary operation * defined on Q ∼ {0} as a  ∗
 b =
ab

2
 ∀ a, b ∈ Q ∼ {0}

 is:
1. 1
2. 0
3. 2
4. none of these.

Ans:
3. 2
Solution:
Given that, a  ∗
 b =
ab

2
 ∀ a, b ∈ Q ∼ {0}

Let e be the identity element for *

∗ ae
∴  a   e = (a  ∗  e = e  ∗  a = a)
2
ae
⇒  a =
2

⇒  e = 2

Q24. Choose the correct answer from the given four options. 1 Mark
Let f : [2, ∞) → R be the function defined by f(x) = x2 – 4x + 5, then the range of f is:
1. R
2. [1, ∞)
3. [4, ∞)
4. [5, ∞)
Ans:
2. [1, ∞)
Solution:
Given that, f(x) = x 2
− 4x + 5,

Let y = x − 4x + 5
2

2
⇒  y = x − 4x + 4 + 1

2
= (x − 2) + 1

2
⇒  (x − 2) = y − 1

⇒  x − 2 = √y − 1

⇒  x = 2 + √y − 1

∴  y − 1 ≥ 0,  y ≥ 1

Range = [1, ∞)

Q25. Choose the correct answer from the given four options. 1 Mark
Let f : R → R be given by f(x) = tanx. Then f-1(1) is:
1. π

2. {nπ + : n ∈ Z} π

3. Does not exist.

4. None of these.

Ans:
1. π

Solution:
Given that, f(x) = tanx
Let y = tanx ⇒ x = tan-1y
⇒ f-1(x) = tan-1x ⇒ f-1(1) = tan-11
−1 π π π
⇒   tan tan =  [ ∵   tan = 1]
4 4 4

Q26. Choose the correct answer from the given four options. 1 Mark
The maximum number of equivalence relations on the set A = {1, 2, 3} are:
1. 1
2. 2
3. 3
4. 5

Ans:
4. 5
Solution:
Given that, A = {1, 2, 3}
Now, number of equivalence relations as follows
R1 = {(1, 1), (2, 2), (3, 3)}
R2 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
R3 = {(1, 1), (2, 2), (3, 3), (1, 3), (3, 1)}
R4 = {(1, 1), (2, 2), (3, 3), (2, 3), (3, 2)}
R5 = {(1, 2, 3) ⇔ A × A = A2}
∴ Maximum number of equivalence relation is '5'.

Q27. Choose the correct answer out of the given four options. 1 Mark
Let * be binary operation defined on R by a * b = 1 + ab ∀ a, b ∈ R. Then the operation * is:
1. Commutative but not associative.
2. Associative but not commutative.
3. Neither commutative nor associative.
4. Both commutative and associative.

Ans:
1. Commutative but not associative.
Solution:
We are given that, a * b = 1 + ab ∀ a, b ∈ R
Consider, a * b = ab + 1
= ba + 1
 = b * a
Hence, * is a communicative binary operation.
Also, a * (b * c) = a * (bc + 1) [∵ b * c = bc + 1]
= a(bc + 1) + 1
= a + abc + 1
Now, (a * b) * c = (ab + 1) * c [∵ a * b = ab + 1]
= (1 + ab)c + 1
= c + abc +1
Now, a + abc + 1 ≠ c + abc + 1
∗ ∗ ∗ ∗
⇒  a   (b   c) ≠ (a   b)   c

Therefore, * is not associative.

Hence, * is communicative but not associative.

Q28. Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4,4), (1, 3), (3, 3), (3, 1 Mark
2)}. Choose the correct answer.
1. R is reflexive and symmetric but not transitive.
2. R is reflexive and transitive but not symmetric.
3. R is symmetric and transitive but not reflexive.
4. R is an equivalence relation.

Ans:
Let R be the relation in the set {1, 2, 3, 4} is given by
R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}
(a) (1, 1), (2, 2), (3, 3), (4, 4) ∈ R ∴ R is reflexive
(b) (1, 2) ∈ R but (2, 1) ∉ R ∴ R is not symmetric
(c) If (1, 3) ∈ R and (3, 2) ∈ R then (1, 2) ∈ R ∴ R is transitive

Therefore, option (B) is correct.

2. R is reflexive and transitive but not symmetric.

Q29. Choose the correct answer from the given four options. 1 Mark
Let f : R → R be the functions defined by f(x) = x3 + 5. Then f-1(x) is:
1

1. (x + 5) 3

2. (x − 5) 3

3. (5 − x) 3

4. 5 − x

Ans:
1

2. (x − 5) 3

Solution:
we are given that, f(x) = x 3
+ 5

Let us suppose, y = x + 5 3

3
⇒  x = y − 5
1

⇒ x = (y − 5) 3

∵ f(x) = y
[ ]
−1
⇒ x = f (y)
1
−3
⇒ f (y) = (y − 5) 3
1
−1
⇒ f (x) = (x − 5) 3

Q30. Choose the correct answer from the given four options. 1 Mark
Let f : R → R be defined by f(x) =  ∀ x ∈ R. Then f is:
1

1. one-one.
2. onto.
3. bijective.
4. f is not defined.

Ans:
4. f is not defined.
Solution:
Given that, f(x) = 1

x
 ∀ x ∈ R.
 For x = 0, f(x) is not defined.
Hence, f(x) is a not defined function.

Q31. Choose the correct answer from the given four options. 1 Mark
Let f : R − {  be defined by f(x) =  Then,
3 3x+2
} →  R .
5 5x−3

1. f (x) = f(x)
−1

2. f (x) = −f(x)
−1

3. (fof)x = −x
4. f x = f(x)
−1 1

19

Ans:
1. f (x) = f(x)
−1

Solution:
We have, f(x) = 3x+2

5x−3
= y (let)

⇒  3x + 2 = 5xy − 3y

⇒  x(3 − 5y) = −3y − 2

3y+2
⇒  x =
5y−3

−1 3x+2
⇒  f (x) =
5x−3

−1
∴   f x = f(x)