CLASS : XII(REVISION ASSIGNMENT) RELATION AND FUNCTIONS WORKSHEET -1 (02-01-2026)
Q.N Marks
(MULTIPLE CHOICE QUESTIONS)
1. Let A={3,5}. Then number of reflexive relations on A is 1
(A) 2 (B) 4 (C) 0 (D) 8
2. The number of possible symmetric relations on a set consisting of 4 elements is 1
(A) 512 (B)1024 (C)256 (D)32
3. . Let the relation R in the set 𝐴={𝑥εZ: 0 ≤ x ≤ 12 }, given by 1
𝑅={(𝑎,𝑏):|𝑎−𝑏| 𝑖𝑠 𝑎 𝑚𝑢𝑙𝑡𝑖𝑝𝑙𝑒 𝑜𝑓 4}. Then the equivalence class [1] is
(A){1,5,9} (B){0,1,2,5} (C){1} (D)A
4. A and B are two sets with m elements and n elements respectively(m < n). How many 1
onto functions can be defined from set A to set B?
(A) 0 (B)m! (C) n! (D) n m
5. A function f : R R be defined as f x x2 4 x 5 is: 1
(A) injective but not surjective (B) surjective but not injective
(C) both injective and surjective (D) neither injective nor surjective
3
6. For real x, let 𝑓(𝑥)= x .𝑇ℎ𝑒𝑛 1
(A) f is one-one but not onto on R (B) f is onto on R but not one-one.
(C) f is one-one and onto on R (D) f is neither one-one nor onto on R
A function f : R R defined by f x 4 3cos x is :
7. 1
(A) bijective (B) one-one but not onto
(C) onto but not one-one (D) neither one-one nor onto
1
8. The function f : N N is defined by 1
n 1
2 ,if n is odd
f n
n ,if n is even
2
The function f is
(A) bijective (B) one-one but not onto
(C) onto but not one-one (D) neither one-one nor onto
9. The number of bijective functions from a set A with n elements to itself is: 1
(A) n (B) n 2 (C) n! (D) 2 n
10. The relation R in the set {1, 2, 3} given by R 1, 2 , 2,1 , 1,1 is 1
(A) Symmetric and transitive, but not reflexive
(B) Reflexive and symmetric, but not transitive
(C) Symmetric, but neither reflexive nor transitive
(D) An equivalence relation
11. A relation R on set A={𝑥:𝑥∈𝑍 𝑎𝑛𝑑 0≤𝑥≤10} as R={(x,y):x=y} is given to be an 1
equivalence relation. The number of equivalence classes is
(A)1 (B)2 (C)10 (D)11
12. Let f : R 5, be defined as f x 9 x 6 x 5 , where R is the set of all non-negative 1
2
real numbers. Then, f is :
(A) one-one (B) onto
(C) bijective (D) neither one-one nor onto
13. A relation R is defined on Z as aRb if and any only if a 2 7ab 6b 2 0 . Then R is 1
(A) Reflexive and Symmetric (B) Symmetric but not reflexive
(C) Transitive but not reflexive (D) Reflexive but not symmetric
14. Let R be a relation in the set N given by R a, b : a b 2, b 6 . Then 1
(A) 8,7 R (B) 6,8 R
(C) 3,8 R (D) 2, 4 R
15. A relation R is set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the 1
following ordered pair in R shall be removed to make it an equivalence relation in A?
(A) (1, 1) (B) (1, 2)
(C) (2, 2) (D) (3, 3)
16. ASSERTION AND REASON BASED QUESTIONS 1
Questions numbers 16 to 20 are Assertion and Reason based questions. Two statements are
given, one labelled Assertion (A) and the other labelled Reason (R).
Select the correct answer from the codes (A), (B), (C) and (D) as given below.
(A) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of
the Assertion (A).
(B) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation
of the Assertion (A).
(C) Assertion (A) is true, but Reason (R) is false.
(D) Assertion (A) is false, but Reason (R) is true.
2
Assertion (A): If n(A)=m, then the number of reflexive relation on A is m.
Reason(R ):A relation R on set A is said to be reflexive if (𝑎, 𝑎) ε 𝑅 ⩝ 𝑎 ε 𝐴.
17. Assertion (A) : If A and B are two sets having 3 and 5 elements respectively, then the total 1
number of functions that can be defined from A to B is 53
Reason ( R): A function from set A to set B relates elements of set A to elements of set B.
18. Assertion (A):The relation 𝑓: {1,2,3,4}→{𝑥, 𝑦, 𝑧, 𝑝} defined by 𝑓 = {(1, 𝑥), (2, 𝑦), (3, 𝑧)} is a 1
bijective function
Reason (R): The relation 𝑓: {1,2,3,4}→{𝑥, 𝑦, 𝑧, 𝑝} defined by
𝑓 = {(1, 𝑥), (2, 𝑦), (3, 𝑧), (4, 𝑝)} is one-one.
𝑓: 𝑋 → 𝑋 is a function on the finite set X.
19 Assertion (A): If f is onto, then f is one-one and if f is one-one, then f is onto..
Reason (R): Every one-one function is always onto and every onto function is always
one-one. 1
20. If X = {0, 2, 4, 6, 8}. P is a relation on X defined by P = {(0, 2), (4, 2), (4, 6), (8, 6), (2, 4), (0, 4)}. 1
Assertion (A): The relation P on set X is a transitive relation.
Reason (R): The relation P has a subset of the form {(a, b), (b, c), (a, c)}, where a, b, c ∈ X is
transitive.