Relations and Functions MCQs

Download as pdf or txt
Download as pdf or txt
You are on page 1of 9

CLASS-XII

CHAPTER-01
RELATION AND FUNCTION
01 MARK TYPE QUESTIONS

Q. QUESTION MARK
No.
1 Let A be the set of all human beings of a joint family living in TATA NAGAR. 1
Then the relation defined as: R = {(x, y) : x is wife of y} is ---------
(a) reflexive (b) symmetric
(c) transitive (d) none of these
2 Let A be the set of all human beings living in a joint family in Cuttack. 1

Then the relation in set A defined as:


R = {(x, y) : x is father of y} is -----------------
(a) reflexive (b) symmetric
(c) transitive (d) none of these
3 Let L be the set of all lines in XY-plane and R be the relation in L defined as R = {L1, L2): L1 is 1
parallel to L2}.

Which of the following lines related to the line 3𝑥 − 𝑦 − 1=0.


(a) 6𝑥 − 𝑦 + 1 = 0 (b) 6𝑥 − 2𝑦 – 3 = 0
(c) 3𝑥 + 𝑦 + 1 = 0 (d) 9𝑥 + 3𝑦 + 5 = 0
4 Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2), (2,3) and (1, 3) is -------- 1
--
(a) 1 (b) 2
(c) 3 (d) 4
5 Consider a group consisting four friends. 1

Then the number of symmetric relations defined in that group is ---------------


(a) 2 (b) 2
(c) 2 (c) 2
6 Jim and Jeny are solving some problems on relations and functions. Jim has a set A containing 1
four natural numbers and Jeny has a set B containing three alphabets.

Jim wants to find the number of all possible onto functions from A to B. What will be his
answer?
(a) 3 (b) 4 (c) 0 (d) 36
7 The function f: N→N defined by f(x) = x – 1 and 1

f(1) = f(2) = 1 for every x > 2 is

(a) One-one and onto (b) One-one but not onto

(c) Onto but not one-one (d) Neither one-one nor onto

8 Let A be the set of all 50 students of Class X in a school. 1


Let f : A → N be function defined by f (x) = roll number of the student x.
(a) f is neither one-one nor onto.
(b) f is one-one but not onto
(c ) f is not one-one but onto
(d) none of these
9 For real numbers 𝑥 and 𝑦, define 𝑥𝑅𝑦 if and only if 𝑥 – 𝑦 + √2 is an irrational number. Then the 1
relation R is ------------
(a) reflexive only
(b) reflexive, symmetric but not transitive
(c) equivalence relation
(d) neither reflexive nor symmetric nor transitive
10 Assertion(A): If n (A) =p and n (B) = q then the number of relations from A to B is 2pq. 1
Reason(R): A relation from A to B is a subset of AXB.
Which of the following options is correct?
(a) Both A and R are true and R is correct explanation of A
(b) Both A and R are true and R is not the correct explanation of A
(c) A is true but R is false
(d) A is false but R is true
11 Let R be a relation on the set N given by R = {(a, b) : a = b - 2, b > 6}. Then 1

12 Which of the following is not an equivalence relation on Z? 1

13 Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive 1
and symmetric but not transitive is-
a)1
b)2
c)3
d)4
14 The relation 'R' in N × N such that (a, b) R (c, d) <=> a+d = b+c 1
a) reflexive but not symmetric
b) reflexive and transitive but not symmetric
c) an equivalence relation
d) none of these
15 If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by 'x is greater than y'. The 1
range of R is
{1, 4, 6, 9}
{4,6,9}
{1}
None of these
16 f : R ----> R given by f(x) = x + √x2 1
(a)Injective
(b) surjective
(c) bijective
(d) none of these
17 The function f : R → R defined by f(x) = 2x + 2|x| is 1
(a) one-one and onto
(b) many-one and onto
(c) one-one and into
(d) many-one and into
18 The range of the function f (x) = 7-xPx-3 is 1
(a) {1, 2, 3, 4, 5}
(b) {1, 2, 3, 4, 5, 6}
(c) {1, 2, 3, 4}
(d) {1, 2, 3}
19 Which of the following functions from Z to itself are bijections? 1
(a) f(x) = x3
(b) f(x) = x + 2
(c) f(x) = 2x + 1
(d) f(x) = x2 + x

