DS UNIT 2

Matoshri College of Engineering and Research Center Nasik

Department of Computer Engineering
Discrete Structutre
UNIT - II
Class : S.E.Comp Subject : Discrete Structutre

Sr.N Correct
Question Option A Option B Option C Option D Mark
o. Option
f is a function f is a function and f is a function and f is a function and
Define f(n) = n/2 + 1−(−1)n/4 for all n 2 Z. Thus, f: Z
1 and is onto but is onto and one-to- is not onto but is is not onto and A 2
→ Z, Z the set of all integers.Which is correct?
not one-to-one. one. one-to-one. not one-to-one
2 3
If f (x) = cos x and g(x) = x , then (f o g) (x) is (cos x)
3
cos 3 x X (cos x )3 cos x
3
D 2
3 Transitivity and irreflexive imply: Symmetric Reflexive Irreflexive Asymmetric D 2
{(1,3), (1,5),
If R is a relation “Less Than” from A = {1,2,3,4} to B = {(3,3), (3,4), {(3,1), (5,1), (3,2), {(3,3), (3,5), (5,3),
4 (2,3), (2,5), (3,5), C 2
{1,3,5} then RoR-1 is (3,5)} (5,2), (5,3), (5,4)} (5,5)}
(4,5)}
A relation that is reflexive, anti-symmetric and equivalence
5 Function partial order None of these C 1
transitive is a relation
Let f : X →Y and g : Y → Z. Let h = go f : X → Z. If f is one-to-one If f is not one-to- If f is one-to-one
If f is not onto
6 Suppose g is one-to-one and onto. Which of the then h is one-to- one then h is not then h is one-to- A 2
then h is not onto.
following is FALSE? one and onto. one-to-one. one.

7 Domain and Range of the function Y = –v(–2x + 3) is x=3/2, y=0 x>3/2, y=0 x<3/2, y=0 x=3/2, y=0 D 2

The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2),

8 Reflexive Transitive Symmetric Asymmetric B 2
(1,4), (4,2), (3,4)} is

9 A partial ordered relation is transitive, reflexive and Anti-symmetric Bisymmetric Anti-reflexive. Asymmetric A 1

Find the number of relations from A = {cat, dog, rat}

10 64 6 32 15 A 2
to B = {male , female}
The number of distinct relations on a set of 3
11 8 9 18 512 C 2
elements is

How many onto (or surjective) functions are there

12 2n n
2 -1
n
2 -2
n
2(2 – 2) C 2
from an n-element (n => 2) set to a 2-element set?
 How many relations are there on a set with n
2n(n+1)/2 and 3n(n–1)/2 and 2n(n+1)/2 and 2n(n+1)/2 and
13 elements that are symmetric and a set with n D 2
2n.3n(n–1)/2 2n(n–1) 3n(n–1)/2 2n(n–1)/2
elements that are reflexive and symmetric?

The number of functions from an m element set to an

14 mn m+n nm m*n A 2
n element set is:

Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then

15 T F A 1
R is not reflexive and not symmetric.

Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then

16 T F B 1
R is not transitive.
The function f : Z → Z given by f (x)= x +1 is a
17 T F A 1
bijection.

The function f : A → B is injective if whenever f (x)= f

18 T F A 1
(y), where x, y € A, then x = y.

Let A be a finite set. If f : A → A is injective then it is

19 T F A 1
surjective.
The union of two equivalence relations on a non-
20 T F B 1
empty set is an equivalence relation.
If A is a set with 3 elements, how many equivalence
relations are there on A? Hint: The set of equivalence
21 4 5 23 29 B 2
classes for a given equivalence relation on A is a
partition of the set A.
Let f: A → B and g: B→C be functions where A = {1,
2, 3, 4}, B = {1, 2, 3, 4, 5}, and C = {1, 2, 3, 4, 5, 6}, f =
22 3 4 5 6 D 2
{(1, 2), (2, 3), (3, 2), (4, 5)} and g = {(1, 3), (2, 4), (3,
5), (4, 6), (5, 1)}. Find g o.f (2).
A relation R is defined on Z by xRy if 2x +5y =
23 0(mod7). Then the equivalence class[10] is equal to 3 4 5 6 A 2
the equivalence class…
reflexive, but
Let R be a relation on a set A = {1, 2, 3, 4} given by R = reflexive and reflexive and symmetric and
neither
24 {(1, 1), (1, 2), (1, 3), (2, 1), (2,2), (2, 3), (3, 1), (3, 2), (3, symmetric, but transitive, but not transitive, but not C 2
symmetric nor
3)}. Then the relation is: not transitive. symmetric. reflexive.
transitive.

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

