toc nov 2011.pdf

7/27/2019 toc nov 2011.pdf

http://slidepdf.com/reader/full/toc-nov-2011pdf 1/3

I

Reg. No.:

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

B.E, / B.Tech. DESREE ExAMINATISN, N9vEMBER/ DEcEfuER *o'1,;l .''nl ::: iii,'l'..r:i:

Fifth Semester

Time: Three hours Maximum: 100 marks

1.

2.

E.

4.

Computer Science and Engineering"t''it' .= ii::""u:'

'.;',,.:'

CS 2303 -THEORY OF COMPU.TATION,,,,,,,,,.1:',,,,,,,

,,,,"ii"', ,..,."::1.;,,.,. "a,'r,_,,, ,

(Common to Seventh Semester Information Teihnolqfl' :i"i::'

(Regulation 2008)

... l

Answer AL"L qrlestions''ti .:

PART A- (1,9, t 2, = 2O'marks)':::i., .,,0,*'

What is stmctural inductifin? *'*=.,,,,,,.,,_, ,';':"

State the difference NFA'and D-FA.

':t' j .l

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

{a) Atl strings t}rat contain ABqlS 4 nros.

(b) All strings that don't contain the substring 11O'

Is the set of stringsover the alphabet

{O}of dre form 0n where n is not a

prime is :#ggtji?'Frore or disprove':]t-

':::; i:,i= i::':':':s -+ss l(sls(s)slE ?,. Is the graTPaAUp,Xow,,ambiguousl

G;;;"th;"*ftflfloitirrg gr€rmmar into an equivalent

litp.dfircHons'ihpn$,:.:"*'and no useless symbols S '+ ABA

one with no unitA -+ aAAlancpt

ll;

8.

,'u'\,,.,+ lpfi lcb,G',:''-+CCI cC .

r ''i .,i.'

."'.'ig"

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

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

L I o I \ ) + O /+ 6

7/27/2019 toc nov 2011.pdf


9.

10.

How to prove tJ:at the Post Correspondence Problem is Undecidable'

Show that any PSPACE-hard language is also NP-hard'

PARTB-(5x 16*SOmarks)

Prove that JI is not rational'

Construct a DFA accepting all strings

the number of l's in ur is 3 mod 4'

11. (a) (4

ti1)

tltat

Or

fbl Construct a minimized DFA from 'thi' regular expresslon

\-'

it*,)t(*+

'y)* 'Trace for a string v) = )ffyx ' '-r:;;::'

12.ta)StateandexplaintheconversionofDFAintoregularexpressionusingArden's theorem' fU""tt"[*itft an example' (16)

Or'',:, .

(b) (4 What are the clos-ure propefg oi re'Sillar sets?

(iil Define regular e4predSt-on' 8hoy that

tji (o *10 * l)= o * l(o + to * l)*(t +oo * 1;a(+--w''rxo+lo

*=.':.-

.,i.

13. (a) (4 Is NP-DA tnfutt- 1'tinig ro4 andDPDA

equivalent? Illustrate ith an example'

(i4 What are tJ'e different typ": oflSguage

acceptances by a PDA

and define tt'"m' l" it tnie tfrat thJanguage accepted by a PDA

by theS. affer"nt types provides different languages? (8)

Or' a. :i:' :'::

"i'i,, ,,i.:''nar S + qsbl A, AibSalSl€toaPDAthat

'Convert'the gramn

aecep'tstlresamelanguagebyemptystack.(10}(rr) , r,:"i-+a,SblsAb, A+bAa' A-+ba is the

'*ttj -' $"***. Determine the context free larrggage

::ir,:,.,r:i:'

t8)

(8)

PDA)

(8)

LF)' (1l

context free

(6)

662AL

7/27/2019 toc nov 2011.pdf


14. (a)

15. (a)

(b)

(il State the techniques for Turing machine construction?

t-'fllustrate with a simple language'

04 Explain the different models of Turing machines'(10)

orr,,,,.t''',

,._.,

td what are the closure properties of CFL? state th'e*ifi$'&..r$r,''

t*o prop"rti"". ..:r-.:;;i:e,,-,.l:,, ,';i -

(u) state the Pumping lemma for cFL+' 'sfi+ry*ffiatn1-'

application? Give two examples'. ui'*''""'"'- 'l ::t-*#

':":i

l'

({ $tate t}re halting problemof T}vIs' *t*A* tQl tSb halting

problem orruringnrrLhine over {t:TF ae unsavafrei (8}

',,r,,,,,,,,,,,,,,".,,;l'

.

(iil ktl,={o'a}* ' l'et'Aand B he lists of ttrree"'Strings as given

below:

A = b, bab 3, ba\ B = \b3,.,,b&."d+,r,:::.,:::,:::::...

'"

Jotodo"a Justiff Yow ansm'er'(8)

Does this instance otFCP&* -. :-

=w:,,,.,,.'.S* (8)

(8)4

(ii)

'r..€1i:-la ,:-a 'il:.:'i;it'..*,,.::::

ri::::.

ti *,r,,:l : :i,:,.i . r;Ir:i:... i :

'";;:: ':r,....,:,r' i,:,::,,.,,

t? ':t:tr.:,. . ::''

3662AL

Documents

toc nov 2011.pdf