S- 21 Solved University Question Papers

D i s c r e t eM a t h e m a t i c s

JUNE- 2022
(A1&Ds)[5869]- 361
Solved Paper
END SEM]
Course 2019

[Max.Marks 70
Time: 2 Hours

the candidates
Instructionsto
Q.2, Q.3 or Q4, Q5 or Q.6, Q.7 or Q.8
) Solve Q.1
or

) Figures to the right indicate full marks.

must be drawn wherever necessary.
3) Neat diagrams
4) Assume suitable data wherever necessary.

The company has 10 members on its board of directors. In

Q.1 a)
how many ways can they elect a president, a vice president, a secretary

and a treasure. 16]

Ans.: As company has 10 board of members out of high president, vice
president, secretary and Treasurer need to be selected.

Also, order is important and repetition is not allowed. So, by permutation

fomula.
n P n! Here n =
10 and r =4
(n-r)!
So that 10! 10x 9 x 8x7x 6!
10 P (10-4) 6!

= 10x 9 x 8 x 7 = 5040 ways

b) Find eighth term in the expansion of (X* y) 3 *
61
Eighth term of expansion (x+y) is,
13
-C,xD-'y', r =
0, 1, 2,
Here 13, r = 7
n

3
Cxy=1716x°y

QIcODD A Guidefor Engineering

Students
Discrete Mathemathes S-22 Solved Unlversiy Questlon Papers

c) A bor contains 6 white and5 black balls. Find number of

wavs 4 balls can be dhrawn from the box if
) Two must be white
i) All of them must have same colour.
161
Ans.: i) Two white balls from 6 need to select then number of way
=C,
Remaining 2 balls must be selected form the remaining 9 balls.

Required value =C , xC, = 6! x=540

6! 5!
i)C+C4 4!2! 5/4!1! ,-20
OR
Q.2 a) In how many ways can word the 'HOLIDAY' be
that the leter I will arranged such
always come to left of letter L.
16
Ans. The word HOLIDAY' has 7 different letters.
of ways in which number the letters of Therefore, number
the word 'HOLIDAY' be
without any restrictions. arranged
7!= 7x 6 x5
x4x 3 x2x1= 5040
Due to symmetry, I will come before L' in half of the above
arrangements. Therefore, required number of ways 5040 = 2520
2

b) In how many
ways can one distribute 10
children. apples among
6
Ans.: Assume apples are identical
objects and suppose children
corresponds to distinct boxes. Then we have to find the number of ways
to distribution 10 identical
objects in 4 distinct boxes. This can be G
in,

5C 286 ways
c) Use Binomial theorem to expand (x* +2).
Ans. According to binomial theorem,

udens
OICODE A Guide for Engineering
Discrete Mathematics
S-23 Solved University
Questlon Papers
(x+y) x"+" Cx"'y'
+" C,x"2y ?+." Cyn
Here(x+2 =6
=

x2+Cx (2)+3 C,(«* K4)+* C, 8)

=
x2 +6 x +12 x +8
03 a) Is it possible to draw a
simple graph with 4 vertices and 7
edges. Justify ?
17
Ans.: Simple graph G with n vertices number of edges be
n(n -

1)/2 =
4(4 -

1)/2
5

It means simple graph with 4 vertices can not have 7 edges.

b) Define following terms with example
i Complete graph
i) Regular graph
ii) Bipartite graph
iv) Complete bipartite graph
y Paths and circuits (Refer Q.12 and Q.26
of Chapter 4)
c) The graphs G and H with vertex sets V(G) and V(H), are draw
Delow. Determine whether or
notG and H drawn below are isomorphic.
hey are isomorphic, give a function g: V(G) > VH) that defines the
somorphism. If they are not explain why they are not. 51

H:
G

Fig. 1
Ans. Since raph has 7 vertices and degree of each vertex is 2 so
that given
this graph are
isomorphic.
CEcODE A Guide for Engineering
Students
Discrete Mathematics S-24 Sotved Unhversity Question Papers

Mapping g : V(G) » VH)

-W

Fig. 2

OR
Q4 a) Determine which if the graph below represents Eulerian
circuit, Eulerian path, Hamiltonian circuit and Hamiltonian path. Justif
your answer.
17

C.
F

Fig. 3(a)

Fig. 3(b)

PECODD
A Gulde Jor Engineerlng Students
Discrete Mathematics S-25 Sobved Unhversit Question Papers
A graph is Euler circuit if and
only if degree of every vertex is
even.

