RELATIONS AND FUNCTIONS

01

Important Questions
Multiple Choice questions-
1. 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, 2)}.

Then:

(a) R is reflexive and symmetric but not transitive

(b) R is reflexive and transitive but not symmetric

(c) R is symmetric and transitive but not reflexive

(d) R is an equivalence relation.

2. Let R be the relation in the set N given by: R = {(a, b): a = b – 2, b > 6}. Then:

(a) (2, 4) ∈ R

(b) (3, 8) ∈ R

(c) (6, 8) ∈ R

(d) (8, 7) ∈ R.

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

(a) 1

(b) 2

(c) 3

(d) 4.

4. Let A = (1, 2, 3). Then the number of equivalence relations containing (1, 2) is

(a) 1

(b) 2

(c) 3

(d) 4.

(8)
 RELATIONS AND FUNCTIONS
01

5. Let f: R → R be defined as f(x) = x4. Then

(a) f is one-one onto

(b) f is many-one onto

(c) f is one-one but not onto

(d) f is neither one-one nor onto.

6. Let f: R → R be defined as f(x) = 3x. Then

(a) f is one-one onto

(b) f is many-one onto

(c) f is one-one but not onto

(d) f is neither one-one nor onto.

7. If f: R → R be given by f(x) = (3 – x³)1/3, then fof (x) is

(a) x1/3

(b) x³

(c) x

(d) 3 - x³.
4 4x 4
8. Let f: R – {- } → R be a function defined as: f(x) = , x ≠ - . The inverse of f is map
3 3x + 4 3
4
g: Range f → R -{- } given by
3
3y
(a) g(y) =
3− 4y

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

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

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

9. Let R be a relation on the set N of natural numbers defined by nRm if n divides m.

Then R is

(a) Reflexive and symmetric

(9)
 RELATIONS AND FUNCTIONS
01

(b) Transitive and symmetric

(c) Equivalence

(d) Reflexive, transitive but not symmetric.

10. 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

Very Short Questions:

1. If R = {(x, y) : x + 2y = 8} is a relation in N, write the range of R.

2. Show that a one-one function:

f {1, 2, 3} → {1, 2, 3} must be onto. (N.C.E.R.T.)

|x − 1|
3. What is the range of the function f(x) = ? (C.B.S.E. 2010)
x−1

4. Show that the function f : N → N given by f(x) = 2x is one-one but not onto.
(N.C.E.R.T.)

5. If f : R → R is defined by f(x) = 3x + 2 find f(f(x)). C.B.S.E. 2011 (F))

x
6. If f(x) = , x ≠1 then find fof. (N.C.E.R.T)
x−1

7. If f: R → R is defined by f(x) = (3 - x3)1/3, find fof (x)

8. Are f and q both necessarily onto, if gof is onto? (N.C.E.R.T.)

Short Questions:
1. Let A be the set of all students of a Boys’ school. Show that the relation R in A given
by:

R = {(a, b): a is sister of b} is an empty relation and the relation R’ given by :

R’ = {(a, b) : the difference between heights of a and b is less than 3 metres} is an

universal relation. (N.C.E.R.T.)

(10)
 RELATIONS AND FUNCTIONS
01

2. Let f : X → Y be a function. Define a relation R in X given by :

R = {(a,b):f(a) = f(b)}.

Examine, if R is an equivalence relation. (N.C.E.R.T.)

3. Let R be the relation in the set Z of integers given by:

R = {(a, b): 2 divides a – b}.

Show that the relation R is transitive. Write the equivalence class [0]. (C.B.S.E.
Sample Paper 2019-20)

4. Show that the function:

f:N→N

given by f(1) = f(2) = 1 and f(x) = x -1, for every x > 2 is onto but not one-one.
(N.C.E.R.T.)

5. Find gof and fog, if:

f : R → R and g : R → R are given by f (x) = cos x and g (x) = 3x2. Show that gof ≠ fog.
(N. C.E.R. T.)
4x + 3 2
6. If f(x) = , x ≠ find fof(x)
6x − 4 3

7. Let A = N x N be the set of ail ordered pairs of natural numbers and R be the
relation on the set A defined by (a, b) R (c, d) iff ad = bc. Show that R is an
equivalence relation.

8. Let f: R → R be the Signum function defined as:

and g : R → R be the Greatest Integer Function given by g (x) = [x], where [x] is
greatest integer less than or equal to x. Then does fog and gof coincide in (0,1]?

Long Questions:
1. Show that the relation R on R defined as R = {(a, b):a ≤ b}, is reflexive and transitive
but not symmetric.

