DM Unit 2 Functions Mcqs
DM Unit 2 Functions Mcqs
Let f : X →Y and g : Y → Z. Let h = go f : X If f is one-to-one If f is not onto then If f is not one-to-one If f is one-to-one
→ Z. Suppose g is one-to-one and onto.
6 then h is one-to- h is not onto. then h is not one-to- then h is one-to- A
Which of the following is FALSE?
one and onto. one. one.
Domain and Range of the function Y = x=3/2, y=0 x>3/2, y=0 x<3/2, y=0 x=3/2, y=0
7 –v(–2x + 3) is D
The relation { (1,2), (1,3), (3,1), (1,1), Reflexive Transitive Symmetric Asymmetric
8 B
(3,3), (3,2), (1,4), (4,2), (3,4)} is
A partial ordered relation is transitive, Anti-symmetric Bisymmetric Anti-reflexive. Asymmetric
9 A
reflexive and
Find the number of relations from A = 64 6 32 15
10 A
{cat, dog, rat} to B = {male , female}
Page 1
Relation and Function
Page 2
Relation and Function
4), (3, 5), (4, 6), (5, 1)}. Find g o.f (2).
class…
Let R be a relation on a set A = {1, 2, 3, reflexive and reflexive and symmetric and reflexive, but
4} given by R = {(1, 1), (1, 2), (1, 3), (2, symmetric, but transitive, but not transitive, but not neither symmetric
24 1), (2,2), (2, 3), (3, 1), (3, 2), (3, 3)}. not transitive. symmetric. reflexive. nor transitive. C
Then the relation is:
Page 3
Relation and Function
Consider the recurrence relation ak = -8ak-ak = (-3)k - (-5)k ak = k(-3)k - k(-5)k ak = k(-3)k - (-5)k ak = (-5)k - (-3)k
1 - 15ak-2 with initial conditions a0 = 0
28 and a1 = 2. Which of the following is an A
explicit solution to this recurrence
relation?
Consider the recurrence relation ak = 6ak- an = A3n + B3n an = A3n + B(-3)n an = A3n + nB3n an = A(-3)n + nB(-
1 - 9ak-2 with initial conditions a0 = 0 3)n
and a1 = 2. Which of the following is an
29 explicit solution to this recurrence C
relation, provided the constants A and B
are chosen correctly?
The binary relation R = {(0, 0), (1, 1)} on Reflexive, Not Not Reflexive, Reflexive, Reflexive, Not
30 A = {0, 1, 2, 3, } is Symmetric, Symmetric, Symmetric, Not Symmetric, Not B
Transitive Transitive Transitive Transitive
Define a binary relation R = {(0, 1), (1, 16 arrows 12 arrows 8 arrows 6 arrows
2), (2, 3), (3, 2), (2, 0)} on A = {0, 1, 2,
31 3}. The directed graph (including loops) A
of the transitive closure of this relation
has
Let N+ denote the nonzero natural Reflexive, Not Not Reflexive, Reflexive, Reflexive, Not
numbers. Define a binary relation R on Symmetric, Symmetric, Symmetric, Not Symmetric, Not
32 N+ × N+ by (m, n)R(s, t) if gcd(m, n) = Transitive Transitive Transitive Transitive A
gcd(s, t). The binary relation R is
Page 4
Relation and Function
Page 5
Relation and Function
Which one of the following is the example Graph Binary Tree Queue Link List
39 of nonlinear data structure? A
44 Which statement represents "all numbers -4 > x > 8 -4 < x < 8 -4 > x < 8 None of these B
between negative 4 and positive 8" ?
Which interval notation represents the set (-1,9] [-1,9] (-1,9) [-1,9)
of numbers that are greater than or equal
45 D
to -1, but are less than 9?
Page 6
Relation and Function
Which statement is true about the relation It is a function It is a function It is not a function It is not a function
shown at the right? because there because there exists because there are because there are
47 exists one y- one x-coordinate multiple x-values multiple y-values C
coordinate for for each y- for a given y-value. for a given x-
each x-coordinate. coordinate. value.
A ball is tossed in the air in such a way 6 2 3 4
that the path of the ball is modeled by the
equation
48 y = -x² + 6x, where y represents the B
Page 7
Relation and Function
If A,B and C are non empty sets then (AXB)U(AXC) (AXB)∩(AXC) (AXB)∩C (AXC)∩B
53 AX(B∩C) is-----. B
If A,B and C are non empty sets then (AXB)U(AXC) (AXB)∩(AXC) (AXB)UC (AXC)UB
54 A
AX(BUC) is-----.
If R is a relation defined from set A to set R=AXB RCAXB RCBXA AXBCR
55
B then------ B
If A=(1,2,3} and R on A is defined by Reflexive Symmetric Transitive All of these
56 R={(1,1),(2,2),(3,3)} then R is…………
A
If A=(1,2,3} and R on A is defined by Reflexive and Reflexive and Symmetric and All of the above.
57 R={(1,2),(2,1),(1,1),(2,2)} then R symmetric Transitive Transitive
is………… C
Which statement is true? Relation can be of Function can be of Both (a) and (b) None of these.
58 the type one the type one many
many B
Which statement is true? Every function is Every Relation is a Both A and B. None of these.
59
a relation. function. A
In-----Relation every element is related Reflexive Symmetric Transitive None
60 A
with itself.
The Relation is----------if a has relation Reflexive Symmetric Transitive None
61 B
with b and b has relation with a.
If a has relation with b and b has relation Reflexive Symmetric Transitive None
62 with c then a has relation with c C
is………………..Relation.
63 Types of function Mappings are----- One to one Many to one Into, Onto All D
The Transitive Closure of a relation R is R* R__ R+ RR
64 A
denoted by----
Page 8
Relation and Function
Page 9
1. A function is said to be ______________, if and only if f(a) = f(b) implies that a = b for all a
and b in the domain of f.
a) One-to-many
b) One-to-one
c) Many-to-many
d) Many-to-one
Answer: b
Explanation: A function is one-to-one if and only if f(a)≠f(b) whenever a≠b.
2. The function f(x)=x+1 from the set of integers to itself is onto. Is it True or False?
a) True
b) False
Answer: a
Explanation: For every integer “y” there is an integer “x ” such that f(x) = y.
Answer: a
Explanation: The value of ⌊5/2⌋ is 2 so, the value of ⌊1/2.2⌋ is 1.
Answer: c
Explanation: The function is not onto as f(a)≠b.
5. The domain of the function that assign to each pair of integers the maximum of these two
integers is ________.
a) N
b) Z
c) Z +
d) Z+ X Z+
Answer: d
Explanation: The domain of the integers is Z+ X Z+ .
6. Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) =
3x + 4. Then the composition of f and g is ________.
a) 6x + 9
b) 6x + 7
c) 6x + 6
d) 6x + 8
Answer: a
Explanation: The composition of f and g is given by f(g(x)) which is equal to 2(3x + 4) + 1.
Answer: b
Explanation: Two bytes are required to encode 2000 (actually with 2 bytes you can encode up to
and including 65,535.
Answer: b
Explanation: To find the inverse of the function equate f(x) then find the value of x in terms of y
such that f -1 (y) = x.
Answer: a
Explanation: The function f(x) = x3 is one to one as no two values in domain are assigned the
same value of the function and it is onto as all R of the co domain is images of elements in
domain.
Answer: d
Explanation: g({0}) for the function g(x) is {x | 0 ≤ x ≤ 1}. Put g(x) = y and find the value of x
in terms of y such that ⌊x⌋ = y.