Total No. of Questions: 8] SEAT No.

8
23
PA-1233 [5925]-255
[Total No. of Pages : 5

ic-
tat
S.E. (Computer Engg./Computer Science and Design Engineering/

7s
Artificial Intelligence & Data Science)

7:2
DISCRETE MATHEMATICS

02 91
3:3
(2019 Pattern) (Semester-III) (210241)

0
31
Time : 2½ Hours] 2/0 13 [Max. Marks : 70
Instructions to the candidates:
0
2/2
.23 GP

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6 Q.7 Q.8.

2) Neat diagrams must be drawn whenever necessary.
E

3) Assume suitable data wherever necessary.

80

8
C

23
ic-
Q1) a) The company has 10 members on its board of directors. In how many
16

tat
ways can they elect a president, a vice president, a secretary and treasure.
8.2

7s
[6]
.24

7:2
b) Find eighth term in the expansion of (x+y)13 [6]
91
49

3:3
c) A box contains 6 white and 5 black balls. Find number of ways 4 balls
30
31

can be drawn from the box if [6]

01
02

i) Two must be white

2/2
GP

ii) All of them must have same colour

2/0

OR
CE
80

8
23
Q2) a) In how many ways can word the ‘HOLIDAY’ be arranged such that the
.23

ic-
letter I will always come to left of letter L. [6]
16

tat
b) In how many ways can one distribute 10 apples among 4 children [6]
8.2

7s

c) Use Binomial theorem to expand (X4+2)3 [6]

.24

7:2
91
49

3:3
30

Q3) a) Is it possible to draw a simple graph with 4 vertices and 7 edges. Justify?
31

[7]
01
02

b) Define following terms with example. [5]

2/2
GP

i) Complete graph
2/0
CE
80

ii) Regular graph

.23

iii) Bipartite graph

16

iv) Complete bipartitie graph

8.2

v) Paths and circuits

.24
49

P.T.O.
 8
23
c) The graphs G and H with vertex sets V(G) and V(H), are drawn below.

ic-
Determine whether or not G and H drawn below are isomorphic. If they

tat
are isomorphic, give a function g: V(G)-> V(H) that defines the

7s
isomorphism. If they are not explain why they are not. [5]

7:2
02 91
3:3
0
31
2/0 13
0
2/2
.23 GP
E
80

8
C

23
ic-
16

tat
8.2

7s
.24

7:2
91
49

OR
3:3
30
31

Q4) a) Determine which if the graph below represents Eulerian circuit, Eulerian
01
02

path, Hamiltonian circuit and Hamiltonian Path. Justify your answer [7]
2/2
GP
2/0
CE
80

8
23
.23

ic-
16

tat
8.2

7s
.24

7:2
91
49

3:3
30
31
01
02
2/2
GP
2/0
CE
80
.23
16
8.2
.24
49

[5925]-255 2
 8
23
ic-
tat
7s
7:2
02 91
3:3
0
31
2/0 13
0
2/2
.23 GP

b) A connected planar graph has nine vertices with degree 2,2,2,3,3,3,4,4,5

E
80

8
[5]
C

23
ic-
Find
16

tat
8.2

i) number of edges

7s
.24

7:2
ii) number of faces
91
49

3:3
iii) construct two such graphs
30
31

c) Explain the following statement with example [5]

01
02

“Every graph with chromatic number 2 is bipartite graph”

2/2
GP
2/0
CE
80

Q5) a) Construct Huffman tree. [6]

8
23
.23

A 5
ic-
16

tat
B 6
8.2

7s

C 6
.24

7:2
91

D 11
49

3:3
30

E 20
31
01
02
2/2
GP

b) Explain [6]
2/0

i) Cutset
CE
80

ii) Tree properties

.23

iii) Prefix code

16
8.2
.24
49

[5925]-255 3
 c) Give the stepwise construction of minimum spanning tree using Prims

8
23
algorithm for the following graph. Obtain the total cost of minimum

ic-
spanning tree. [6]

tat
7s
7:2
02 91
3:3
0
31
2/0 13
0
2/2
.23 GP
E
80

8
C

23
ic-
16

tat
OR
8.2

7s
.24

7:2
Q6) a) Using the labelling procedure to find maximum flow in the transport
91
49

network in the following figure. Determine the corresponding minimum

3:3
30

cut. [6]
31
01
02
2/2
GP
2/0
CE
80

8
23
.23

ic-
16

tat
8.2

7s
.24

7:2
91
49

3:3
30
31
01

b) Define with example. [6]

02
2/2
GP

i) Level and height of a tree.

2/0
CE

ii) Binary search tree.

80
.23

iii) Spanning tree

16
8.2
.24
49

[5925]-255 4
 8
23
c) Construct binary search tree by inserting integers in order [6]

ic-
50,15,62,5,20,58,91,3,8,37,60,24

tat
Find

7s
i) No of internal nodes

7:2
02 91
ii) leaf nodes

3:3
0
31
Q7) a) Let R = {0,60,120,180,240,300} and* binary operation so that for a and
2/0 13
b in R, a*b is overall angular rotation corresponding to successive
0
2/2
rotations by a and by b. show that (R,*) is a group. [6]
.23 GP
E
80

8
b) Following is the incomplete operation table of 4-element group. Complete
C

23
the last two rows. [6]

ic-
16

* e a b c

tat
8.2

e e a b c

7s
a a b c e
.24

7:2
91
b
49

3:3
c
30
31

c) Explain Algebraic system and properties of binary operations. [5]

01
02

OR
2/2

Q8) a) Explain the following terms with examples

GP

i) Ring with unity

2/0

ii) Integral domain

CE
80

8
iii) Field [6]

23
.23

ic-
16

b) Consider the set Q of rational numbers and let a*b be the operation
tat
8.2

defined by a*b=a+b-ab [6]

7s
.24

i) Find 3*4
7:2
91

ii) 2*(-5),
49

3:3

iii) 7*(1/2)
30
31

Is (Q,*)a semigroup? Is it commutative?

01
02

Show that (Zn) is Abelian group

2/2

c) [5]
GP
2/0
CE
80
.23


16
8.2
.24
49

[5925]-255 5