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
Total No. of Questions : 8] SEAT No. :

8
23
P1526 [Total No. of Pages : 4

ic-
[6002]-155

tat
S.E. (Computer/A.I.& D.S./C.S & D.E.)

8s
5:0
DISCRETE MATHEMATICS

02 91
0:4
(2019 Pattern) (Semester-III)(210241)

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

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

2) Neat diagram must be drawn whenever necessary.
E

3) Figures to the right indicate full marks.

80

8
C

4) Assume suitable data if necessary.

23
ic-
16

Q1) a) From a group of 7 men and 6 women, five persons are to be selected to

tat
8.2

8s
form a committee so that at least 3 men are there on the committee. In
.24

5:0
how many ways can it be done? [6]
91
49

0:4
b) Suppose repetitions are permitted: [6]
30
31

i) How many ways three-digit no. can be formed from six digits
01
02

2,3,4,5,7 and 9?
7/2
GP

ii) How many are multiple of 10?

5/0

iii How many are even?

CE
80

8
c) What is the coefficient of x09 in the expansion of (2–x)19? [6]

23
.23

ic-
OR
16

tat
Q2) a) Five pencils and 5 pens are to be arranged in a row. In how many ways
8.2

8s

they can be arranged if [6]

.24

5:0
91

i) All pencils must be arranged together

49

0:4

ii) No two pencils should be kept together and

30
31

iii) One pen and one pencil must be arranged together?

01
02
7/2

b) Find the number of permutations that can be made out of the letters [6]
GP
5/0

i) Mississippi
CE
80

ii) Assassination
.23

c) How many automobile license plates can be made if each plate contains
16

two different letters followed by three different digits. Solve the problem
8.2

if the first digit can not be zero. [6]

.24

P.T.O.
49

[6002]-155 1
Q3) a) Find the shortest path between a - z for the given graph using Dijkstra’s

8
23
algorithm [6]

ic-
tat
8s
5:0
02 91
0:4
0
31
5/0 13
0
7/2
.23 GP
E
80

8
C

23
b) Explain the terms adjacency matrix and incidence matrix. [5]

ic-
c) Define the following terms with suitable example. [6]
16

tat
8.2

i) Factor of graph

8s
.24

5:0
ii) Weighted Graph
91
49

0:4
iii) Bipartite graph
30
31

OR
01
02

Q4) a) Draw all isomorphic graphs on vertices 2 and 3, also draw all non-iso-
7/2
GP

morphic graphs on 2,3 and 4 vertices. [6]

5/0
CE
80

b) Explain Edge connectivity and Vertex Connectivity with suitable example.

8
23
[5]
.23

ic-
16

c) Is it possible to construct a graph with 12 nodes such that 2 of the nodes

tat
8.2

8s

have degree 3 and the remaining have degree 4. [6]

.24

5:0
91
49

0:4

Q5) a) Construct a binary tree from given inorder and preorder traversals:
30
31

Inorder : b d f h k m p t v m
01
02
7/2

Preorder : b f d k h v w t m [6]
GP
5/0

b) Define following terms [6]

CE
80

i) Forest
.23

ii) Fundamental cutsets

16
8.2

iii) Game tree

.24
49

[6002]-155 2
 c) Use Kruskal’s algorithm to find the minimum spanning tree for the con-

8
23
nected weighted graph G as shown in fig. below [6]

ic-
tat
8s
5:0
02 91
0:4
0
31
5/0 13
0
7/2
.23 GP
E
80

8
C

23
ic-
16

OR

tat
8.2

8s
Q6) a) Find maximum flow in the transport network using labeling procedure.
.24

5:0
Determine the corresponding min-cut. [6]
91
49

0:4
30
31
01
02
7/2
GP
5/0
CE
80

8
23
.23

ic-
16

tat
8.2

8s
.24

5:0
91
49

0:4
30
31
01

b) Construct an optimal binary tree for the set of weights as

02
7/2

{8,9,10,11,13,15,22}. Find the weight of an optimal tree. Also assign the

GP

prefix codes and write the code words. [6]

5/0
CE
80

c) What is Minimum Spanning tree? Explain briefly steps involved in finding

.23

MST in Prim’s Algorithm? [6]

16
8.2
.24
49

[6002]-155 3
Q7) a) Define with examples: [10]

8
23
i) Groupoid

ic-
tat
ii) Semigroup

8s
iii) Monoid

5:0
02 91
iv) Abelian group.

0:4
0
31
v) Subgroup
5/0 13
b) Let (A,x) be monoid such that for every x∈ A, x * x = e wheree is the
0
7/2
.23 GP

identity element. Show that (A,*) is an abelian group. [7]

E
80

8
C

23
OR

ic-
Q8) a) Define with examples: [10]
16

tat
8.2

8s
i) Properties of binary operation
.24

5:0
ii) Ring with unity
91
49

0:4
iii) Fields.
30
31

iv) Integral Domain

01
02
7/2

b) Find the number of codes generated by the given check matric H. Also
GP
5/0

find all code words. [7]

CE
80

8
1 1 0 1 0 0

23
.23

ic-
0 1 1 0 1 0
16

tat
1 0 1 0 0 1
8.2

8s
.24

5:0
91
49

0:4


30
31
01
02
7/2
GP
5/0
CE
80
.23
16
8.2
.24
49

[6002]-155 4
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