Total No. of Questions : 8] SEAT No.

8
23
P9115 [Total No. of Pages : 5

ic-
[6179]-240

tat
S.E. (Computer Engineering/ Computer Science & Design Engineering/

5s
Artificial Intelligence & Data Science Engineering)

2:2
02 91
DISCRETE MATHEMATICS

9:3
0
(2019 Pattern) (Semester-III) (210241)

30
7/1 13
0
Time : 2½ Hours] 2/2 [Max. Marks : 70
.23 GP

Instructions to the candidates:

1) Answer Question No. Q1 or Q2, and Q3 or Q4, and Q5 or Q6 and Q7 or Q8.
E
82

8
2) Neat diagram must be drawn whenever necessary.
C

23
3) Figures to the right indicate full marks.

ic-
16

4) Assume suitable data, if necessary.

tat
8.2

5s
Q1) a) How many bit strings of length 8 bits can be constructed which will either
.24

2:2
91
start with ‘1’ or end with ‘00’? [6]
49

9:3
30

b) In how many ways can 6 Boys and 2 Girls be seating in a row such that
30
01
02

i) 2 Girls are seating together

2/2
GP

ii) 2 Girls are not seating together. [6]

7/1

c) How many bit strings can be formed of length 10 bits which contains?[6]
CE
82

8
23
i) at least four 1’s
.23

ic-
16

ii) at most four 1’s?

tat
8.2

5s

OR
.24

2:2
91

Q2) a) How many bit strings of length 10 can be formed which will contain
49

9:3

either 5 consecutive 0s or 5 consecutive 1s? [6]

30
30

b) A zip code contains 6 digits. How many different zip codes can be made
01
02

with the digits 0-9 if.

2/2
GP
7/1

i) No digit is used more than once.

CE
82

ii) The first digit is not ‘0’ [6]

.23

c) Use the Binomial theorem to expand (3a-2b)6 [6]

16
8.2
.24
49

[6179]-240 1
Q3) a) Find shortest path from vertex ‘0’ to vertex ‘4’ using Dijkstra’s algorithm.

8
23
[7]

ic-
tat
5s
2:2
02 91
9:3
0
30
7/1 13
0
2/2
.23 GP
E
82

8
C

23
b) Explain with example: [5]

ic-
i) Bipartite Graph
16

tat
ii) Connected Graphs
8.2

5s
c) What is Graph isomorphism? Which of the following graphs are
.24

2:2
91
isomorphic? Justify your answer. [5]
49

9:3
30
30
01
02
2/2
GP
7/1
CE
82

8
23
.23

ic-
16

tat
8.2

5s

OR
.24

2:2

Q4) a) Find shortest path from vertex ‘O’ to Vertex ‘T’ using Dijkstra’s algorithm.[7]
91
49

9:3
30
30
01
02
2/2
GP
7/1
CE
82
.23

b) Explain with suitable example: [5]

16

i) Euler path & Euler circuit

8.2
.24

ii) Hamilton path & Hamilton circuit.

49

[6179]-240 2
 c) What is planar Graph? A simple planar graph G contains 20 vertices and

8
23
degree of each vertex is 3. Determine the number of regions in planar

ic-
graph G? [5]

tat
5s
2:2
Q5) a) For the following graph find different cut set and identify the max flow in

02 91
given network? [6]

9:3
0
30
7/1 13
0
2/2
.23 GP
E
82

8
C

23
ic-
16

tat
8.2

5s
b) Find the optimal prefix code for the given characters with the frequency
.24

2:2
of occurrences as below. [6]
91
49

9:3
Character Frequency
30
30

A 10
01
02
2/2

E 15
GP
7/1

I 12
CE
82

8
23
O 3
.23

U 4 ic-
16

tat
8.2

S 13
5s
.24

2:2

T 1
91
49

9:3

c) Find minimum Spanning tree using prims algorithm. [6]

30
30
01
02
2/2
GP
7/1
CE
82
.23
16
8.2
.24

OR
49

[6179]-240 3
Q6) a) Construct Binary search Tree: [6]

8
23
21, 28, 14,18,11, 32, 25, 23, 37, 27, 5, 15, 19, 30, 12, 26

ic-
tat
b) For the following transport network find the maximum flow using max

5s
flow min cut theorem. [6]

2:2
02 91
9:3
0
30
7/1 13
0
2/2
.23 GP
E
82

8
C

23
ic-
16

tat
c) Find minimum spanning tree using Kruskals Algorithm. [6]
8.2

5s
.24

2:2
91
49

9:3
30
30
01
02
2/2
GP
7/1
CE
82

8
23
.23

Q7) a) ic-
Let Z4={0,1,2,3} and ‘R’ be the relation under operation ‘+’ defined as
16

tat
8.2

5s

a+b=a+b : if (a+b)<4
.24

2:2

a+b=a+b–4 : if (a+b) ≤ 4
91
49

9:3

Where a,b ∈ Z4
30
30

Determine Algebraic System (Z4,+) is abellian group or not? [6]

01
02

b) Explain: [6]
2/2
GP
7/1

i) Integral domain
CE
82

ii) Field
.23

c) Let A={0,1,2,3} and ‘R’ be the relation under operation ‘  ’ defined

16

as a  b=a,b%4. Determine algebraic system (A,  ) is monoid or not? [5]

8.2

OR
.24
49

[6179]-240 4
Q8) a) Let Zn={0,1,2,3,...n-1}

8
23
Consider ‘R’ relation under operation ‘+’ defined as “addition Modulo

ic-
tat
5” and operation ‘*’ defined as “ multiplication modulo 5”. Does the

5s
Algebraic system. (Z5,+,*) forms Ring”? [8]

2:2
02 91
b) Explain the following properties of Algebraic structure with example [4]

9:3
0
i) Identity

30
7/1 13
ii) Inverse
0
2/2
.23 GP

c) Consider ‘R’ be the relation under binary operation ‘*’ on a set Z. Does
E

the algebraic system (Z,*) is Abelian Group? [5]

82

8
C

23
ic-
16

tat
8.2

5s

.24

2:2
91
49

9:3
30
30
01
02
2/2
GP
7/1
CE
82

8
23
.23

ic-
16

tat
8.2

5s
.24

2:2
91
49

9:3
30
30
01
02
2/2
GP
7/1
CE
82
.23
16
8.2
.24
49

[6179]-240 5