38

C6
DC
6E
4
D7
Paper / Subject Code: 40725 / Discrete Structures & Automata Theory

65

47
BE

38
38

DC
B6

6E

C
54
D7

47
9E

BE

38
86

DC
B6
FA

6E
73

54
9E

BE

8
D
D9

3
8
B6
A

E
3

54
42

6
F

7
9E

BE
Duration: 3hrs [Max Marks:80]

6D
D9

6
C5

38
FA

54
42
66

6
7
9E

BE
6D
9

6
C5
7C
N.B. : (1) Question No 1 is Compulsory.

2D

8
FA

73
EB

54
6
C4

4
(2) Attempt any three questions out of the remaining five.

6D
9

86
5
C

9
8D

2D
6C
7

A
(3) All questions carry equal marks.

3
B
C4

F
E3

7
54
6

6D
D9
(4) Assume suitable data, if required and state it clearly.

7C

A9
D
E6

6C
8

EB
2
4

F
E3

7
4B

54
C6
C

D
D9

9
8D
E6

6C

B6
65

47

FA
1 Attempt any FOUR [20]

42
E3
4B
38

C6
C

E
D9
C5

9
D
6
D7

47

A
a Differentiate between Mealy and Moore Machine. [05]

BE

42
6

66

F
3
8

C
B6

6E

D9
C5
3

C
54

D
b Prove by Mathematical Induction n3 + 2n is divisible by 3 for n>=1 [05]
D7

7
9E

BE

42
6

66
4

F
E3
38

C
B6
FA

D9
5
7C
4
c Let R be a relation on set of real numbers such that aRb , if and only if a - b is an [05]

8D
E6

6C
D7

65
9E
D9

42
C4
E3
4B
38

C6
B6
FA

integer. Prove that R is an Equivalence Relation.

C5
42

D
E6
7

47
9E

8
6D
D9

6
C5

66
3
4B
8
d Find the Leftmost derivation, rightmost derivation, Parse Tree from the input [05]

DC
A

6E
73

7C
B
42
66

65
string id+ id * id from the following grammar.
E

38
6D
9
C5
7C

C4
A9
2D

4B
38
E E+E

6E
EB
66
C4

8D
F

D7

65
54

BE
9

E E*E
7C

A9
D

E3
2D

38
C

B6
38

54
E id
6
C4

E6
F

D7
54
6

9E
6E

D9

86
e Draw an NFA with ε moves ,for the regular expression r = a . (a + b)* , which
7C

[05]
D

4B
6C

6
FA
BE

38

73
B
42
C4

65
C6

E
6E

6D
represent the language consisting of strings a's & b's starting with a.
D9
5
4

A9
D

38
6C
65

47
BE

38

EB
42

9F

D7
38

6
C

2 a Define and give the Example of Injective, Surjective & Bijective function. [10]
6E

C5
C
4

A9
D

2D
D7

B6
65

47
BE

38

Check the Injectivity and Surjectivity for the following function.

9F
54
38

6
C
B6

9E
6E

7C
4

2D
C
D7

65

FA
9E

N given by f(x) = x2
BE

f: N
66
4
E3

54
38

C
B6
FA

D9
C
4

8D
E6

6C
D7

65

7
9E

b Consider a set A = {1,2,3,4,12} & the relation of divisibility ie aRb if a divides b [10]
D9

42
C4
E3
B
8

C6
B6
FA

C5
73

54
42

8D

which denote a | b. Show that (A,R) is Poset. Construct Poset and also Draw
E6

47
9E

6D
D9

6
C5

66
3
4B
38

C
FA

6E

7C
EB
2

Hasse Diagram.
D
D7

5
54

BE

38
D9

C4
A9

38
6C

B6

3 a Define with example Euler path, Euler circuit, Hamiltonian path, and [10]
6E
4
42

8D
F

D7

65
C6

9E

BE
D9
C5

E3
38

Hamiltonian circuit.
B6
47

FA

54
42
66

E6
D7
DC

9E
D9

b Obtain Disjunctive Normal Form of p ∧ (p → q)

86
C5
7C

[05]
4B
B6
FA

73
42
66
C4

65
E

6D

c Prove that Statement (p

D9

[05]
C5
7C

A9
D

q) (~ q ~p ) is a tautology.
38
38

EB
42
66
C4

D7

4 a Construct a Mealy machine that accept the string ending in '00' and '11'. convert [10]
6E

9
C5
7C

A9
8D

2D

B6
BE

66
C4

the same to Moore Machine.

