Professional Documents
Culture Documents
MCQ On Relation & Function - 2
MCQ On Relation & Function - 2
Question 1.
If f(x1) = f (x2) ⇒ x1 = x2 ∀ x1, x2 ∈ A then the function f: A → B is
(a) one-one
(b) one-one onto
(c) onto
(d) many one.
Question 2.
What type of a relation is R = {(1, 3), (4, 2), (2, 4), (2, 3), (3, 1)} on the set A – {1, 2,
3, 4}
(a) Reflexive
(b) Transitive
(c) Symmetric
(d) None of these
Question 3.
Let E = {1, 2, 3, 4} and F = {1, 2} Then, the number of functions from E to F is
(a) 14
(b) 16
(c) 12
(d) 8
Answer: (b) 16
Question 4.
Let A = {1, 2, 3, 4,…. n} How many bijective function f : A → B can be defined?
(a) 12n
Page 1 of 8
MCQ on Relations and Functions-2
(d) n.
Answer:
Question 5.
If A = (1, 2, 3}, B = {6, 7, 8} is a function such that f(x) = x + 5 then what type of a
function is f?
(a) Many-one onto
(b) Constant function
(c) one-one onto
(d) into
Question 6.
Let the function ‘f’ be defined by f (x) = 5x² + 2 ∀ x ∈ R, then ‘f’ is
(a) onto function
(b) one-one, onto function
(c) one-one, into function
(d) many-one into function
Question 7.
What type of relation is ‘less than’ in the set of real numbers?
(a) only symmetric
(b) only transitive
(c) only reflexive
(d) equivalence
Page 2 of 8
MCQ on Relations and Functions-2
Question 8.
If A = [1, 2, 3}, B = {5, 6, 7} and f: A → B is a function such that f(x) = x + 4 then
what type of function is f?
(a) into
(b) one-one onto
(c) many-onto
(d) constant function
Question 9.
f: A → B will be an into function if
(a) range (f) B
(b) f(A) = B
(c) B f(A)
(d) f(B) A
Question 10.
If f : R → R such that f(x) = 3x then what type of a function is f?
(a) one-one onto
(b) many one onto
(c) one-one into
(d) many-one into.
Question 11.
A = {1, 2, 3} which of the following function f: A → A does not have an inverse
function
(a) {(1, 1), (2, 2), (3, 3)}
(b) {(1, 2), (2, 1), (3, 1)}
(c) {(1, 3), (3, 2), (2, 1)}
(d) {(1, 2), (2, 3), (3, 1)
Page 3 of 8
MCQ on Relations and Functions-2
Question 12.
Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be
defined as aRb if a 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
Question 13.
Consider the non-empty set consisting of children is a family and a relation R
defined as aRb If a is brother of b. Then R is
(a) symmetric but not transitive
(b) transitive but not symmetric
(c) neither symmetric nor transitive
(d) both symmetric and transitive
Question 14.
The maximum number of equivalence relations on the set A = {1, 2, 3} are
(a) 1
(b) 2
(c) 3
(d) 5
Answer: (d) 5
Question 15.
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is
(a) reflexive
(b) transitive
(c) symmetric
(d) None of these
Page 4 of 8
MCQ on Relations and Functions-2
Question 16.
Let us define a relation R in R as aRb if a ≥ b. Then R is
(a) an equivalence relation
(b) reflexive, transitive but not symmetric
(c) neither transitive nor reflexive but symmetric
(d) symmetric, transitive but not reflexive
Question 17.
Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,
3)}. Then R is
(a) reflexive but not symmetric
(b) reflexive-but not transitive.
(c) symmetric and transitive
(d) neither symmetric, nor transitive
Question 18.
If the 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) 5
Answer: (c) 0
Question 19.
Let A = {1, 2,3,…. n} and B = { a, b}. Then the number of surjections from A into
B is
(a) nP2
(b) 2n – 2
(c) 2n – 1
(d) 0
Answer: (b) 2n – 2
Page 5 of 8
MCQ on Relations and Functions-2
Question 20.
Let f : R → R be defined by f (x) = 1/x ∀ x ∈ R. Then f is
(a) one-one
(b) onto
(c) bijective
(d) f is not defined
Question 21.
x
Let f: R → R. be defined by f (x) = 3x² – 5 and g : R → R by g (x) = . Then g
x 1
2
o f is
Answer: (a)
Question 22.
Which of the following functions from Z into Z are bijective?
(a) f(x) = x³
(b) f(x) = x + 2
2
(c) f(x) =
x1
(d) f(x) = x² + 1
Question 23.
Let f: R → R be defined by
Answer: (a) 9
Question 24.
The relation R is defined on the set of natural numbers as {(a, b): a = 2b}. Then,
R-1 is given by
(a) {(2, 1), (4, 2), (6, 3),….}
(b) {(1, 2), (2, 4), (3, 6),….}
(c) R-1 is not defined
(d) R
Question 25.
The relation R = {(1,1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} on set A = {1, 2, 3} is
(a) Reflexive but not symmetric
(b) Reflexive but not transitive
(c) Symmetric and transitive
(d) Neither symmetric nor transitive
Question 26.
Let P = {(x, y) | x² + y² = 1, x, y R]. Then, P is
(a) Reflexive
(b) Symmetric
(c) Transitive
(d) Anti-symmetric
Question 27.
Let R be an equivalence relation on a finite set A having n elements. Then, the
number of ordered pairs in R is
(a) Less than n
(b) Greater than or equal to n
(c) Less than or equal to n
(d) None of these
Page 7 of 8
MCQ on Relations and Functions-2
Question 28.
For real numbers x and y, we write xRy ⇔x – y + √2 is an irrational number.
Then, the relational R is
(a) Reflexive
(b) Symmetric
(c) Transitive
(d) None of these
Question 29.
Let R be a relation on the set N be defined by {(x, y) | x, y ∈ N, 2x + y = 41}. Then
R is
(a) Reflexive
(b) Symmetric
(c) Transitive
(d) None of these
Question 30.
Let R be a relation on the set N of natural numbers denoted by nRm ⇔n is a
factor of m (i.e. n | m). Then, R is
(a) Reflexive and symmetric
(b) Transitive and symmetric
(c) Equivalence
(d) Reflexive, transitive but not symmetric
Page 8 of 8