1) Relations and Functions - Questions
1) Relations and Functions - Questions
View Explanations
2𝑥-1
2) Let f : N → R be the function defined by f(x) = and g : Q→R be another function
2
3
defined by g(x) = x+2. Then (g𝑜f) is ?
2
(a) 2
(b) 1
(c) 3
(d) 7/3
View Explanations
𝟒(𝟏-𝒙)
(a)
𝟏+𝒙
𝟖𝒙(𝟏-𝒙)
(b)
(𝟏+𝒙)𝟐
𝟏-𝟒𝒙+𝟒𝒙𝟐
(c)
𝟏+𝟒𝒙+𝟒𝒙𝟐
𝟏-𝟒𝒙+𝟒𝒙𝟐
(d)
𝟏+𝟒𝒙-𝟒𝒙𝟐
View Explanations
4) Let f, g and h be functions from R to R, then
(a) (f+g)𝑜h = f𝑜h+g𝑜h
(b) (f+g)𝑜h = f𝑜h+h𝑜g
(c) (f+g)𝑜h = h𝑜(f+g)
(d) (f+g)𝑜h = h𝑜f+g𝑜h
View Explanations
View Explanations
6) Let f : [2, ∞)→ R be the function defined by f(x) = x2-4x+5, then the range of f is
(a) [4, ∞)
(b) [5, ∞)
(c) R
(d) [1, ∞)
View Explanations
View Explanations
𝑎𝑥
8) Let f(x)= , x≠1. Then for what value of a is f(f(x)) = x?
𝑥+1
(a) -√2
(b) -1
(c) 1
(d) √2
View Explanations
9) Let Y = {n2 : n ∈ N} ⊂ N. consider f : N →Y as f(n)= n2. Inverse of f is
(a) y2
(b) y2+2
(c) y2+1
(d) √𝑦
View Explanations
View Explanations
View Explanations
View Explanations
13) If f : R→R and g: R→R defined by f(x) = 2x+3 and g(x) = x2+7, then the value of x for
which f(g(x)) = 25 is
(a) ±2
(b) ±1
(c) ±4
(d) ±3
View Explanations
14) If f : R→R and g : R→R are given by f(x) = cosx and g(x) = 3x2. Then
(a) f is odd
(b) g is odd
(c) g𝑜f≠f𝑜g
(d) g𝑜f=f𝑜g
View Explanations
3𝑥+2
15) If f(x) = , then
5𝑥-3
(a) f-1(x) = f(x)
(b) (f𝑜f)(x) = -x
(c) f-1(x) =-f(x)
1
(d) f-1(x)= - f(x)
19
View Explanations
𝑥2
16) If the function 𝑓: 𝑅 → 𝐴 given by 𝑓 (𝑥 ) = 2 is a surjection, then 𝐴 =
𝑥 +1
a) R
b) [0,1]
c) (0,1]
d) [0,1)
View Explanations
View Explanations
1+𝑥 3 𝑥+𝑥 3
19) Given 𝑓 (𝑥 ) = 𝑙𝑜𝑔 ( ) and 𝑔(𝑥 ) = , then 𝑓𝑜𝑔 (𝑥) equals
1-𝑥 1+3 𝑥 2
a) -𝑓(𝑥)
b) 3𝑓(𝑥 )
c) [𝑓(𝑥 )]3
d) None of these
View Explanations
20) Let f and g be two functions such that Rg ⊂Df, then domain of the function (f𝑜g)(x)=
f(g(x)) is
(a) Φ
(b)Df
(c)Dg
(d) Rg
View Explanations
View Explanations
22) Let f : A → B and g : B →C be two functions. Then the composition of f and g, denoted by g 𝑜
f, is defined as
(a) f(g(x)), ∀x∈ A
(b) g(f(x+2)), ∀x∈ A
(c) g(f(x)), ∀x∈ A
(d) g(f(x2)), ∀x∈ A
View Explanations
View Explanations
24) Let f : A→B and g : B→C be the two bijective functions. Then (g𝑜f)-1 is
(a) g𝑜f
(b) f-1𝑜g-1
(c) g-1𝑜f-1
(d) f𝑜g
View Explanations
View Explanations
26) Let A = {1, 2, 3, …, n} and B = {a, b}. then the number of surjections from A to B is
(a) nP2
(b) 2n
(c) 2n-2
(d) 2n-1
View Explanations
View Explanations
28) Let A = {1, 2, 3, 4, 5, 6}. Which of the following partitions of A to an equivalence relation
on A?
(a) {1, 2, 3}, {4, 5, 6}
(b) {1, 2, 3}, {3, 4, 5, 6}
(c) {1, 2}, {3, 4}, {2, 3, 5, 6}
(d) {1, 3}, {2, 4, 5}, {6}
View Explanations
29) R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is
(a) not antisymmetric
(b) symmetric
(c) Anti symmetric
(d) Reflexive
View Explanations
30) Which of the following is not an equivalence relation on I, the set of integers : x, y
(a) xRy, x+y is an even integer
(b) xRy, x = y
(c) xRy, x ≤y
(d) xRy, x-y is an even integer
View Explanations
31) Let R = {(x, y) : x2 +y2 = 1 and x, y, ∈R} be a relation in R. The relation R is
(a) Symmetric
(b) Anti-symmetric
(c) Reflexive
(d) Transitive
View Explanations
32) Let A = {1, 2, 3}, then the relation R = {(1, 1), (1, 2), (2, 1)} on A is
(a) Reflexive
(b) Symmetric
(c) Transitive
(d) None of these
View Explanations
33) Let A = {1, 2, 3}, then the domain of the relation R = {(1, 1), (2, 3), (2, 1)} defined on A is
(a) {1, 3}
(b) {1, 2}
(c) None of these
(d) {1, 2, 3}
View Explanations
34) Let us define a relation R in R(set of real numbers) as aRb is a≥b. Then R is
(a) neither transitive nor reflexive
(b) an equivalence relation
(c) symmetric, transitive but nor reflexive
(d) reflexive, transitive but not symmetric
View Explanations
35) 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) neither symmetric, nor transitive
(b) symmetric and transitive
(c) reflexive but not symmetric
(d) reflexive but not transitive
View Explanations
36) Let f : A →B, (for any two non-empty sets A and B), then f is invertible is
(a) f is many-one
(b) f is both one-one and onto
(c) f is one-one
(d) f is onto
View Explanations
View Explanations
View Explanations
View Explanations
View Explanations
41) S function f : X →Y is said to be one-on and onto is
(a) f is one-one
(b) f is onto
(c) f is both one-one and onto
(d) f is either one-one or onto
View Explanations
42) If A is a finite set containing n distinct elements, then the number of relations on A is equal
to
2
(a) 2𝑛
(b) 2n
(c) n2
(d) 2×2
View Explanations
43) Let L be the set of all lines in a plane and R be the relation on L defined as R = {(L1, L2): L1
is perpendicular to L2}. Then R is
(a) symmetric and transitive but not reflexive
(b) reflexive and transitive but not symmetric
(c) symmetric and reflexive but not transitive
(d) symmetric but neither reflexive nor transitive
View Explanations
44) Let A = {a, b, c} and R = {(a, a), (b, b), (c, c)} be a relation on A. here, R is
(a) Transitive
(b) Anti-symmetric
(c) Symmetric
(d) Reflexive
View Explanations
View Explanations
46) Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?
(a) {(1, 1), (2, 2), (3, 3), (2, 3), (3, 2)}
(b) {(1, 1), (2, 2), (3, 3)}
(c) none of these
(d) {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}
View Explanations
View Explanations
48) 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 is congruent to b, a, b∈T. Then R is
(a) an equivalence relation
(b) neither reflexive nor symmetric
(c) transitive but not symmetric
(d) reflexive but not transitive
View Explanations
CASE STUDY QUESTIONS
49) A relation 𝑅 on a set 𝐴 is said to be an equivalence relation on 𝐴 iff it is
• Reflexive i.e., (𝑎, 𝑎) ∈ 𝑅∀𝑎 ∈ 𝐴
• Symmetric i.e., (𝑎, 𝑏) ∈ 𝑅 ⇒ (𝑏, 𝑎) ∈ 𝑅∀𝑎, 𝑏 ∈ 𝐴
• Transitive i.e., (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑐) ∈ 𝑅 ⇒ (𝑎, 𝑐) ∈ 𝑅∀𝑎, 𝑏, 𝑐 ∈ 𝐴
Based on the above information, answer the following questions.
(i) If the relation 𝑅 = {(1,1), (1,2), (1,3), (2,2), (2,3), (3,1), (3,2), (3,3)} defined on the set
𝐴 = {1,2,3}, then 𝑅 is
(a) reflexive
(b) symmetric
(c) transitive
(d) equivalence
(ii) If the relation 𝑅 = {(1,2), (2,1), (1,3), (3,1)} defined on the set 𝐴 = {1,2,3}, then 𝑅 is
(a) reflexive
(b) symmetric
(c) transitive
(d) equivalence
(iii) If the relation 𝑅 on the set 𝑁 of all natural numbers defined as 𝑅 = {(𝑥, 𝑦): 𝑦 = 𝑥 + 5
and 𝑥 < 4}, then 𝑅 is
(a) reflexive
(b) symmetric
(c) transitive
(d) equivalence
(iv) If the relation 𝑅 on the set 𝐴 = {1,2,3, … … . ,13,14} defined as 𝑅 = {(𝑥, 𝑦): 3𝑥 − 𝑦 = 0},
then 𝑅 is
(a) reflexive
(b) symmetric
(c) transitive
(d) None of these
(v) If the relation 𝑅 on the set 𝐴 = {1,2,3} defined as 𝑅 = {(1,1), (1,2), (1,3), (2,1)
(2,2), (2,3), (3,1), (3,2), (3,3)}, then 𝑅 is
(a) reflexive only
(b) symmetric only
(c) transitive only
(d) equivalence
View Explanations
𝑥−1
50) Consider the mapping 𝑓: 𝐴 → 𝐵 is defined by 𝑓(𝑥) = such that 𝑓 is a bijection. Based on
𝑥−2
the above information, answer the following questions.
(i) Domain of 𝑓 is
(a) 𝑅 − {2}
(b) 𝑅
(c) 𝑅 − {1,2}
(d) 𝑅 − {0}
(ii) Range of 𝑓 is
(a) 𝑅
(b) 𝑅 − {1}
(c) 𝑅 − {0}
(d) 𝑅 − {1,2}
View Explanations