Total No. of Questions : 8] SEAT No.

8
23
P-482 [Total No. of Pages : 2

ic-
tat
[6003]-701

5s
T.E. (Information Technology)

2:3
02 91
0:3
THEORY OF COMPUTATION

0
31
(2019 Pattern) (Semester - I) (314441)
6/0 13
0
Time : 2½ Hours] [Max. Marks : 70
6/2
.23 GP

Instructions to the candidates :

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

8
2) Neat diagrams must be drawn wherever necessary.
C

23
3) Figures to the right side indicate marks.

ic-
16

4) Assume suitable data, if necessary.

tat
8.2

5s
.24

2:3
Q1) a) Eliminate useless symbols from the following grammar. [6]
91
49

0:3
S  aA | bB
30
31

A  aA | a
01
02

B  bB
6/2
GP

b) Prove that CFL’s are closed under union, concatenation, Kleene’s closure.
6/0

[6]
CE
80

8
c) What is an ambiguous grammar? Explain with a suitable example. [6]

23
.23

OR
ic-
16

tat
Q2) a) Convert the following CFG to Chomsky Normal Form (CNF) [8]
8.2

5s

S  aAbB
.24

2:3

A  aA
91
49

0:3

B  bB | b
30
31

b) Construct NFA for the following left linear regular grammar. [6]
01
02

S  B1 | A0 | C0
6/2
GP

B  B1 | 1
6/0

A  A1 | B1 | C0 | 0
CE
80

C  A0
.23

c) Write a note on Pumping lemma for CFL. [4]

16
8.2

P.T.O.
.24
49
Q3) a) Design a Pushdown Automata for the language L={an b2n | n > 0}. [6]

8
23
b) Construct a PDA equivalent to the following CFG. [6]

ic-
S  0BB

tat
B  0S | 1S | 0

5s
c) Write a note on Post machine. [5]

2:3
OR

02 91
0:3
Q4) a) Design a Pushdown Automata which accepts only odd number of b’s

0
31
over å = {a, b} . Simulate PDA for the string “bbaba”.
6/0 13 [8]
0
b) Explain the acceptance by PDA [6]
6/2
.23 GP

i) By final state
ii) By empty stack
E
80

8
C

23
c) Define Push down Automata. [3]

ic-
16

tat
Q5) a) Design a Turing machine to accept language L = {an bn cn | n > 0}. [7]
8.2

5s
b) Write a short note on Post Correspondence problem. [5]
.24

2:3
c) Differentiate between Push Down Automata and Turing Machine.
91
[6]
49

0:3
OR
30
31

Q6) a) Explain Church Turing hypothesis. [3]

01
02

b) Design a Turing machine to add two unary numbers. [7]

6/2

c) Write a short notes on Universal Turing machine.

GP

[8]
6/0
CE
80

Q7) a) Explain in detail Decidable problems concerning regular languages. [5]

8
23
.23

b) Explain the satisfiability problem with an example. [6]

c) ic-
What is Polynomial time reduction? Explain it with a suitable example.[6]
16

tat
8.2

OR
5s
.24

Q8) a) Show that for two recursive languages L1 and L2, L1 U L2 is also recursive.
2:3
91
49

[4]
0:3

b) What do you mean by NP-Complete problems? List the problems in this

30
31

class and explain any one problem in detail. [7]

01
02

c) What do you mean by Mapping Reducibility? Explain it with an example.

6/2
GP

[6]
6/0
CE
80


.23
16
8.2
.24

[6003]-701 2
49