Home Worksheets
CBSE · Class XII · Maths · Chapter 1

Relations and Functions: Class 12 Maths questions with answers

20 practice questions on Relations and Functions for CBSE Class 12, in the board pattern: multiple choice, assertion–reason and short answer. Open any answer to see the step-by-step solution. Want more? Make a fresh Relations and Functions worksheet with new questions every time.

Multiple choice questions

7 questions
1.
The number of symmetric relations on a set with 4 elements is
  1. (a)212
  2. (b)42
  3. (c)24
  4. (d)210
Show answer and solution
Answer: (d) 210
A symmetric relation is fixed by choosing the 4 diagonal pairs freely and each of the 6 unordered pairs {(a, b), (b, a)} together: 4 + 6 = 10 free choices. Number = 210.
2.
Let A = {1, 2, 3} and R = {(1, 2), (2, 1)} be a relation on A. Then
  1. (a)R is not reflexive, not symmetric and transitive
  2. (b)R is not reflexive, symmetric and transitive
  3. (c)R is not reflexive, not symmetric and not transitive
  4. (d)R is not reflexive, symmetric and not transitive
Show answer and solution
Answer: (d) R is not reflexive, symmetric and not transitive
Reflexive needs (1, 1), (2, 2), (3, 3): not all present. Symmetric needs (b, a) for each (a, b): holds. Transitive needs (a, c) whenever (a, b), (b, c) are in R: fails.
So R is not reflexive, symmetric and not transitive.
3.
The number of equivalence relations on a set with 3 elements is
  1. (a)4
  2. (b)3
  3. (c)8
  4. (d)5
Show answer and solution
Answer: (d) 5
Equivalence relations correspond to partitions of the set. A set with 3 elements has 5 partitions.
4.
The function f : N → N, f(n) = (n + 1)/2 if n is odd, n/2 if n is even is
  1. (a)onto but not one-one
  2. (b)one-one but not onto
  3. (c)neither one-one nor onto
  4. (d)one-one and onto
Show answer and solution
Answer: (a) onto but not one-one
f(1) = f(2) = 1, so not one-one; any m has pre-image 2m, so onto. So f is onto but not one-one.
5.
On A = {0, 1, 2, …, 8}, the relation R = {(a, b) : |a − b| is a multiple of 4} is an equivalence relation. The equivalence class [0] is
  1. (a){3, 7}
  2. (b){0}
  3. (c){1, 5}
  4. (d){0, 4, 8}
Show answer and solution
Answer: (d) {0, 4, 8}
[0] contains every x in A with x − 0 a multiple of 4: {0, 4, 8}.
6.
A function f : A → B is onto if
  1. (a)A and B have the same number of elements
  2. (b)the range of f equals B
  3. (c)f(x₁) = f(x₂) ⇒ x₁ = x₂
  4. (d)every element of A has a unique image
Show answer and solution
Answer: (b) the range of f equals B
Onto (surjective) means every element of B is an image, i.e. the range of f equals B.
7.
The identity relation on a non-empty set A is
  1. (a)not reflexive
  2. (b)reflexive but not symmetric
  3. (c)an equivalence relation
  4. (d)symmetric but not transitive
Show answer and solution
Answer: (c) an equivalence relation
I = {(a, a) : a ∈ A} is reflexive, symmetric and transitive, so it is an equivalence relation.

Assertion–Reason questions

3 questions
8.

Assertion (A): The relation R on Z given by R = {(a, b) : a − b is divisible by 4} is reflexive.

Reason (R): Every relation that is symmetric is also reflexive.

  1. (a)Both A and R are true, and R is the correct explanation of A
  2. (b)Both A and R are true, but R is not the correct explanation of A
  3. (c)A is true, but R is false
  4. (d)A is false, but R is true
Show answer and solution
Answer: (c) A is true, but R is false
A is true (a − a = 0 is divisible). R is false: a symmetric relation need not be reflexive, e.g. the empty relation on a non-empty set.
9.

Assertion (A): For a finite set A, a function f : A → A is one-one if and only if it is onto.