9F
E3

54

9E
7C
54

2D
E6

FA
38

b Write a short notes on Types of Grammar. [10]

66
C4
4B

54
6E

D9
7C
D

6C
5

5 a Design a finite automaton to check divisibility by 3 to binary number. [10]

BE

38

42
86

C4

6
6E

C5
73

C
54

8D

b Differentiate between NFA and DFA. [05]

47
BE
6D

66
E3
38

DC

7C
EB

54

c Define regular expression and Describe it's any two properties. [05]
E6
D7

38
6

C4
4B
38
B6

6E

8D
D7

5
9E

BE
86

E3
B6
FA

73

54

E6

41099 Page 1 of 2
9E

6D
D9

86

4B
A

73
EB
42

9F

65
6D
A9
2D

38
EB

C542D9FA9EB6D738654BE6E38DC47C66
9F

D7
54
 42 EB 54 DC C5
D9 6D BE 47 42
FA 73 6E C6 D9
54 9E 86 38 6C FA
2D B6 5 4B D 54 9E
9F D7 E6 C4 2 B6
A 38 E3 7C D9 D7
9E 6 8D 66 FA 38
B6 54 C5 9E 65
9F D7 BE C4 42 B6 4
6E 7C D9 BE
6 a
A9 38 66 D7
EB 6 38
D
FA 38 6E

41099
54 C5 9E 65 38
6D BE C4
7C
42 B6 4 DC4
73 6E D9 BE
86 38 66 F D7 6E 7C
EB 5 4B D C5 A9 38
65 38 66
6D E6 C4
7C
42 EB 4 D C5
73 E3 D9 6D BE C4 42
86 66 FA 73 6E 7C D9
54 8D C5 9E 865 38 66 FA
BE C4 42 4 D

G
D7 B6 9E C5
38 6E 7C D9 D7 BE B6 C4 42
38 66 FA 6E 7C D9
65
4B DC C 9E 6
38 6 6 38 D7 FA
54 54 C D 38
E6 47
C
2D
9
B6 B C 47
54 9E 65
E3
8D 6 6C F D7
38
E6
C6
2D
9
B6 4B
54
A9
E 6
E3
8 6C F A
D7
3
E6
C4 5 D 8 6
E3
7C 2D
9F
B6
D7
4B
E6 C 47
54
2D
9E
B6 5 4B 8D
66
C5 A9 38 E3 C 6 9 F D7 E6 C4
7C
42 EB 65 8D 6C A9 38 E3
4 C 5 E 6 8 D
66
D9
FA
6D
73
BE
6E 4 7C
42
D9 B 6D
54
BE C4
C5
42
9E 86 3 6 6 F 7 6 7 C D9
B6 54 8D
C4
C5 A9
EB
38
65
E3
8D 6 6 FA
BE 42 4 C5
7 C 9E

**************
D7

Page 2 of 2
38 6E
38 C 66
D9
FA
6D
73
BE 4 7C
42 B6
65 C 6E D9
D 8 3 6 F D7
H

4B C 54 9E 6 5 8 D 6C A 38
Design PDA to check odd palindrome over Σ= {0,1}.

E6 47 2D B6 4B C 5 4 9E
E3 C6 9F D7 E6 47 2D B6
Determine whether the following Graphs are Isomorphic.

8D 6C 38 C6 9

C542D9FA9EB6D738654BE6E38DC47C66
A9 E3 D7
C4 54 E B 65 8 D 6C FA 38
7C 2D
9F 6D7
4B
E6 C 47
54
2D
9E
B6 65
4
66 A9 38 E3 C6 9 D
C5 65 8D 6C FA 73
42 EB 86
D9 6D 4B
E C 4
54
2
9E
B 54
FA 73 6E 7 C D9 6D BE
F 7
b Define Isomorphic Graph and state the condition of Graph Isomorphism.

9E 86 38 66 A 3 6E
B6 54 D C4
C5 9 EB 8 6
BE 42 54
Paper / Subject Code: 40725 / Discrete Structures & Automata Theory

D7 6E 7C D9 6D BE
38 38 66 F 7 6E
65 C5 A9 38
4B DC
42 EB 654 38
DC
E6 47 D9 6D BE
E3 C6
[10]
[10]

6C FA 73 6E
8D
C4 5 9 EB 8 6 38
42 54 DC
7C D9 6D BE 47
66 F A 7 3 6 E C6
C5
42 9 E 86
54 3 8
B6 DC
D9
F D 7
BE
6 47
C