20 if a function f : [2, ∞) → B defined by f(x) = x2- 4x + 5 is a bijection, then B = 1


(a) R
(b) [1, ∞)
(c) [4, ∞)
(d) [5, ∞)

21 In an assembly line, let us consider two machines A & B working in an arranged manner. If the 1
machine were setup in such a manner that the materials input in machine B is the product of
materials obtained from the machine A. Then, what type of work can this be considered as:
(a) Binary function
(b) Bijective function
(c) Composition of function
(d) Trivial relation

22 When we apply for any qualifying examinations like SSB, NET, etc.., we were provided with an 1
application ID number. In order to have confidentiality, each ID were assigned with the
password provided by the board in-charge of the examination, which is to be inserted at the
time of examination. What type of function is found in this example?
(a) One-one onto function
(b) One-one into function
(c) One-one function
(d) None of these

23 While shopping in the market, we use many methods of calculation (namely addition, 1
subtraction, multiplication, division). We observe that we mainly use two numbers to use these
operators. Even when there are three numbers, we first use the first two umbers and the result
is then used along with third number. Thus, addition, subtraction, multiplication, division are
considered to be binary operators. Assume that the numbers you have come across belong to
the natural number. Then, which of the following statement is false according to the above
condition?
(a) Addition & subtraction are binary operators in N.
(b) Subtraction & division are not binary operators in N.
(c) Addition is binary operators in N.
(d) Multiplication is binary operator in N.

24 Assertion-Reason Based Question: 1


Each question consists of two statements, namely, Assertion (A) and Reason (R). Mark your
answer as per the codes provided below:
(1) Both A and R are true and R is the correct explanation of A.
(2) Both A and R are true but R is not the correct explanation of A.
(3) A is true but R is false.
(4) A is false but R is true.

Assertion (A): If we consider two function f & g, and the outcome of f become the input of g, for
it to be called composition of function.

Reason (R): Two function f & g is a composite function (i.e., gof) exists iff range of f is a subset of
domain of g.
25 Consider two machine A & B, for it to be working in an arranged manner, the materials of B 1
come from the product/output of machine A. if we change the method of inserting the material
i.e.., if the material A gets its material directly from the product of machine B. Then, could the
machine work in the same manner as before?
(a) No, the machine will not work for the second case in the same manner as before.
(b) Yes, it will work.
(c) No, it will not work because the composition of two function is not commutative in
nature.
(d) Can’t say
26 Let us consider a group of all prime number and a group of all even numbers. So, when we 1
construct a pair containing the data from both the group. What type of relation did we get?
(a) Reflexive relation
(b) Symmetric relation
(c) Transitive relation
(d) Equivalence relation
27 During a lecture session provided by Pawan sir on topic sets, he has pointed out main topics 1
along with some frequently asked question. If we consider all the concept provided by him to be
in a group and the outcome contains all the doubts asked by the students. Then, according to
the above-mentioned concept, which of the following statements is consider to be false?
(a) The group contain all the provided concept can be called domain of the relation.
(b) The unsolved question asked by the students is called codomain of the relation.
(c) The group containing all the provided concept can be called codomain of the relation
(d) The range of the relation is all those questions related to concept being taught by sir.
28 In order to make ice-cream, we need milk, sugar, water & any food essence to be put in the ice- 1
cream maker. The expected outcome will be obviously ice-cream of that particular food
essence. Which of the following represent this given example?
(a) Function
(b) Relation
(c) Trivial relation
(d) None of these
29 In order to maintain the voltage, we need stabilizers. In stabilizers, whatever measurement of 1
voltage like for example 200V, 220V, 240V, even 260V of voltage is passed, the output will
always be 240V, because the work of the stabilizer is to give a constant voltage in return. This is
example shows what type of function?
(a) One-one function
(b) One-many function
(c) Onto function
(d) Many-one function
30 Assertion-Reason Based Question: 1
Each question consists of two statements, namely, Assertion (A) and Reason (R). Mark your
answer as per the codes provided below:
(1) Both A and R are true and R is the correct explanation of A.
(2) Both A and R are true but R is not the correct explanation of A.
(3) A is true but R is false.
(4) A is false but R is true.
Assertion (A): If we consider two function R and N containing the roll number and name of Class
X students. We observe that while compositing R & N, to get RoN, first R then N is applied, while
in reverse process, first the reverse process of N is applied and then reverse process of R is
applied. Both the process is applicable.
Reason (R): Inverse is defined only for the function which is onto function.
31 Raju has a unique type of ludo die on which each number of {1,2,3} appear on two faces of the
die then Maximum number of equivalence relations on the set A={1,2,3} are ?

