0% found this document useful (0 votes)
91 views12 pages

DM Unit 2 Functions Mcqs

The document discusses relations and functions. It provides examples of relations and functions, and asks multiple choice questions about the properties of relations and functions, including whether they are reflexive, symmetric, transitive, one-to-one, onto, etc. It also asks questions about composing functions, equivalence relations, and solving recurrence relations. There are 30 multiple choice questions in total testing understanding of fundamental concepts in relations and functions.

Uploaded by

Father
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
0% found this document useful (0 votes)
91 views12 pages

DM Unit 2 Functions Mcqs

The document discusses relations and functions. It provides examples of relations and functions, and asks multiple choice questions about the properties of relations and functions, including whether they are reflexive, symmetric, transitive, one-to-one, onto, etc. It also asks questions about composing functions, equivalence relations, and solving recurrence relations. There are 30 multiple choice questions in total testing understanding of fundamental concepts in relations and functions.

Uploaded by

Father
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/ 12

Relation and Function

SE Comp DM Unit - 2 MCQs


Unit Correct
Question Option A Option B Option C Option D
No. Option
Define f(n) = n/2 + 1−(−1)n/4 for all n 2 Z. f is a function and f is a function and f is a function and is f is a function and
Thus, f: Z → Z, Z the set of all is onto but not one- is onto and one-to- not onto but is one- is not onto and not
1 A
integers.Which is correct?
to-one. one. to-one. one-to-one
3 3
If f (x) = cos x and g(x) = x , then (f o g) (x) (cos x)
2 is
cos 3 x X (cos x )3 cos x3 D

3 Transitivity and irreflexive imply: Symmetric Reflexive Irreflexive Asymmetric D


If R is a relation “Less Than” from A = {(3,3), (3,4), {(3,1), (5,1), (3,2), {(3,3), (3,5), (5,3), {(1,3), (1,5),
4 {1,2,3,4} to B = {1,3,5} then RoR-1 is (3,5)} (5,2), (5,3), (5,4)} (5,5)} (2,3), (2,5), (3,5), C
(4,5)}
A relation that is reflexive, anti-symmetric Function equivalence relation partial order None of these
5 and transitive is a C

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

The number of distinct relations on a set 8 9 18 512


11 C
of 3 elements is
How many onto (or surjective) functions 2n 2n - 1 2n - 2 2(2n – 2)
12 are there from an n-element (n => 2) set C
to a 2-element set?
How many relations are there on a set 2n(n+1)/2 and 3n(n–1)/2 and 2n(n+1)/2 and 2n(n+1)/2 and
with n elements that are symmetric and a 2n.3n(n–1)/2 2n(n–1) 3n(n–1)/2 2n(n–1)/2
13 D
set with n elements that are reflexive and
symmetric?
The number of functions from an m mn m+n nm m*n
14 A
element set to an n element set is:
Let R = {(a, a), (a, b)} be a relation on S T F
15 = {a, b, c}. Then R is not reflexive and A
not symmetric.
Let R = {(a, a), (a, b)} be a relation on S T F
16 B
= {a, b, c}. Then R is not transitive.
The function f : Z → Z given by f (x)= x T F
17 A
+1 is a bijection.
The function f : A → B is injective if T F
18 whenever f (x)= f (y), where x, y € A, A
then x = y.
Let A be a finite set. If f : A → A is T F
19 A
injective then it is surjective.
The union of two equivalence relations on T F
20 B
a non-empty set is an equivalence
relation.

Page 2
Relation and Function

If A is a set with 3 elements, how many 4 5 23 29


equivalence relations are there on A?
Hint: The set of equivalence classes for a
21 B
given equivalence relation on A is a
partition of the set A.

Let f: A → B and g: B→C be functions 3 4 5 6


where A = {1, 2, 3, 4}, B = {1, 2, 3, 4,
5}, and C = {1, 2, 3, 4, 5, 6}, f = {(1, 2),
22 (2, 3), (3, 2), (4, 5)} and g = {(1, 3), (2, D

4), (3, 5), (4, 6), (5, 1)}. Find g o.f (2).

A relation R is defined on Z by xRy if 2x 3 4 5 6


+5y = 0(mod7). Then the equivalence
23 class[10] is equal to the equivalence A

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:

If f (x) = -3x - 5, what is the value of f -11 -1 1 11


25 A
(2)?
If g (x) = 3x² - 2x - 5, what is the value of -4 -10 6 0
26 A
g (-1)?
Which relation is not a function? {(2,5), (3,6), {(6,-2), (-4,6), (- {(-1, 5), (-2,5), (- {(0,-2), (1,0), (-1,-
27 (4,7), (5,8)} 2,4), (1,0)} 3,5), (-4,5)} 3), (0,-1)} D

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

Define a binary relation R on a set A to 210 250 245 290


be anti-reflexive if xRx doesn’t hold for
33 any x 2 A. The number of symmetric, anti- C
reflexive binary relations on a set of ten
elements is
Define an equivalence relation R on the 8 10 9 11
positive integers A = {2, 3, 4, . . . , 20}
by m R n if the largest prime divisor of m
34 is the same as the largest prime divisor of A
n. The number of equivalence classes of
R is

Consider the divides relation, m | n, on the 6 5 8 7


set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. The
cardinality of the covering relation for
35 D
this partial order relation (i.e., the number
of edges in the Hasse diagram) is

Let A = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, C = 3, M = 8, m = C = 4, M = 8, m = C = 3, M = 6, m = 6 C = 4, M = 6, m =


13, 14, 15, 16} and consider the divides 6 6 4
relation on A. Let C denote the length of
the maximal chain, M the number of
36 A
maximal elements, and m the number of
minimal elements. Which is true?

Page 5
Relation and Function

Consider the binary relation R = R is symmetric R is NOT R is both symmetric R is neither D


{(x,y), (x,z), (z,x), (z,y)} on the set but NOT symmetric but and antisymmetric symmetric nor
37
{x,y,z}. Which one of the following is antisymmetric antisymmetric antisymmetric
TRUE?
Let S be a set of n elements. The number n and n 2 n and n 2 n and 0 n and 1
of ordered pairs in the largest and the
38 A
smallest equivalence relations on S are:

Which one of the following is the example Graph Binary Tree Queue Link List
39 of nonlinear data structure? A

40 If |A|=5 and |B|=4, then there exists an T F B


injective function f: B→A.
41 The set of even integers is well-ordered. T F B
42 If n is an integer and x is an irrational real T F B
number, then nx is irrational.
43 In Z7, if [6]x =[3]then x =? . [1] [2] [3] [4] D

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?

Given the relation D = {(6,4), (8,-1), -3 -6 8 6


(x,7), (-3,-6)}. Which of the following
46 values for x will make relation D a A
function?

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

height of the ball in feet and x is the time


in seconds. At what time, x, is the ball at
its
Lethighest
S = {1,point?
3, 5, 7, 9, 11, 13, 15, 17, 19, 10 7 9 8
21}. What is the smallest integer N > 0
such
that for any set of N integers, chosen
49 D
from S, there must be two distinct
integers that
divide each other?

If S is a set containing n elements then n 2n 2n 2


n
50 number of elements in power set of S C
,i.e.P(S)__
If A and B are two non empty sets then AΧB={(a,b);a,bϵ AΧB={(a,b);a,bϵB AΧB={(a,b);aϵA AΧB={(a,b);aϵB
51
cartesian product of A and B is---------- A} } and bϵB} and bϵA} C
If set A contains n elements, set B m+n n-m m.n n/m
52 contains m elements then number of
elements in AXB is--- C

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

The alternative method to find transitive R* RR Warshall’s R


65 C
closure of R* is-------. Algorithm
Poset is a------ Positive set p-set P* Partially Ordered
66
set D
If A is any non-empty set and R is a Poset p-set Positive set None
67 partial ordered relation on set A, then the
ordered pair (A,R) is called ------- A
Let (A, ≤) be a poset. A subset of A is Chain Antichains Group Lattice.
68 known as ------if every pair of elements in
the subset are related. A
The number of elements in the chain is Chain Antichains None Length of chain
69 D
called as------
A ------ is a poset (A, ≤) in which every Chain Lattice. Antichains Group
70 subset {a, b} of A, has a least upper B
bound and a greatest lower bound.
Pigeon Hole Principle says that if there Two or more Pigeons One only None
are many pigeons and a few pigeon holes, pigeons.
71 A
then there must be some pigeon holes
occupied by--------------
72 Digraph can be represented by----- Hasse diagrams Digraph Graph None A

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.

3. The value of ⌊1/2.⌊5/2⌋ ⌋ is _______________.


a) 1
b) 2
c) 3
d) 0.5

Answer: a
Explanation: The value of ⌊5/2⌋ is 2 so, the value of ⌊1/2.2⌋ is 1.

4. Which of the following function f: Z X Z → Z is not onto?


a) f(a, b) = a + b
b) f(a, b) = a
c) f(a, b) = |b|
d) f(a, b) = a – b

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.

7. __________ bytes are required to encode 2000 bits of data,


a) 1
b) 2
c) 3
d) 8

Answer: b
Explanation: Two bytes are required to encode 2000 (actually with 2 bytes you can encode up to
and including 65,535.

8. The inverse of function f(x) = x3 + 2 is __________.


a) f -1 (y) = (y – 2) 1/2
b) f -1 (y) = (y – 2) 1/3
c) f -1 (y) = (y) 1/3
d) f -1 (y) = (y – 2)

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.

9. The function f(x) = x3 is bijection from R to R. Is it True or False?


a) True
b) False

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.

10. The g -1({0}) for the function g(x)= ⌊x⌋ is ________.


a) {x | 0 ≤ x < 1} b) {x | 0 < x ≤ 1} c) {x | 0 < x < 1} d) {x | 0 ≤ x ≤ 1}

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.

You might also like