Scribd
Upload
13 views4 pages

Relation MCQ 12.5.2025

This document is a worksheet for Class XII Mathematics focusing on Relations and Functions, containing multiple-choice questions (MCQs) that assess students' understanding of various concepts related to functions, relations, and mappings. The questions cover topics such as one-one and onto functions, equivalence relations, and properties of specific functions. Each question provides four answer options, allowing students to select the correct response.

Uploaded by

priyankarj8f
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views4 pages

Relation MCQ 12.5.2025

This document is a worksheet for Class XII Mathematics focusing on Relations and Functions, containing multiple-choice questions (MCQs) that assess students' understanding of various concepts related to functions, relations, and mappings. The questions cover topics such as one-one and onto functions, equivalence relations, and properties of specific functions. Each question provides four answer options, allowing students to select the correct response.

Uploaded by

priyankarj8f
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

KENDRIYA VIDYALAYA SANGATHAN AHMEDABAD REGION

CLASS XII MATHEMATICS (041) Type your text


WORKSHEET 1 DATE:12.05.2025
CHAPTER 1: RELATIONS AND FUNCTIONS

MCQs

Q. 1: - A function f: R + → R where R + is the set of all non negative real numbers


defined by f(x) = 4 x + 3 is :
(a) One-one but not onto
(b) Onto but not one-one
(c) Both one-one and onto
(d) Neither one-one nor onto

Q. 2: - Let f : R + → [ - 5, ∞ ) be defined as f(x) = 9 x2 + 6 x – 5 , where R + is the


set of all non-negative real numbers.Then f is:
(a) One-one (b) onto
(c) bijective (d) neither one-one nor onto

Q. 3: - Let R be a relation on the set N of natural numbers defined by n R m if n


divides m. Then R is

(a) Reflexive and symmetric


(b) Transitive and symmetric
(c) Equivalence
(d) Reflexive , transitive but not symmetric
The maximum number of equivalence relations on the set A = (1,2,3)
Q. 4: -
are :
(a) 1 (b) 2 (c ) 3 (d) 5

Q. 5: - If 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:
(a) 720 (b) 120 (c)0 (d) None of these

Q. 6: - Let f : R → R be defined by f(x) = 1/x ∀ x ∈ R .Then f is

(a) One-one (b) onto (c) bijective (d) None of these


Q. 7: - Set A has 3 elements , and 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

Q. 8: - A mapping f: A →B defined as f (x) = 2𝑥+3, x ∈A Iff is to be onto thenwhat


3𝑥+5
are A and B equal to ?
(a) A = R – { -5/3} and B = R – { -3/2}
(b) A = R and B = R – {-5/3}
(c) A = R –{-3/2} and B = R – {0}
(d) None of these

Q. 9: - Let T be the set of all triangles in the Euclidean plane , and let a relation R
on T be defined as a R b if a is congruent to b ∀ a , b ∈ T Then R is
(a) Reflexive but not transitive
(b) Transitive but not symmetric
(c) Equivalence
(d) None of these

Q. 10: -The greatest integer function f(x) = [x] is


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

Q. 11: -Let A = {1,2,3,…n} and B = {a,b} .Then the number of surjections from A
into B is
(a) 𝑃2𝑛 (b) 2 n-2 (c) 2 n-1 (d) None of these

Q. 12: -The relation R = {(1,2) (1,3)} on set A = {1,2,3} is


(a) Neither reflexive nor symmetric nor transitive
(b) Symmetric and transitive
(c) Reflexive and transitive
(d) Neither reflexive nor symmetric but transitive

Q. 13: -Let f: N → N defined by f(x) = x2 + x +1 is


(a) One-one and onto
(b) One-one but not onto
(c) Not one-one but onto
(d) Neither One-one nor onto

Q. 14: -Possible reflexive relation in a set A whose n(A) = 3 are


