4D

0B

4
B2

08

FA
E2

30
CA
Paper / Subject Code: 49372 / Discrete Structures & Graph Theory

3F

B4
4D
82
B2
48

FA
00
1T01873 - S.E. Computer Science & Engineering (Artificial Intelligence & Machine Learning) (R-2019)

F0

E2
CA
F7

D3

B4
SEMESTER - III / 49372 - Discrete Structures & Graph Theory

23

82
A1

48

24
AB

00
QP CODE: 10030226 DATE : 26/05/2023

F0
D2

F7

2E

D3
23
8C
A1
31

08
(3 Hours) Total Marks : 80

24
AB
74
4A

D2

3F

2E
1F

8C

D
B2
FA

31
N.B. : (1) Question Number 1 is compulsory

08

24
2A

74
4A

CA
(2) Solve any three questions from the remaining questions

3F
B4

2E
1D

1F

B2
(3) Make suitable assumptions if needed

FA
00

48

08
2A
A3
(4) Assume appropriate data whenever required. State all assumptions

D3

CA
F7

3F
B4

1D
A4
clearly.

A1

B2
24

00

48
A3
4F
.

2E

D3

CA
D2

F7
0B

23
A4
08

A1
24

31

48

AB
1. a. Define the following with suitable example 5

30

4F
3F

2E

4A

D2

F7
4D
a)Ring b) Cyclic Group c) Monoid d)Normal Subgroup e) Planar Graph

0B
B2

8C
08

A1
FA

31
E2

30
CA

74
3F
b. Check whether [(p➔q) ^ ⌐q]➔ ⌐p is a tautology 5

4A

D2
B4
4D
82

1F
B2
48

FA

31
00
c. Determine the number of positive integers n where 1≤ n ≤100 and n is not divisible by
F0
5

2A
E2
CA

74
F7

4A
D3

B4
23
2,3 or 5.

82

1D

1F
A1

48

FA
24
AB

00
F0

2A
d. Prove by mathematical induction that 5

A3
D2

F7

2E

D3

B4
23
8C

1D
2+5+8+……+(3n-1) = n(3n+1)/2

A4
A1
31

08

24
AB

00
74

A3
4A

4F
D2

3F
2 a Define Equivalence Relation. Let A be a set of integers, Let R be a Relation on AXA 8

2E

D3
1F

8C

0B

A4
B2
FA

31

defined by (a,b) R (c,d) if and only if ad = bc. Prove that R is an Equivalence Relation

08

24
2A

74

30
4A

4F
CA

3F
B4

2E
1D

1F

4D
b. Let A={a, b, c, d, e} 8

0B
B2
FA
00

48

08
2A
A3

E2

30
D3

CA
F7

3F
B4

1D

10 1 1 0
A4

4D
82
A1

B2
24

00

48
A3
4F

F0

E2
01 0 0 1
2E

D3

CA
D2

F7
0B

23
A4

82
08

MR= 0 1 0 0 1
A1
24

31

48

AB
30

4F

F0
3F

2E

4A

10 1 0 0
D2

F7
4D

0B

23
B2

8C
08

A1
FA

00 0 1 1
31

AB
E2

30
CA

74
3F

4A

D2
B4

Find the transitive closure of it using Warshall’s algorithm.

4D
82

1F
B2

8C
48

FA

31
00
F0

c Let G be a group. Prove that the identity element ‘e’ is unique. , 4

2A
E2
CA

74
F7

4A
D3

B4
23

82

1D

1F
A1

48

3 a Prove that set G = {1,2,3,4,5,6} is a finite abelian group of order 6 with respect to 8
FA
24
AB

00
F0

2A
A3
D2

F7

2E

multiplication module 7
D3

B4
23
8C

1D
A4
A1
31

08

24
AB

00
74

b Give the exponential generating function for the sequences 8

A3
4F
D2

3F

2E

D3
1F

8C

i) {1,1,1…}
0B

A4
B2
31

08

24
2A

74

ii) {0,1,0,-1,0,1,0,-1…}.
30
4A

4F
CA

3F

2E
1D

1F

4D

0B

c Determine whether the following graphs are isomorphic. Justify your answer.
B2

4
FA

48

08
2A
A3

E2

30
CA
F7

3F
B4

1D
A4

4D
82
A1

B2
48
A3
4F

F0

E2
CA
D2

F7
0B

23
A4

82
A1
31

48

AB
30

4F

F0
4A

D2

F7
4D

0B

23
8C
A1
FA

31

AB
E2

30

74
4A

D2
B4
4D

1F

8C
FA

31
00

2A
E2

74
4A
D3

4. a 8
B4

{ }→ − {
82

1D

1F

7
A Function :  − 4 }is defined as () = (4 − 5)/(3 − 7)
FA
24

00
F0

2A
A3
2E

D3

3 3
B4
23

1D
A4

-1
Prove that f is Bijective and find the rule for f
08

24
AB

00