26 If g (x) = 3x² - 2x - 5, what is the value of g (-1)? -4 -10 6 0 A 2

{(2,5), (3,6), {(6,-2), (-4,6), (- {(-1, 5), (-2,5), (- {(0,-2), (1,0), (-1,-
27 Which relation is not a function? D 2
(4,7), (5,8)} 2,4), (1,0)} 3,5), (-4,5)} 3), (0,-1)}
Consider the recurrence relation ak = -8ak-1 - 15ak-2with
initial conditions a0 = 0 and a1 = 2. Which of thefollowing is ak = k(-3)k - k(-
28 ak = (-3)k - (- ak = k(-3)k - (-5)k ak = (-5)k - (-3)k A 4
an explicit solution to this recurrence relation? 5)k
5)k

Consider the recurrence relation ak = 6ak-1 - 9ak-2 with

initial conditions a0 = 0 and a1 = 2. Which of thefollowing is
an = A(-3)n + nB(-
29 an explicit solution to this recurrence relation, provided the an = A3n + B3n an = A3n + B(-3)n an = A3n + nB3n C 4
3)n
constants A and B are chosen correctly?

Reflexive, Not Reflexive, Reflexive, Reflexive, Not

The binary relation R = {(0, 0), (1, 1)} on A = {0, 1, 2, 3,
30 Not Symmetric, Symmetric, Not Symmetric, Not B 2
} is
Symmetric, Transitive Transitive Transitive
Define a binary relation R = {(0, 1), (1, 2), (2, 3), (3, 2), Transitive
(2, 0)} on A = {0, 1, 2, 3}. The directed graph (including
31 16 arrows 12 arrows 8 arrows 6 arrows A 2
loops) of the transitive closure of thisrelation has

Let N+ denote the nonzero natural numbers. Define a binary Reflexive, Not Reflexive, Reflexive, Reflexive, Not
32 relation R on N+ × N+ by (m, n)R(s, t) if gcd(m, Not Symmetric, Symmetric, Not Symmetric, Not A 2
n) = gcd(s, t). The binary relation R is Symmetric, Transitive Transitive Transitive
Transitive
Define a binary relation R on a set A to be anti- reflexive if
xRx doesn’t hold for any x 2 A. The numberof symmetric,
33 210 250 245 290 C 2
anti-reflexive binary relations on a set of ten elements is

Define an equivalence relation R on the positive integers A =

{2, 3, 4, . . . , 20} by m R n if the largest prime divisor of m is
34 8 10 9 11 A 4
the same as the largest prime divisor of n. The number of
equivalence classes of R is
Consider the divides relation, m | n, on the set A = {2, 3, 4, 5,
6, 7, 8, 9, 10}. The cardinality of the covering relation for this
35 6 5 8 7 D 4
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, 13, 14, 15, 16}

