5E

C
81

4
67
Paper / Subject Code: 49372 / Discrete Structures & Graph Theory

62
7A
4A
25

DF

42
5E
92

C
81

67

62
7A
1T01873 - S.E. Computer Science & Engineering (Artificial Intelligence & Machine Learning) (R-2019) SEMESTER - III /

1D

4A
25

DF

42
5E
92
49372 - Discrete Structures & Graph Theory

62

81

67
7A
1D

4A
42

5
QP CODE:10011566 DATE: 23/11/2022

22

F
5E
8D

AD
2

81
9
26

4A
25
04

E7
4

1
D
(3 Hours) [Total Marks : 80

92
CD

D
2

81

A5
6
8

A
1D
42

25
4
62

E7
0

14
8D

92
D

62
42

A5
8
C

1D
42

5
04
67

62
N.B.

14
D

92
CD

62
DF

2
1) Q.1 is compulsory.

58
8
4

1D
42
4
7

62
7A

22
0
2) Solve any 3 questions out of remaining 5 questions.

8D
D

62
DF

42

D9
5E

8
2C
3) Assumptions made should be clearly stated.

5
4
67
A

D4

22
D0
4A

21
26
4) Draw the figures wherever required.

D9
6
5E

8
D

C
81

74

2
4
62
7A

4
D0
A

21
25

8D
DF
4

42
Q.1 Solve any four of the following questions.

26
E
92

2C
81

4
A5

67
A
a) Prove using Mathematical Induction that n3+2n is divisible by 3 for all

D4
n >=1 5
1D

D0
5

26
7
2

F
4

6
E
2

48
D
62

2C
1

74

42
9

A5
8

7A
D

D0
2

F6
b) Explain the following terms with suitable example: 5

26

8D
D4

2
1

5E
92

AD
2

2C
81

74
i) Partition set

04
6
48

A
2

25

F6

26

CD
E7
ii) Power set.
D4
D0

14
2

D
62

74
D9

A5
8
48

62
2C

7A
2

F6
4

2
D0

42
c) State the Pigeonhole principle and show that if any five numbers from 1 to 8 are chosen,
26

5E
D

D
2

81
D9
6

67
8
2C

7A
74

then two of them will add to 9. 5

4A
2

25
4

DF
0

1
F6

26

5E
8D

92
D

62

1
58
AD

2C

7A
74

4A
42
04

d) Consider the function f(x) = 2x-3. Find a formula for the composition functions 5

22
21
F6

26

5E
D
CD
E7

81
i) f2 = f o f D9
6
8
AD

74

4A
2

25
4
A5

ii) f3 = f o f o f
62

D4
D0

1
F6

92
62
E7

81
14

42

48
AD

1D
42

25
A5
58

67

e) Explain the bipartite graph with suitable example. 5

26

8D

92
D

2
E7
22

F
14

26
D

2C
4

1D
D9

4
A5
58

7
7A

D4
D0
6

26

Q.2
62
22

F
21

14

5E

48
AD

C
74

42
D9
26

58

0
4A

F6

8D

a) What is a transitive closure? Find the transitive closure of R using Warshall’s algorithm
D
E7
D4

22
21

2
D

2C
81

4
D9

04
5
26

7
48

where A={1, 2, 3, 4, 5 } & R={(x,y) | x-y = ±1} 10

A
A
25

26

CD
E7
D4

DF
0

21

4
92
CD

74
5
26

58
8

62
7A
D

b) What is a ring? Let A= {0, 1, 2, 3, 4, 5, 6, 7}. Determine whether a set A with addition
F6
04

D4

2
21

14

42
5E
92
D

modulo 8 & multiplication modulo 8 is a commutative ring? Justify your answer. 10

26

58

67
8
2C

7A
1D

4A
04

D4

22

DF
6

5E
D

62

81
42

Q.3
D9
8
2C

7A
4A
42

5
04
67

22
1
6

5E
D
D

62

81
DF

42

9
48

a) A survey in 1986 asked households whether they had a VCR, a CD player or cable TV. 40 had
2C

4A
42

25
67

21

a VCR. 60 had a CD player; and 50 had cable TV. 25 owned VCR and CD player. 30 owned
6

92
CD

81
DF

42

26
48

1D

a CD player and had cable TV. 35 owned a VCR and had cable TV. 10 households had all
25
67

2
7A

D4
0
26

92
CD

62

three. How many households had at least one of the three? How many of them had only CD
DF
E

48
74

1D
42
A5

player? 8
2
7A

D0
F6

26

62
14

8
AD

2C
74

42
4
A5