A3
4F
3F

2E

D3

0B

A4
B2

08

24

30

4F
CA

3F

2E

4D

0B
B2
48

08

30226 1
E2

30
CA
F7

3F

4D
82
A1

B2
48

F0

E2
CA
F7

23

1D2A1F748CAB23F082E24D300B4FA4A3
82
A1

48

AB

F0
D2

F7
 4D

0B

4
B2

08

FA
E2

30
CA
Paper / Subject Code: 49372 / Discrete Structures & Graph Theory

3F

B4
4D
82
B2
48

FA
00
F0

E2
CA
F7

D3

B4
23

82
A1

48

24
AB

00
F0
D2

F7

2E

D3
23
8C
A1
31

08

24
AB
74
5
b Show that (2,5) encoding function e:B2 → B defined by 8

4A

D2

3F

2E
1F

8C

D
B2
FA
e(00)=00000

31

08

24
2A

74
4A

CA

3F
B4
e(01)=01110

2E
1D

1F

B2
FA
00
e(10)=10101

48

08
2A
A3
D3

CA
F7

3F
B4
e(11)=11011

1D
A4

A1

B2
24

00
is a group code.

48
A3
4F
2E

D3

CA
D2

F7
c Check whether Euler cycle and Euler Path exist in the Graph given below. If yes Mention them 4

0B

23
A4
08

A1
24

31

48

AB
30

4F
3F

2E

4A

D2

F7
4D

0B
B2

8C
08

A1
FA

31
E2

30
CA

74
3F

4A

D2
B4
4D
82

1F
B2
48

FA

31
00
F0

2A
E2
CA

74
F7

4A
D3

B4
23

82

1D

1F
A1

48

FA
24
AB

00
F0

2A
A3
D2

F7

2E

D3

B4
23
8C

1D
A4
A1
31

08

24
AB

00
74

5. a Consider the Set A={1,2,3,4,5,6} under multiplication Modulo 7. 8

A3
4A

4F
D2

3F

2E

D3
1F

8C

1) Prove that it is a Cyclic group.

0B

A4
B2
FA

31

08

24
2A

74

30
4A

4F
CA

3F
B4

2E
1D

1F

4D
2) Find the orders and the Subgroups generated by {2,3}and {3,4}

0B
B2
FA
00

48

08
2A
A3

b State and explain the extended Pigeonhole principle. How many friends must you have to 8

E2

30
D3

CA
F7

3F
B4

1D
A4

4D
82
guarantee that at least five of them will have birthdays in the same month.
A1

B2
24

00

48
A3
4F

F0

E2
2E

D3

CA
D2

F7

c Functions f,g,h are defined on a set X={a,b,c} as 4

0B

23
A4

82
08

A1
24

31

48

f={(a,b),(b,c),(c,a)}
AB
30

4F

F0
3F

2E

4A

D2

F7

g={(a,b),(b,a),(b.b)}
4D

0B

23
B2

8C
08

A1
FA

31

h={(a,a),(b,b),(c,a)}
AB
E2

30
CA

74
3F

4A

D2

i) Find fog, gof . Are they equal?

B4
4D
82

1F
B2

8C
48

FA

ii) Find fogoh and fohog?

31
00
F0

2A
E2
CA

74
F7

4A

6. a Draw the Hasse Diagram of D72 and D105 and check whether they are Lattice. 8
D3

B4
23

82

1D

1F
A1

48

FA
24
AB

00
F0

2A
A3
D2

F7

2E

D3

B4
23
8C

1D

b Define Bounded Lattice and Distributive Lattice. Check if the following diagram is a Distributive 8
A4
A1
31

08

24
AB

00
74

Lattice or not
A3
4F
D2

3F

2E

D3
1F

8C

0B

A4
B2
31

08

24
2A

74

30
4A

4F
CA

3F

2E
1D

1F

4D

0B
B2
FA

48

08
2A
A3

E2

30
CA
F7

3F
B4

1D
A4

4D
82
A1

B2
48
A3
4F

F0

E2
CA
D2

F7
0B

23
A4

82
A1
31

48

AB
30

4F

F0

c Define the following with suitable example. 4

4A

D2

F7
4D

0B

23
8C

a)Hamiltonian path b) Euler Circuit c) Sub Lattice d)Group e) Surjective Function

A1
FA

31

AB
E2

30

74
4A

D2
B4
4D

1F

8C
FA

31
00

________________________
2A
E2

74
4A
D3

B4
82

1D

1F
FA
24

00
F0

2A
A3
2E

D3

B4
23

1D
A4
08

24
AB

00

A3
4F
3F

2E

D3

0B

A4
B2

08

24

30

4F
CA

3F

2E

4D

0B
B2
48

08

30226 2
E2

30
CA
F7

3F

4D
82
A1

B2
48

F0

E2
CA
F7

23

1D2A1F748CAB23F082E24D300B4FA4A3
82
A1

48

AB

F0
D2

F7