and consider the divides relation on A. Let C denote
C = 3, M = 8, m =
36 the length of the maximal chain, M the number of C = 4, M = 8, m = 6 C = 3, M = 6, m = 6 C = 4, M = 6, m = 4 A 4
6
maximal elements, and m the number of minimal
elements. Which is true?
 Consider the binary relation R = {(x,y), (x,z), (z,x), R is symmetric R is NOT R is both R is neither
37 (z,y)} on the set {x,y,z}. Which one of the following is but NOT symmetric but symmetric and symmetric nor D 2
TRUE? antisymmetric antisymmetric antisymmetric antisymmetric
Let S be a set of n elements. The number of ordered
38 pairs in the largest and the smallest equivalence n and n 2 n and n 2 n and 0 n and 1 A 2
relations on S are:
Which one of the following is the example of
39 Graph Binary Tree Queue Link List A 1
nonlinear data structure?
If |A|=5 and |B|=4, then there exists an injective
40 T F B 1
function f: B→A.
41 The set of even integers is well-ordered. T F B 1
If n is an integer and x is an irrational real number,
42 T F B 1
then nx is irrational.
43 In Z7, if [6]x =[3]then x =? . [1] [2] [3] [4] D 2
Which statement represents "all numbers between
44 -4 > x > 8 -4 < x < 8 -4 > x < 8 None of these B 1
negative 4 and positive 8" ?
Which interval notation represents the set of
45 numbers that are greater than or equal to -1, but are (-1,9] [-1,9] (-1,9) [-1,9) D 1
less than 9?
Given the relation D = {(6,4), (8,-1), (x,7), (-3,-6)}.
46 Which of the following values for x will make relation -3 -6 8 6 A 2
D a function?
It is a function It is not a
It is a function It is not a
because there function because
because there function because
Which statement is true about the relation shown at exists one y- there are
47 exists one x- there are multiple C 2
the right? coordinate for multiple y-values
coordinate for x-values for a
each x- for a given x-
each y-coordinate. given y-value.
coordinate. value.
A ball is tossed in the air in such a way that the path
of the ball is modeled by the equation
y = -x² + 6x, where y represents the height of the ball
48 6 2 3 4 B 2
in feet and x is the time in seconds. At what time, x, is
the ball at its highest point?

Let S = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21}. What is the
smallest integer N > 0 such
49 that for any set of N integers, chosen from S, there 10 7 9 8 D 2
must be two distinct integers that
divide each other? ®
If S is a set containing n elements then number of
50 n 2n 2n n2 C 1
elements in power set of S ,i.e.P(S)
If A and B are two non empty sets then cartesian AΧB={(a,b);aϵA AΧB={(a,b);aϵB
51 AΧB={(a,b);a,bϵA C 1
product of A and B is---------- } AΧB={(a,b);a,bϵB} and bϵB} and bϵA}
 If set A contains n elements, set B contains m
52 m+n n-m m.n n/m C 1
elements then number of elements in AXB is---

53 If A,B and C are non empty sets then AX(B∩C) is-----. (AXB)U(AXC) (AXB)∩(AXC) (AXB)∩C (AXC)∩B B 1

54 If A,B and C are non empty sets then AX(BUC) is-----. (AXB)U(AXC) (AXB)∩(AXC) (AXB)UC (AXC)UB A 1

55 If R is a relation defined from set A to set B then------ R=AXB RCAXB RCBXA AXBCR B 1

If A=(1,2,3} and R on A is defined by

56 Reflexive Symmetric Transitive All of these A 1
R={(1,1),(2,2),(3,3)} then R is…………
If A=(1,2,3} and R on A is defined by Reflexive and Reflexive and Symmetric and
57 All of the above. C 1
R={(1,2),(2,1),(1,1),(2,2)} then R is………… symmetric Transitive Transitive
Relation can be
Function can be of
58 Which statement is true? of the type one Both (a) and (b) None of these. B 1
the type one many
many
Every function is Every Relation is
59 Which statement is true? Both A and B. None of these. A 1
a relation. a function.
60 In-----Relation every element is related with itself. Reflexive Symmetric Transitive None A 1
The Relation is----------if a has relation with b and b
61 Reflexive Symmetric Transitive None B 1
has relation with a.
If a has relation with b and b has relation with c then
62 Reflexive Symmetric Transitive None C 1
a has relation with c is………………..Relation.

63 Types of function Mappings are----- One to one Many to one Into, Onto All D 1
64 The Transitive Closure of a relation R is denoted by---- R* R R+ RR A

The alternative method to find transitive closure of Warshall’s

65 R* RR R C 1
R* is-------. Algorithm
Partially Ordered
66 Poset is a------ Positive set p-set P* D 1
set

If A is any non-empty set and R is a partial ordered

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