(A) 1 1
(B) 2
(C) 3
(D) 5

32 Ramesh has two natural number i.e. a and b and fix a relation R between a and b which is given
mathematically as
R ={(a,b) :a=b-2,b>6} then What is your view about type of R?
1
(A) Reflexive
(B) Symmetric only
(C) Non-Transitive
(D) Equivalence
33 A students have 3 pen and 4 pencil. Then number of injective mapping that can be defined from
set of pen to set of pencil is.

(A) 144 1
(B) 24
(C) 12
(D) 64
34 ; 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑.
The function 𝑓: 𝑁 → 𝑁 is defined by 𝑓(𝑛) = The function 𝑓 𝑖𝑠.
; 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛.

(A) Bijective 1
(B) One-one but not onto
(C) Onto but not one-one
(D) Neither one-one nor onto

35 A teacher of Maths defines a function in front of the students of class-12 such that 𝑓: 𝑅 → 𝑅 is
1
defined by 𝑓(𝑥) = 4 + 3 cos 𝑥 and ask them to check the type of function.
(A) Bijective (B) One-one but not onto
(C) Onto but not one-one (D) Neither one-one nor onto

36 The function 𝑓: 𝑅 → 𝑅 is defined by 𝑓(𝑥) = 2 + 𝑥 is

(A) Neither one-one nor onto


(B) Not One-one 1
(C) One-one
(D) Not onto.

37 Two students are playing a game “They count the number of students in two different class in
their school” A there are four relation defined on these sets as follow which of the following is
the reflexive relation.

(A) R ={(x,y) ; x>y x,y>N}


(B) R ={(x,y) ;x.yis the square number x,y>N}
(C) R ={(x,y) ;x+y=10 ; x,y>N}
(D) R ={(x,y) ;x+4y=10 ; x,y>N}

38 Let L denotes the set of all straight line in a plane. Let a relation R defined by l R m if and only if l
is perpendicular to m.

(A) Reflexive
1
(B) Symmetric only
(C) Non-Transitive
(D) None of these

39 The following questions consist of two statements-Assertion (A) and Reason (R).Answer these
questions selecting the appropriate option given bellow:
(a) Both A and R are true and R is the correct explanation for A
(b) Both A and R are true and R is not correct explanation for A
1
(c) A is true and R is false.
(d) A is false and R is true.

Assertion (A): Let A ={1,2,3} then the relation on A as R={(1,2),(2,1)} R is not transitive relation
Reason (R) :A relation R defined on a non empty set A is said to be transitive relation if (a,b),
(b,c) 𝜖 R ⇒ (a,c) 𝜖 R

40 The following questions consist of two statements-Assertion (A) and Reason (R).Answer these
questions selecting the appropriate option given bellow:
(a) Both A and R are true and R is the correct explanation for A
(b) Both A and R are true and R is not correct explanation for A
(c) A is true and R is false.
(d) A is false and R is true. 1

Assertion (A): Let 𝑓: 𝑅 → 𝑅 such that 𝑓(𝑥) = 𝑥 the function


f is an onto function.
Reason (R) : A function Let 𝑔: 𝐴 → 𝐵 is said to be onto function if g(A)=B ie.range of g=B

41 Let R be a relation on the set N given by R = { (a,b) : a = b-2,b > 6} then, 1


