103558

No. of Printed Pages : 3 I lllllll illlll lll lllll lllll llll llll

GS-642 &8
vI semester B.C.A. Examination, MaylJune 2019
(CBCS - F+R) (201 6-17 & onwards)
COMPUTER SCIENCE
BCA 601 : TheorY of ComPutation
Time : 3 Hours Max' Marks : 100
Instntction : Anstuer all sections.
SECTION - A

Answer any ten questions. Each question carries two marks' LO)F.2=2O

1. Define DFA. With Mathematical Rcpresentation'

2. Deltne Alphabet and Symbol with exampie'

3. What is traP state ?

4. Dcf inc Rcgu lar ExPrt'ssion '

5. Design RE (Reguiar Expression) for the language containing any number of

a's and b's ending with aa.

6. What is PumPing Lemma ?

7. Mention the type s of chomsky hierarchy grammcr'

8. Define PDA (Push down Automata)

g. Deijne GNF (Greibach Normal Form)'

10. What is turing machine ?

11. Define PCP (Post Correspondence Problem)'

L2. State Arden's Theorcm'

P.T.O.
 2 llill I llil lilll lill tlll
GS-642 I lllllil

SECTION - B
carries five marks' 5x5=25
Answer any Iive questions' Each question
of O's & L's ending with 1O1'
13. Construct a DFA to accept strings

L4. Write difference between DFA and

NFA'

15. Convert the DFA to Regular Expression'

16. State and Prove PumPing Lemma'

L7. obtainaCFG(Contcxtfrecgrammcr)forthefollowingLangauge
f :-fanbnln 2 11t.

machine'
18. Explain Halting Problem of Trrring

19. Elimintate the unit production from the grammer'

S-+AB
A+a
B-+c
B+b
C-+D
D-+tr
E+a ,

20. Show that the following grammer is

ambiguous'
tr-+E + E
E-+E - E
E+E*E
E-+ElE
E+[E]
tr+id
 GS-642
Itilillilil iltililtilflil]ltl
SECTION - C
Answer any three questions. Each question carries fifteen marks. 3xlS=4S
2L. Convert the following NFA to DFA.

/'*t-tO' o
1

.......*e9'__- t /,--:\
1r_-Q2
22. Minrmize the given DFA using table filling Algorithm.

6 0 1

A B D
-> B (- tr
C B tr
D C E
E E tr

23;' Construct a PDA to accept the language

L()I):{wwRlwe(a+b).} where wR is the reverse of w by final state acceptance.

24. Find the language accepted by CFG .

(a) G:{V', T, P, Sl
v: {s}
T: (a' b)
Q-e
U-U
P:{S -+ aSlb}
(b) obtain a grammer to generate string S:{., b} having atleast one a.

-----*€3i-@''o
(c) Obtain a CFC} for the language.
L : {ri,,cu.R]we{a, b}*}

25. Obtain a turing machinc to accept the language L:{anbnln> 1}.

SECTION - D
Answer any one questions. Ix1O=1O
26. Contruct the NFA with tr-moves for
(0 + 1)* 1(0 + 1)

27. Explain the types of Turing Machine.

-oOo-