Scribd
Upload
2 views

CS3452 - TOC IAT2 -IICSE

QP

Uploaded by

Kanchanamala
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

CS3452 - TOC IAT2 -IICSE

QP

Uploaded by

Kanchanamala
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

P.T.

Lee Chengalvaraya Naicker


College of Engineering and Technology
Vallal P.T.lee Chengalvaraya Naicker Nagar,
Oovery, Kanchipuram-631502.
Department of Computer Science and Engineering
INTERNAL ASSESSMENT TEST -II
CS3452- THEORY OF COMPUTATION
Branch/Year/Semester : CSE/ II/IV Date : 16.04.2025
Duration : 1 Hr. 30 Min. Maximum : 50 Marks
Answer all questions
PART-A (5 x 2 Marks = 10)

1 Write Regular Expression to denote the language consisting of CO2 Create


all strings over Σ={0,1}with atleast two consecutive 0’s
2 Construct CFG representing the set of palindromes over (a+b)* CO3 Apply

3 Construct Grammar for the language over Σ={a,b}containing CO3 Analyze


atleast one occurrence of ‘aa’
4 Define ContextFreeGrammar CO3 Understand

5 List out the components of PushdownAutomata CO3 Remember

PART-B (2 x 13 Marks =26)


6 Illustrate the Closure Properties of Regular Languages. CO2 Remember
a
(OR)
b i) Using PumpingLemma for regular sets,Prove that the CO2 Apply
language L={ambn / m >n } is not regular.
ii) Write the Chomsky hierarchy of grammar.

7 Construct NFA for the regular Expression CO2 Apply


a i) (01+10)* 10*
ii) ((10)+(0+1))*.0.1
iii) (a/b)*(a+b)

(OR)
b i) Construct a Regular Expression for the given Automata. CO2 Analyze

ii) Define Ambiguous grammar. If G is the grammar


S- S+S / S*S / a. Show that G is Ambiguous grammar
for the string w= a*a+a

PART-C (1 x 14 Marks =14)


8 Explain Derivation and Parse tree. CO3 Apply
a) Let G be the Grammar S  0B / 1A
A0/0S / 1AA
B 1/1S/0BB
Derive the string 00110101.Find Leftmost Derivation and Right
Most Derivation and construct Parse tree.

(OR)

b) CO3 Analyze
i)Write the application of CFG.
ii)Derive the string 00011011 from grammar S-0S1/1S0/SS/ԑ
iii)Show that the grammar S-aS/aSbS/ԑ is ambiguous
iv)Show that the Grammar defined by the production
EE+E/E*E/a with the string a+a*a

You might also like