(11)
 RELATIONS AND FUNCTIONS
01

2. Prove that function f : N → N, defined by f(x) = x 2 + x + 1 is one-one but not onto.

Find inverse of f : N → S, where S is range of f.

3. Let A = (x ∈Z : 0 ≤ x ≤ 12}.

Show that R = {(a, b) : a, b ∈ A; |a – b| is divisible by 4} is an equivalence relation.

Find the set of all elements related to 1. Also write the equivalence class [2].
(C.B.S.E 2018)

4. Prove that the function f: [0, ∞) → R given by f(x) = 9x 2 + 6x – 5 is not invertible.

Modify the co-domain of the function f to make it invertible, and hence find f-1.
(C.B.S.E. Sample Paper 2018-19

Assertion and Reason Questions-

1. Two statements are given-one labelled Assertion (A) and the other labelled Reason
(R). Select the correct answer to these questions from the codes(a), (b), (c) and (d) as
given below.

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

b) Both A and R are true but R is not the correct explanation of A.
c) A is true but R is false.
d) A is false and R is also false.

Assertion(A): Let L be the set of all lines in a plane and R be the relation in L defined as
R = {(L1, L2): L1 is perpendicular to L2}.R is not equivalence realtion.

Reason (R): R is symmetric but neither reflexive nor transitive

2. Two statements are given-one labelled Assertion (A) and the other labelled Reason
(R). Select the correct answer to these questions from the codes(a), (b), (c) and (d) as
given below.

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

b) Both A and R are true but R is not the correct explanation of A.
c) A is true but R is false.
d) A is false and R is also false.

Assertion (A): = {(T1, T2): T1 is congruent to T2}. Then R is an equivalence relation.

Reason(R): Any relation R is an equivalence relation, if it is reflexive, symmetric and

transitive.

(12)
 RELATIONS AND FUNCTIONS
01

Case Study Questions-

1. Consider the mapping f: A → B is defined by f(x) = x - 1 such that f is a bijection.

Based on the above information, answer the following questions.

(i) Domain of f is:

a) R - {2}
b) R
c) R - {1, 2}
d) R - {0}

(ii) Range of f is:

a) R
b) R - {2}
c) R - {0}
d) R - {1, 2}

(iii) If g: R - {2} → R - {1} is defined by g(x) = 2f(x) - 1, then g(x) in terms of x is:

(iv) The function g defined above, is:

a) One-one
b) Many-one
c) into
d) None of these

(v) A function f(x) is said to be one-one if.

a. f(x1) = f(x2) ⇒ -x1 = x2

b. f(-x1) = f(-x2) ⇒ -x1 = x2
c. f(x1) = f(x2) ⇒ x1 = x2
d. None of these

(13)
 RELATIONS AND FUNCTIONS
01

2. A relation R on a set A is said to be an equivalence relation on A iff it is:

I. Reflexive i.e., (a, a) ∈ R ∀ a ∈ A.

II. Symmetric i.e., (a, b) ∈ R ⇒ (b, a) ∈ R ∀ a, b ∈ A.
III. 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 questions.

(i) 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

(ii) 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

(iii) 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) If the relation R on the set A = {1, 2, 3, ........., 13, 14} defined as R = {(x, y): 3x - y =
O}, then R is:

a) Reflexive
b) Symmetric
c) Transitive
d) Equivalence

(v) If the relation R on the set A = {I, 2, 3} defined as R = {(1, 1), (1, 2), (1, 3), (2, 1),
(2, 2), (2, 3), (3, 1), (3, 2), (3, 3)}, then R is:

a) Reflexive only

(14)
 RELATIONS AND FUNCTIONS
01

b) Symmetric only
c) Transitive only
d) Equivalence

Answer Key-
Multiple Choice questions-
(b) R is reflexive and transitive but not symmetric

(c) (6, 8) ∈ R

(a) 1

(b) 2

(d) f is neither one-one nor onto.

(a) f is one-one onto

(c) x
4y
(b) g(y) =
4 − 3y

(b) Transitive and symmetric

(c) 24

Very Short Answer:

1. Solution: Range of R = {1, 2, 3}.

[∵ When x = 2, then y = 3, when x = 4, then y = 2, when x = 6, then y = 1]

2. Solution: Since ‘f’ is one-one,

∴ under ‘f’, all the three elements of {1, 2, 3} should correspond to three different
elements of the co-domain {1, 2, 3}.

Hence, ‘f’ is onto.

3. Solution: When x > 1,

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

When x < 1,

(15)