Scribd
Upload
125 views3 pages

Toc Nov 2011 PDF

This document appears to be an exam question paper for a theory of computation course. It contains 10 multiple choice and short answer questions covering topics like structural induction, finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and problems related to formal languages and computability. It asks students to define concepts, prove statements, construct examples, and determine language properties and relationships between models of computation.

Uploaded by

Anirudhan Ravi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
125 views3 pages

Toc Nov 2011 PDF

This document appears to be an exam question paper for a theory of computation course. It contains 10 multiple choice and short answer questions covering topics like structural induction, finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and problems related to formal languages and computability. It asks students to define concepts, prove statements, construct examples, and determine language properties and relationships between models of computation.

Uploaded by

Anirudhan Ravi
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

I

Reg. No.:

L I

) +O

/+

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

grrmmar
.

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

."'.'

''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'

9.

Undecidable' Correspondence Problem is How to prove tJ:at the Post language is also NP-hard' 10. Show that any PSPACE-hard

PARTB-(5x 16*SOmarks)

11. (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*,)t(* + 'y)* ' Trace for a string =
'-r:;;::'

(16) 12.ta)StateandexplaintheconversionofDFAintoregularexpression an example'

usingArden's theorem'

fU""tt"[*itft

Or'
(b) (4 (iil
13. (a) (4
',:, . 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;a(+--w''rxo+lo (t +oo .

*=

(8)

':.-

.,i.

Is NP-DA tnfutt- 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. by
' a. :i:'
:'::

Or

+ qsbl A, AibSalSltoaPDAthat LF)' aecep'tstlresamelanguagebyemptystack.(10} A-+ba is the context free (rr)!, r,:"i-+a,SblsAb, A+bAa'
(1l

"i'i,, 'Convert'the gramnnar S

,,i.:''

'*ttj
::ir,:,.

-'
,r:i:'

$"***.

larrggage Determine the context free

(6)

662AL

14.

(a)

machine techniques for Turing (il t-' State the fllustrate with a simple language' (10) models of Turing machines' different the 04 Explain ,._., or

construction?

(b)

td t''

l:,, ,';i ..:r-.:;;i:e,,-,. t*o prop"rti"". 'sfi+ry*ffiatn cFL+' for lemma (u) 1-' state the Pumping ::t-*#
-

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

$r,

application? Give two

examples'

15.

(a)

({

of $tate t}re halting problem


problem orruringnrrLhine

tQl tSb halting (8} over {t:TF ae unsavafrei


T}vIs'
':"
l'

ui'*''""'"'-

'l

:i

*t*A*

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

(iil ktl,={o'a}* '


below:
A = b,
bab

. given ttrree"'Strings as of lists he B l'et'Aand

3, ba\ B = \b3,.,,b&."d+,r,:::.,:::,:::::... ansm'er'(8) ' Jotodo"a Justiff Yow otFCP&* instance this Does " -. :-

=w:,,,.,,.'

.S*
(4

(8) (8)

(ii)

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

ti .i

*,r,,:l!:
.

r;Ir:i:...

:i,:,
i!:

'";;::
t?

':r,....,:,r' ,:,::,,
':t:tr.:,.

.,,

::''

662AL
3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy