Scribd
Upload
16 views3 pages

CS3452 - TOC-modelexam-QP-IICSE

The document is a model exam for the Theory of Computation course at P.T. Lee Chengalvaraya Naicker College of Engineering and Technology. It consists of two parts: Part A with 10 short answer questions and Part B with 5 long answer questions, covering topics such as NFA, DFA, regular expressions, context-free grammar, and Turing machines. The exam is scheduled for May 17, 2025, with a total duration of 3 hours and a maximum score of 50 marks.

Uploaded by

Kanchanamala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
16 views3 pages

CS3452 - TOC-modelexam-QP-IICSE

The document is a model exam for the Theory of Computation course at P.T. Lee Chengalvaraya Naicker College of Engineering and Technology. It consists of two parts: Part A with 10 short answer questions and Part B with 5 long answer questions, covering topics such as NFA, DFA, regular expressions, context-free grammar, and Turing machines. The exam is scheduled for May 17, 2025, with a total duration of 3 hours and a maximum score of 50 marks.

Uploaded by

Kanchanamala
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
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
MODEL EXAM
CS3452- THEORY OF COMPUTATION
Branch/Year/Semester : CSE/ II/IV Date : 17.05.2025
Duration : 3 HRS. Maximum : 50 Marks
Answer all questions
PART-A (10 x 2 Marks = 20)

1 Differentiate NFA and DFA CO1 Analyze

2 Draw the transition diagram to recognise a constant CO1 Apply

3 Prove that reversal of any regular language is also a regular CO2 Understand

4 Give a regular expression for any language containing symbols(0,1) CO2 Create
and strictly ends with 1.
5 Define ContextFreeGrammar . CO3 Understand

6 List out the components of Pushdown Automata. CO3 Remember

7 State the Pumping Lemma for Context Free Language CO4 Understand

8 Tabulate the difference between CNF and GNF CO4 Remember

9 List down the properties of recursively enumerable set CO5 Understand

10 Define Class P and NP Class Problems. Give examples CO5 Remember

PART-B (5 x 13 Marks =65)


6 Convert the following NFA with ɛ to NFA without ɛ. CO1 Remember
a

(OR)
b CO1 Apply
Prove that for every L recognised by an NFA ,there exists an
equivalent DFA accepting the same language L.

7 Prove that regular expressions are closed under union, CO2 Understand
a concatenation, kleen closure, complement
OR
b Prove that any language accepted by DFA can be represented by CO2 Apply
regular expression and also construct a finite automata for the
regular expression 10+(0+11)0*1
(OR)
8a Design a PDA that will accept strings (a+b)*in which the number of CO2 Analyze
a’s is greater than the number of b’s given the alphabet £=(a,b)
ii) Convert the above PDA to its equivalent CFG.

(OR)

b Let G=(V,E,T,S) be the CFG where S-aB | bA CO3 Remember


A-a| aS |BAA
B-b| bS|ABB
i)Prove that ababba € L(G)
ii) Prove that L(G) is the set of all non empty strings w over the
alphabet{a,b}such that number of a’s in w is equal to number of b’s
in w

9a i)Convert the following grammar to CNF CO4 Apply


S ASB | €
A-aAS| a
B-SbS| A |bb
ii)Design a Turing Machine to compute proper subtraction
b i) Explain the Programming technique for Turing machine CO4 Remember
ii) Convert the following grammar to GNF
A1---A3A2|A2A3
A2---A3A3|A2A2|a
A3--A2A2|b
10 i)Explain about Universal Turing Machine CO5 Understand
a ii)Write short notes on P and NP Completeness.
(OR)

b Find the following Languages are recursively Enumerable. CO5 Remember


i)Union of Recursively Enumerable Language
ii) L and Complement of L are Recursively Enumerable.
PART C (1x15=15 marks)

11 Construct a PushDown Automata for the below mentioned language: CO3 Apply
a) L(G)=(w|w€(a,b,c,d) and w is of the form anbmcmdn and (m,n>-1).Also
mention the state transitions of this PDA while parsing the string
w=’baacaab’
(OR)
b) Construct a Turing Machine to implement a Multiplication operation CO4 Analyze
f(m,n)=m*n where m and n are positive integers and simulate their
action as input 5*4.

You might also like