Graph G, and , both are not Euler circuit.

Agraph is Euler path iff there are atmost two vertices with odd
deoree Graph G has two vertices E and F with odd degree and G,
has two vertices 4 and 7 with odd degree.
both G and G, are Euler path.
w) In G and G, graph we can not visit whole graph by visiting every
vertex exactly once.

G and G, have no Hamilton path.

iv) In G and G, graph we cannot start and end with some vertex by
visiting every vertex exactly at once.

and G, do not have Hamilton circuit.

G
b) A conducted plan graph has nine vertices with degree

2. 2, 2, -

3, 3, 3, 4, 4, 5S
Find
i Number of edges
i) Number of.faces
i) Construct two such graphs.
(2+2+2-3+3+3+4+4+5)/2 =*= 11
ADS. 1) Number of edges =

11 Edges are there

Vertex + 2
Edges
-

) Euler formula for faces

=

= 11 -9 +2

-4

4 faces are there.

statement
with example 51
E x p l a i nthe
following graph"
number 2 is bipartite bipartite,
chromatic edge) is
"Every graph with least
one

o V,
such
(with at subsets
and
graph
Ans. Every 2-chromatic vertex
set V
into two

the
Since colorins partitions adjacent.
that no two vertices in o r V, are
Srudens

Englneering

Example: K23 A Gulde

for

PIcODD
 Discrete Mathematics S-26 Solved Universty Question Papers

(w) (w)

(R) (R) (R)

Fig. 4

Q.5 a) Construct Huffman tree 61

A

B 6

C 6

D 11

E 20

Ans. Each node is represented as a tree

Step I

5 6 6 11 20

Fig. 5(a)
Step II Merge A, B [Trees of minimum weights]J

6 11 20

Fig. 5(b)

OIcOD A Guide for Engineering Students

Diserete Mathematies S-27 Sotved Unversity Question Paper
Step 11 : Merge C and A, B

17

11 20

Q
A

Fig. 5(c)
Step IV : Merge D and E

17 31

D E

(e
Fig. 5(d)
b) Explain
i) Cutset
(Refer Q.36 of Chapter 5)
i) Tree
properties (Refer Q.1 of Chapter 5)
y
Prefix code. (Refer Q.23 of
Chapter 5 )
c)Give the stepwise construction of minimum spanning tree
r s algorithm for the following graph. Obtain the total cost of
minimumn spanning tree 6

DECOD A Guide for Engineering Sudens

Discrete Mathematics S- 28 Solved University Question Papers

15
12
10
11
2 5

14

Fig. 6

Ans. Step I : Select an arbitrary vertex. et's

select (a). The vertex b is closest to vertex a. The
edge ab is added to spanning tree.
B

Fig. 6(a)
Step II: The vertex d is closest to vertices {a,b}. The edge be is added.

O Fig. 6(b)

OECODE A Guidefor Engineering Students

Discrete Math ematics
S- 29
Sohed Unhversity
Step IIl: The vertexe is Question Papers
closest to {a, b, d}. The
edge de is connected.

O
Step IV
Fig. 6(c)
: The vertex is
c
closest to {a, b, d,
e). The edge bc is added

Fig. 6(d)
Step V: The vertex fis closest to vertices {a, b, d, c}. The edge
added
e,
ef is

QECODD A Guide for Engineering Students

Discrete Mathematics S-30 Solved University Questton Papers

Fig. 6(e)
Step VI: The vertex g is closest to vertices {a, b, d, e, c, f}. The edge
cg is added,

10
4
2

(
6

Fig. 6(0
minimum spanning tree is as
The cost (weight) of the
WT) =9+2+2+6+4+ 10 33
unit.

A Gulde for Engineering Students

OECODE
Discrete Mathematics S- 31 Solved Untversity Question Papers
OR
0.6 Using the labelling8 procedure to find
a)
maximum low in the
mansport network in the Jollowing Fig. 7. Determine the
minimum cut. corresponding
12
b
6
20
S

E
14

Fig. 7
Ans. Step 1 Path ScdE is selected.
units. This path can
carry flow of 4
12, 0
b
16, 0
20,,0

s 4,0
9, 0
7,0

13, 4
4, 4

14, 4

Step 2: Path Fig. 7(a)

ScabE is selected. It can carry a flow of 4 units.
12,4
b
16,0
20, 4

s) 9.0
7.0
(E)
13, 8

d
14,4

Fig. 7(b)
QECODD A Guide for Engineering Studens
 S-32 Sobved University Question Papers