b) Find the complete solution of a recurrence relation 6

0
F6

8D
CD
E7
4

42

an +2an-1 = n+ 3 for n≥1 and with a0 =3

AD
81

04
5

67

62
4A
25

CD
E7

DF

2
92

c) Obtain CNF & DNF for the following expression: 6

5
58

62
7A
D

4A

F6

p ‹—› ( ̴ p V ̴ q)
2
21

42
E
92

AD
1

A5
58

67
D

E7
2

DF
21

4
92

81

5
6

7A
D

4A
42

25
21

5E
D

92

1
6

58
48

4A
42

2
D0

21
D

11566 Page 1 of 3
92

1
6

58
48

1D
42

2
D0

D048D42621D9225814A5E7ADF674262C
8D

92
62
 5E

C
81

4
67
Paper / Subject Code: 49372 / Discrete Structures & Graph Theory

62
7A
4A
25

DF

42
5E
92

C
81

67

62
7A
QP CODE:10011566

1D

4A
25

DF

42
5E
92
62

81
Q.4

67
7A
1D

4A
42

5
22

F
5E
8D

AD
2

81
9
26
a) What is a group? Let A={3, 6 ,9, 12} 10

4A
25
04

E7
4

1
D
i) Prepare the composition table w.r.t. the operation of multiplication modulo 15.

92
CD

D
2

81

A5
6
8

A
1D
42

25
ii) Whether it is an abelian group? Justify your answer.

4
62

E7
0

14
8D

92
D

62
iii) Find the inverses of all the elements.

42

A5
8
C

1D
42

5
04
67

62
iv) Whether it is a cyclic group?

14
D

92
CD

62
DF

58
8
4

1D
42
4
7

62
7A

22
0
b) What are the isomorphic graphs? Determine whether following graphs are isomorphic. 10

8D
D

62
DF

42

D9
5E

8
2C

5
4
67
A

D4

22
D0
4A

21
26
7

D9
6
5E

8
D

C
81

74

2
4
62
7A

4
D0
A

21
25

8D
DF
4

42

26
E
92

2C
81

4
A5

67
A

D4
1D

D0
5

26
7
2

F
4

6
E
2

48
D
62

2C
1

74

42
9

A5
8

7A
D

D0
2

F6

26

8D
D4

2
1

5E
92

AD
2

2C
81

74

04
6
48

A
Q.5
2

25

F6

26

CD
E7
D4
D0

14
2

D
62

74
D9

A5
8
48

62
2C

7A
2

a) Let X={1, 2, 3, 6, 24, 36} & R ={(x,y) ∈ R | x divides y}

5

F6
10
4

2
D0

42
26

5E
D

D
2

81
D9
6

i) Write the pairs in a relation set R.

67
8
2C

7A
74

4A
2

25
4

DF
0

ii) Construct the Hasse diagram.

F6

26

5E
8D

92
D

62

1
58
AD

2C

7A
74

iii) What are the Maximal and Minimal elements?

D

4A
42
04

22
21
F6

26

5E
D

iv) Mention Chains and Ant chains from above set.

CD
E7

81
D9
6
8
AD

74

4A
2

25
4

v) Is this poset a lattice?

A5

62

D4
D0

1
F6

92
62
E7

81
14

42

48
AD

1D
42

25
A5
58

67

b) Define the term bijective function. 5

0
26

8D

92
D

2
E7
22

F
14

26
D

2C
4

1D
D9

4
A5
58

7
7A

D4
D0
6

26

62
22

F
21

14

5E

48

Whether a function is bijective? Justify your answer.

AD

C
74

42
D9
26

58

0
4A

F6

8D
D
E7
D4

22
21

2
D

2C
81

c) Define minimum hamming distance. Consider e : B3→B6. Find the code words generated by
D9

04
5
26

7
48

A
A
25

26

CD
E7

the parity check matrix H given below. 5

D4

DF
0

21

4
92
CD

74
5
26

58
8

62
7A
D

F6
04

D4

2
21

14

42

111
5E
92
D

D
26

58

67
8
2C

7A

110
1D

4A
04

D4

22

DF
6

5E

H= 0 1 1
D

62

81
42

D9
8
2C

7A
4A
42

5
04

100
67

22
1
6

5E
D
D

62

81
DF

42

010
9
48
2C

4A
42

25
67

001
0

21
6

92
CD

81
DF

42

26
48

1D

25
67

2
7A

D4
0

Q.6
26

92
CD

62
DF
E

48
74

1D
42
A5

2
7A

D0
F6

26

a) Define with example Euler path, Euler circuit, Hamiltonian path, and Hamiltonian circuit.
62
14