Reason (R): If A has n elements and f is one-one, the n images are distinct, so they fill all of A.

  1. (a)Both A and R are true, and R is the correct explanation of A
  2. (b)Both A and R are true, but R is not the correct explanation of A
  3. (c)A is true, but R is false
  4. (d)A is false, but R is true
Show answer and solution
Answer: (a) Both A and R are true, and R is the correct explanation of A
R gives exactly the counting argument that proves A (and the converse works the same way).
10.

Assertion (A): The relation R on the set of lines in a plane, given by L₁ R L₂ if L₁ ⊥ L₂, is symmetric.

Reason (R): The relation R is transitive.

  1. (a)Both A and R are true, and R is the correct explanation of A
  2. (b)Both A and R are true, but R is not the correct explanation of A
  3. (c)A is true, but R is false
  4. (d)A is false, but R is true
Show answer and solution
Answer: (c) A is true, but R is false
If L₁ ⊥ L₂ then L₂ ⊥ L₁, so A is true. If L₁ ⊥ L₂ and L₂ ⊥ L₃ then L₁ ∥ L₃, so R is not transitive: R is false.

Short answer questions

10 questions
11.
Set A has 2 elements and set B has 4 elements. How many relations from A to B are possible?
Show answer and solution
Answer: 256
A × B has 2 × 4 = 8 ordered pairs. Every subset of A × B is a relation, so the number of relations = 28 = 256.
12.
Let A = {1, 2, 3} and R = {(3, 1)}. Find the minimum number of ordered pairs that must be added to R to make it an equivalence relation on A.
Show answer and solution
Answer: 4
The smallest equivalence relation containing R groups together elements linked by R. Its classes give 5 ordered pairs in all (including (1, 1), (2, 2), (3, 3) and the needed symmetric and transitive pairs).
Pairs to add = 5 − 1 = 4.
13.
Set A has 4 elements and set B has 4 elements. How many one-one functions from A to B are there?
Show answer and solution
Answer: 24
The first element of A has 4 choices of image, the next 3, and so on: 4 × 3 × 2 × 1 = 24.
14.
How many onto functions are there from a set with 3 elements to the set {a, b}?
Show answer and solution
Answer: 6
Total functions = 23 = 8. The two constant functions are not onto. Onto functions = 8 − 2 = 6.
15.
Let A = {1, 2, …, 8} and R = {(a, b) : a, b ∈ A, a divides b}. How many ordered pairs are in R?
Show answer and solution
Answer: 20
For each a, count the multiples of a up to 8: 8 + 4 + 2 + 2 + 1 + 1 + 1 + 1 = 20.
16.
How many functions are there from a set with 3 elements to a set with 2 elements?
Show answer and solution
Answer: 8
Each of the 3 elements can be sent to any of 2 elements: 23 = 8.
17.
Let A = {1, 2, 3} and R = {(1, 3)}. Find the minimum number of ordered pairs that must be added to R to make it an equivalence relation on A.
Show answer and solution
Answer: 4
The smallest equivalence relation containing R groups together elements linked by R. Its classes give 5 ordered pairs in all (including (1, 1), (2, 2), (3, 3) and the needed symmetric and transitive pairs).
Pairs to add = 5 − 1 = 4.
18.
Set A has 3 elements and set B has 3 elements. How many one-one functions from A to B are there?
Show answer and solution
Answer: 6
The first element of A has 3 choices of image, the next 2, and so on: 3 × 2 × 1 = 6.
19.
Let A = {1, 2, …, 4} and R = {(a, b) : a, b ∈ A, a divides b}. How many ordered pairs are in R?
Show answer and solution
Answer: 8
For each a, count the multiples of a up to 4: 4 + 2 + 1 + 1 = 8.
20.
Set A has 2 elements and set B has 3 elements. How many relations from A to B are possible?
Show answer and solution
Answer: 64
A × B has 2 × 3 = 6 ordered pairs. Every subset of A × B is a relation, so the number of relations = 26 = 64.

Original practice questions that follow the current NCERT Class 12 Mathematics syllabus. Not taken from past CBSE board papers.