Discrete Mathematics

Step 3: Path ScdbE is selected it can carry a flow of 5 units.

12.4

20, 9
16. 0

4 4
7,5
9,0

13. 13 4,4
14, 9

Fig. 7(0)
4: Two units of flow is reversed back through the arc bc.
Step
12, 4

16, 0 20,9
7,7
,4
9,2

13, 15
4,4

14, 11

Fig. 7(d)
Step 5: 8 units of flow is sent thought the path SabE.
12.12
16, 8 20, 17

7,7
4, 4

9,2
13. 13

14, 11

Fig. 7(e)

A Guide for Engineering StudenS

OECODD
Discrete Mathemarics S-33 Solved Unlverslty Questlon Papers
The min-cut is shown in above Fig. 7. The max-cut is given by
unit 21 units.
(S.a.c.d).(b,E)). The capacity of
=

b) Define with example.

Level and height of a tree (Refer Q.10 of Chapter 5)

Binary search tree (Refer Q.23 of Chapter 5)

il) Spanning ree. (Refer Q.29 of Chapter -5) 6)
c) Construct binary search tree by inserting integers in order
50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24.
Fnd
nodes
i) No. of internal
i) Leaf nodes. 61
Ans.

Tree after insertion

Sr. No. Date to inserted

50 (50
2 15 50

15

50
3 62

15
(62)

4 5 50

(62
(15

Sudents

Engineering

A Guidefor

QEcODE
Discrete Mathematics S-34 Solved Unhversty Question Papers

5 20, 58
50

62
15

20 58

6 91, 3
50

20 (58 (81

50

20 58 (e1)

A Gulde for Engineering Students

OECODE
 S- 35 Solved University Question Papers
Discrete Mathemarics

37 60

15

20

9 60
50

15
20 58

60

10 24
50

62
20 58

8 (37) 60

9.7 a) Let R = (0,60,120, 180,240,300) and binary operation so

Jor a and b in R, a * b is overall angular rotation corresponding to
Successive rotations by a and by b. Show that (R, *) is a group. 6
Ans. i) (R, *) is an algebraic system because when you rotate 60° and
120° combined, we shall get 180°.

11) (R, *) is a monoid because 0° is identity element.

A Guide for Engineering Students
DECODD
 Discrete Mathematics S-36 Sohved Unversioy Questlon Papers

i) Inverse also exits because inverse of 60° is 360°.

If (R, *) is an algebraic system. Monoid and inverse element also exits

then (R, *) is a monoid.
b) Following is the incomplete operation table of 4-element group.
Complete the last two rows. 16]
a b C

a b C

b C

Ans.

a b C

a b

a b C e

b e a

a b

c) Explain algebraic system and properties of binary operations.

c)
(Refer Q.1 of Chapter - 6)
5)
OR
Q.8 a) Explain the following terms with examples.
i) Ring with unity
i) Integral domain
ii) Field. (Refer Q.44 of Chapter 6) 6
b) Consider the set Q of rational numbers and let a*b be the
operation defined by a*b = a + b - ab.
i) Find 3 *4,
i) 2* (- 5),

ii) 7 )
Is (2 ) a semigroup ? Is it commutative ?
16
CECODE A Guide for Engineering Students
Discrete Mathematics S-37 Soved Unversity Question Papers
Ans.

i) As a* b =
a + b -
ab
So 3*4 =
(3 +
4) - 12
-

(3 x 4) =
7 = -

5
ii) 2 *(-5)= 2 +(-5) 2x(-5) =- 3 10 7
i)

14+1_715-7
2
-

An algebraic system (Q, *) with a binary operation * on Q is said to be a

semigroup if is associative. In other words,
*

a (bc)= (a*b)*c Va,b,c eA

a* (b*c) =
a * (b + c -

bc) =
a +
(b+c-bc)+a(b +c- bc)
= a + b + c - b c - a b - a c +abc

( a * b)*c = (a+b-ab)*c = a+b-ab+c-(a +b-ab)c

= a+b-ab+c-ac-bc+abc

= a + b + c - a b - a c - b c +abc

(Q. *) is a semigroup.
For commutative : a*b = a+b-ab .(1)
b*ab+a-ba (2)
by equations (1) and (2), we have
a*b = b*a

(Q,* ) is a commutative.
c)Show that (2. ) is Abelian group.
(Refer Q.18 of Chapter 6) IS
END...2
A Guide for Engineering Students
OEcODD