8
AD

2C
74

42
4
A5

Determine if the following diagram has Euler circuit and Hamiltonian circuit. Mention the
0
F6

8D
CD
E7

path/circuit. 6
4

42
AD
81

04
5

67

62
4A
25

CD
E7

DF

2
92

4
5
58

62
7A
D

4A

F6
2
21

42
E
92

AD
1

A5
58

67
D

E7
2

DF
21

4
92

81

5
6

7A
D

4A
42

25
21

5E
D

92

1
6

58
48

4A
42

2
D0

21
D

11566 Page 2 of 3
92

1
6

58
48

1D
42

2
D0

D048D42621D9225814A5E7ADF674262C
8D

92
62
 D0 21 14 DF CD
48 D A5 67 0
D 92 E 42 48
42
6
25
81
7A 6 2C D4
D0 21 4 DF D 26
48 D A5 67 04 21
D 92
2 E 42 8 D9
42
6 58 7A 6 2C D4 22
21 1 4A DF D 26 58
D 5 67 04 21 14

i)
8D 92 8

ii)
D9 A5

11566
42

iv)
2

iii)
E7
42
6 58 AD 62C D4 22 E7
21 1 4A D 26 58 AD
D 5
F6
74 04 21 14 F6
92
25 E7 26 8 D4
D9
22
A5
E7 74
62 81 AD 2 26 58 26
1D 4 F6 CD
0 21 14
AD 2C
92 A5
E 74 48 D A5 F6 D0
2 58 7A 26
2 D42
92
25 E7 74
26 48
D4
1 4A DF CD 62 81 AD 2C 2
92 5 67
42 048 1D 4A F6 1D D0 62
2 58
E7
AD 2C 6 D 42
92
27A
5E 74 92 26 48
D4
1 58
621 D 2C 25 2
4A F6
7
D0 1 4 A F D 6 2 81
5E 4 2 48 D9 5 67 0 4 1 D 4A
7A 62 D4 22 E7 42 8 D 9 2 5E
DF CD 26
21
58
14
AD 62
CD 4 2 2 5 7A
67 0 4 D A F 6
62
1
81
4 DF
42
62 8 D 9 22 5 E7 7 4 04
8D D A 67
42 5 26 92 5E 42
CD 62 81 A D 2 C 4 2 2 5 7 A 62
04 1D 4A F6 6 2 8 1
D0
4 1 4 DF
6
CD
r denote the statement ‘The rating is 3 star.’

8D 92 5E 74 8 D9 A5 7 04
42 25 7A 26 D 2 E 4 2 8D
The food is good but service is not good.
b) Let p denote the statement ‘The food is good’,
q denote the statement ‘The service is good’ &

62 81 2C 42 25 7A 62 42
DF D 62 81 D C

Page 3 of 3
1D 4A 6 0 1 4 F D 62
7
c) Find out the incidence matrix of following graphs.

4 0
Write the following statements in a symbolic form-

92 5E 48 67
Either food is good or service is good or both.

2
D9 A5 4 1D
25 7A 6 2 D4 2 2 E 7 42 8D 92
81 D C 2 5 A 62 4

_________________
4A F6 D0 6 21 8 14 DF CD 26 25
81
5E 74 4 8D D A 6 04 2 1D
7A 26 92 5E 74 8D 92
26
If both food & service are good then the rating is 3 star.

2C 42 25 7A 42 25

D048D42621D9225814A5E7ADF674262C
DF D 0
62
1
81
4 D F
2C
D 6 81
67 48 67 0 2 1 4A
42 D9 A5
42 4 8 D 9
62 D4
26
22
58
E7
62 D 22 5E
CD
04 2 1D 1 4A
AD
F6 C D0
42
62 581
8D 92 5E 74 4 1D 4A
42 25 7A 26 8D 92 5E
62 81 D 2C 42 25 7A
D
It is not true that a 3 star rating always means good food & good service.

1D 4A F6 D0 62 81
Paper / Subject Code: 49372 / Discrete Structures & Graph Theory

5E 74 4 1D 4A
92
25 7A 26 8D4 92 5E
D 2C 2 25 7A
QP CODE:10011566

81 62 81
4A F6 D0 1D 4A DF
5E 74 4 8D 67
7A 26
4
92
2
5E 4
DF 2C 2 6 58
7A
6

D0 21 14 DF
8

67 48 D9 A5 67
42 D4 22 E7 42
62 58 62
CD 26 AD C
04 21 14 F
8D D9 A5 67
22 E7 42
42
6 5 8 A D
62
C