(a) 2 3 (b) 2 5 (c) 2 6 (d) 3 6
Q. 15: -Let A = {1,2,3}.Then the 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

Q. 16: -Let f: R → R be defined as f(x) = x 4.Then


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

Q. 17: -Let 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12} and R be a relation on A defined as𝑅 =


{(𝑎, 𝑏): 𝑎, 𝑏 ∈ 𝐴, |𝑎 − 𝑏| 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 4} . The equivalence class of 2 is:
(a) { 2,6,10 }
(b) { 0,4,8,12}
(c) { 0,2,4,6,8,10,12}
(d) { 4,8}

Q. 18: -Let 𝑓 ∶ 𝑅 → 𝑅 be defined by 𝑓 (𝑥) = 𝑥 2 + 1 . Then, pre-images of 17and


– 3, respectively, are:

(a) 𝜙 , {4,-4}
(b) {3, −3} , 𝜙
(c) {4,-4}, 𝜙
(d) {4,-4} , { 2,-2}

Q. 19: -Let f : [3, ∞ ) → B given by f(x) = x 2 – 6 x +14 is a bijection , then B is


equal to
(a) [3, ∞ ) (b) [5, ∞ ) (c) (5, ∞ ) (d) R

For real numbers x and y, we write x R y ↔ x – y + √2 is an irrational


Q. 20: -
number. Then the relation R is
(a) Reflexive (b) Symmetric (c) Transitive (d) None of these
Let A = {1, 2, 3}and R = {(1, 2), (2, 3)} be a relation in A. Then, the
Q. 21: -
minimum number of ordered pairs may be added, so that R becomes an
equivalence relation, is
(a) 7 (b) 5 (c) 1 (d)4
Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1,
Q. 22: -
3) which are reflexive and symmetric and transitive, is
(a) 1 (b) 2 (c) 3 (d) 4

Let f : R → R be a function defined by f(x) =𝑥 3 + 4, then f is


Q. 23: -
(a) Injective (b) Surjective (c) Bijective (d) None of these
Let g: R→R g(x) = 𝑥 2 – 4x – 5, then
Q. 24: -
(a) g is one-one on R (b) g is not one-one on R
(c) g is bijective on R (d) None of these
Let A = {1, 2, 3} and B = {a, b, c}, then the number of bijective functions
Q. 25: -
from A to B are
(a) 2 (b) 8 (c) 6 (d) 4
The number of surjective functions from A to B where A = {1, 2, 3, 4} and
Q. 26: -
B = {a, b} is
(a) 14 (b) 12 (c) 2 (d) 15
The function f : R → R defined by f (x) = (x – 1) (x – 2) (x – 3) is
Q. 27: -
(a) one-one but not onto (b) onto but not one-one
(c) both one-one and onto (d) neither one-one nor onto
The relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} on set
Q. 28: -
A = {1, 2, 3} is
(a) Reflexive, not symmetric and transitive
(b) Reflexive, not symmetric and not transitive
(c) Reflexive, Symmetric and transitive
(d) Reflexive ,symmetric nor transitive

Q. 29: -In the following question, a statement of Assertion (A) is followed by a


statement of Reason (R). Choose the correct answer out of the following
choices.
(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 but (R) is true.
Assertion (A): The relation f: {1,2,3,4} ⟶ {x, y, z, p} defined by
f = {(1, x), (2, y), (3, z)} is a bijective function.
Reason (R): The function f: {1,2,3} ⟶ {x, y, z, p} such that f = {(1, x),
(2, y), (3, z)} is one-one.

Q. 30: -In the following question, a statement of Assertion (A) is followed by a


statement of Reason (R). Choose the correct answer out of the following
choices.
(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 but (R) is true.
Assertion(A): A relation R = {(a, b) :|a–b|< 2} defined on the set
A = {1,2,3,4,5} is reflexive.
Reason(R): A relation on the set A is said to be reflexive if (a, a) ∈ R ∀a ∈ A.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy