Total No. of Questions : 8] SEAT No.

:
PB-3858
[Total No. of Pages : 2

:18
[6262]-121

:46
09
T.E.(Information Technology Engineering)

1
24
Theory of Computation

16 30
/20
(2019 Pattern) (Semester-I) (314441)
1
/05
8.2 01
Time : 2½ Hours] [Max. Marks : 70
.13 GP

Instructions to the candidates:

26

1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.

3.1 CE

2) Neat diagrams must be drawn wherever necessary.

3) Figures to the right side indicate marks.
99

:18
4) Assume suitable data, if necessary.

:46
20

09
Q1) a) What is an ambiguous grammar? Explain with a suitable example. [4]
1
24
16 30

b) What is Regular Grammar? Explain types of regular grammar. [5]

/20
1
/05

c) Convert the following grammar to GNF. [9]

8.2 01

S  AB
.13 GP
26

A  BSB | BB | b
3.1 CE

B  aAb| a
OR
99

:18
Q2) a) Write CFG for the language L= { ai bj ck | i = j + k & j, k >=1 } [6]
:46

b) Convert the following RLG to FA. [6]

20

09
1

S  0A | 1B | 0 | 1
24
16 30
/20

A  0S | 1B | 1
1
/05

B  0A | 1S
8.2 01

c) Explain any three closure properties of Context Free language. [6]

.13 GP
26

Q3) a) Define Push down Automata. Explain different types of PDA. Explain.
3.1 CE

any two applications of PDA. [6]

b) Write a note on Instantaneous Description of PDA with an example [5]
99
20

P.T.O.
 c) Convert the following CFG to PDA that accepts the same language by
empty stack. [6]

:18
S  0S1 | A

:46
A  1A0 | S | 

09
1
OR

24
16 30
/20
Q4) a) Compare Finite Automata and Pushdown Automata. [4]
1
/05
b) Design a Pushdown Automata for the following language. [7]
8.2 01
L={0a1b2c | a+c=b}
.13 GP
26

c) Design Post Machine for L ={0n1n | n  0} [6]

3.1 CE

Q5) a) Write a note on Universal turing Machine [6]

b) Explain Church Turing hypothesis. [3]
99

:18
c) Define Turing machine and design a right shifting TM over alphabet {0,1}

:46
20

with an example. [9]

09
1
OR 24
16 30
/20

Q6) a) Construct a Turing Machine to replace string ‘110’ by ‘101’ in a binary

1
/05

input string. Write down transition table along with diagram. [10]
8.2 01
.13 GP

b) Discuss the following terms [8]

26

i) Post Correspondence Problem

3.1 CE

ii) Halting Problem of Turing Machine

99

Q7) a) What do you mean by NP problems? Justify why the Travelling Salesman
:18
:46

problem is a NP problem. [8]

20

09

b) Define decidability of problem with suitable example. Describe

1
24

un- decidable problems for context-free Grammar. [9]

16 30
/20

OR
1
/05
8.2 01

Q8) a) Write short note on : [9]

.13 GP

i) A Simple Un-decidable problem

26

ii) Measuring Complexity

3.1 CE

b) Explain in detail Cook’s theorem. [8]

99

  
20

[6262]-121 2