I

Reg. No.:

L I

o

I

\

) +O

/+

6

Question Paper Code z 6628L
.,,iiii""
""!lii:,;l:llll;i::'::r,,,'....

B.E, / B.Tech. DESREE ExAMINATISN, N9vEMBER/

DEcEfuER 'nl

'l'..r:i:

*o'1,;l :::
iii,

.'

Fifth Semester
Computer Science and Engineering"t''it'

'.;',,.:'

.=
1:',,,,,,,

ii::""u:'

CS 2303

-THEORY

OF COMPU.TATION,,,,,,,,,.
', ,..,."::1.;,,.,.

,,,,"ii"
,

"a,'r,_,,,
:i"i::'

(Common to Seventh Semester Information (Regulation 2008)

Teihnolqfl '

Time: Three hours
Answer AL"L qrlestions'
'ti
.:

Maximum: 100 marks
... l

PART
1.

A-

(1,9,

t 2, = 2O'marks)
':::i.,
.,,,,,,.,,_,

What is stmctural inductifin?
State the

2.
E.

difference
':t'

NFA'and D-FA.
j

*'*= ';':" Ij
-.:

.,,0,*'

,

.l

Constmct a DFA for'tt'{eiifoll=owifig --'::l:.,.

{a) (b)
4.

Atl strings t}rat contain ABqlS 4 nros. All strings that don't contain the substring 11O'
{O}

Is the set of strings over the alphabet prime is :#ggtji?'Frore or disprove'
:]

of dre form 0n where n is not a

t-

,.

Is the graTPaAUp,Xow,,ambiguousl s -+ss l(sls(s)slE ?

=! i::':':':
':::;
i:,i

iihpn$,:.:"*'and no litp.dfircHons' ,'u'\,,.,+ lpfi lcb,G',:''-+ CCI cC
ll;

G;;;"th;"*ftflfloitirrg

gr€rmmar
.

into an equivalent one with no unit A -+ aAAlancpt useless symbols S '+ ABA

."'.'

r

''i

.,i.'

language of odd integers written in binary' ig" *lq]i that accepts the

8.

'''1,;'. ---r^ State fiib two normal forms and give an example'

. A+bAa' (1l "i'i. 'Convert'the gramnnar S .r:i:' $"***.... Is NP-DA tnfutt.i. (a) (4 ti1) Prove that JI is not rational' strings Construct a DFA accepting all 4' the number of l's in ur is 3 mod Or tltat DFA from 'thi' regular expresslon minimized a Construct fbl \-' v) )ffyx ' it*. by ' a. Undecidable' Correspondence Problem is How to prove tJ:at the Post language is also NP-hard' 10.::' (16) 12.1'tinig equivalent? ro4 andDPDA PDA) (8) Illustrate ith an example' (i4 acceptances by a PDA of What are tJ'e different typ": lSguage by a PDA tfrat thJanguage accepted and define tt'"m' l" it tnie (8) provides different languages? types affer"nt theS.:. larrggage Determine the context free (6) 662AL . oi re'Sillar sets? What are the clos-ure propefg t8) that Define regular e4predSt-on' 8hoy * * (o *10 * l)= o l(o + to l)* tji * 1.- . *= (8) ':.)t(* + 'y)* ' Trace for a string = '-r:. r.9.a(+--w''rxo+lo (t +oo .SblsAb.(10} A-+ba is the context free (rr)!.ta)StateandexplaintheconversionofDFAintoregularexpression an example' usingArden's theorem' fU""tt"[*itft Or' (b) (4 (iil 13.:"i-+a. -' .:.. AibSalSl€toaPDAthat LF)' aecep'tstlresamelanguagebyemptystack. (a) (4 '.:'' '*ttj ::ir.i. Show that any PSPACE-hard PARTB-(5x 16*SOmarks) 11. :i:' :':: Or + qsbl A. .

. or construction? (b) td t'' l:.... (a) machine techniques for Turing (il t-' State the fllustrate with a simple language' (10) models of Turing machines' different the 04 Explain ."d+...... .i *..... i .it'.={o'a}* ' below: A = b..€1i:-la!...' ...l' (iil ktl.i:e..S* (4 (8) (8) (ii) -a'r..:: t? ':r... (a) ({ of $tate t}re halting problem problem orruringnrrLhine tQl tSb halting (8} over {t:TF ae unsavafrei T}vIs' ':" l' .. ':t:tr.t'''... ::'' 662AL 3 .. bab .b&..14.".. ba\ B = \b3..:... given ttrree"'Strings as of lists he B l'et'Aand 3.:l!: .. :::: ri::::.r' . t*o prop"rti""...:r-..::.r of properties what are the closure $r. application? Give two examples' 15..i ...-.*. :i.:::::.... . ui'*''""'"'- 'l :i *t*A* '...:.:.:'i..:::... ansm'er'(8) ' Jotodo"a Justiff Yow otFCP&* instance this Does " -._.. :- =w:.'... r.:::.. i!: '". CFL? state th'e*ifi$'&. 'sfi+ry*ffiatn cFL+' for lemma (u) 1-' state the Pumping ::t-*# - r..r.. ti .:'il:...Ir:i:..:....r.:.r.