(a) (2,4) ∈ 𝑅 (b) (3,8) ∈ 𝑅 (c) (6,8) ∈ 𝑅 (d) (8,7) ∈ 𝑅

42 If A ={ a,b,c} then the relation R ={(b,c)} on A is 1


(a) Reflexive only (b) Symmetric only (c) Transitive only (d) reflexive & transitive only
43 The relation R in NXN such that (a,b) R (c,d) → a+d = b+c is 1
(a) Reflexive but not symmetric
(b) reflexive & transitive but not Symmetric
(c) Equivalence relation (d) none of these
44 The relation S defined on the set R of all real number by the rule a S b iff a ≥ b is 1
(a) An equivalence relation
(b) reflexive & transitive but not Symmetric
(c) Symmetric, transitive & but not reflexive
(d) Neither transitive nor reflexive but symmetric
45 The maximum number of equivalence relations on the set A = { 1,2,3} is 1
(a) 1 (b) 2 (c) 3 (d) 5
46 The function f: f:R → R ,given by f(x)=cosx is 1
(a) One-one (b) many one (c) onto (d) neither one-one nor onto
47 Let R be the relation on N defined by x+2y=8. The domain of R is 1
(a) {2,4,8} (b) {2,4,6,8} (c) {2,4,6} (d) {1,2,3,4}
48 If A{1,2,3}, B={1,4,6,9} and R be the relation from A to B defined by “x greater than y”. The range 1
of R is
(a) {1,4,6,9} (b) {4,6,9} (c) {1} (d) none of these
49 If R is the largest equivanence relation on a set A & S in any relation on A then 1
(a) 𝑅 ⊂ 𝑆 (b) S⊂ 𝑅 (c) 𝑅 = 𝑆
(d) none of these

50 , 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑 1
The function f:N → N ,given by f(x) = 𝑖𝑠
, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
(a) One-one (b) many one -onto (c) onto (d) many one -into
51 The relation 𝑅 on the set 𝐴 = {𝑎, 𝑏, 𝑐} given by 1
𝑅 = {(𝑎, 𝑏), (𝑏, 𝑎), (𝑐, 𝑐)} is

(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
52 The number of reflexive relations on a set 𝐴 consisting of 𝑛 elements is equal to 1

(a) 2 (b) 𝑛 (c) 2 ( ) (d) 𝑛 − 𝑛


53 The number of symmetric relations on set A = {1, 2, 3, 4} is 1
(a) 2 (b) 2 (c) 2 (d) 2
54 The number of equivalence relations in the set {1, 2, 3} 1
containing the elements (1, 2) and (2, 1) is

(a) 0 (b) 1 (c) 2 (d) 3


55 The maximum number of equivalence relation on the set 𝐴 = {1, 2, 3} 1
(a) 1 (b) 2 (c) 3 (d) 5

56 Set 𝐴 contains 5 elements and set 𝐵 contains 6 elements, then the number of one-one mapping 1
from
𝐴 to 𝐵 is
(a) 720 (b) 120 (c) 6 (d) 5
57 The function 𝑓: 𝑅 → 𝑅 defined as 𝑓(𝑥) = 𝑥 is 1
(a) one-one but not onto
(b) not one-one but onto
(c) neither one-one nor onto
(d) one-one and onto
58 Let 𝐴 = {1, 2,3, … … 𝑛} and 𝐵 = {𝑎, 𝑏}. Then the number of surjections from 𝐴 into 𝐵 is 1
(a) 𝑛 (b) 2 − 2 (c) 2 − 1 (d) none of these

59 The function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 4 + 3 cos 𝑥 is 1


(a) bijective
(b) one-one but not onto
(c) onto but not one-one
(d) neither one-one nor onto
60 Which of the following functions from 𝑍 to 𝑍 is a bijection? 1
(a) 𝑓(𝑥) = 𝑥
(b) 𝑔(𝑥) = 𝑥 + 2
(c) 𝑓(𝑥) = 2𝑥 + 1
(d) 𝑓(𝑥) = 𝑥 + 1

You might also like