Reg. No.

Vel Tech High Tech

Dr.Rangarajan Dr.Sakunthala Engineering College
An Autonomous Institution
MODEL- I
Fifth Semester
COMPUTER SCIENCE AND ENGINEERING
CS8501 – THEORY OF COMPUTATION
(Regulations 2017)
Date: 28.11.2022 Time: 180 Minutes Max. Marks: 100
CO1: To understand the language hierarchy
CO2: To construct automata for any given pattern and find its equivalent regular expressions
CO3: To design a context free grammar for any given language
CO4: To understand Turing machines and their capability
CO5: To understand undecidable problems and NP class problems
CO.No K.No Tim
PART - A (10 x 2 = 20 Marks) Marks
. . e
1. Differentiate between DFA and NFA. CO1 2 3
K2
2. What are the methods of formal proof? CO1 2 3
K1
3. Construct a regular expression for the set of all the strings have CO2 2 3
K3
4. Construct a regular expression for the set of all the strings have CO2 2 3
K1
odd number of 1’sR.E=1(0+11)*.
5. List the operators of Regular Expressions. CO3 2 3
K2
6. Illustrate the rule for construction of CFG from given PDA. CO3 2 3
K3
7. Narrate on Turing machines as Acceptors. CO4 2 3
K1
8. Define Instantaneous description of TM. CO4 2 3
K3
9. Compare and contrast recursive and recursively enumerable CO5 2 3
K4
languages.
10 Define NP hard and NP completeness problem. CO5 2 3
K1
.
PART - B (5 x 13 = 65 Marks)
11 a Explain if L is accepted by an NFA with ε-transition hence CO1 K5 13 25
. ) show that L is accepted by an NFA without ε-transition..
OR
b Solve the NFA that accepts all strings that ends in 01. Give CO1 K4 13 25
) its transition table and the extended transition function for
the input string 0101. Also construct a DFA for the above
NFA using subset construction method.
12 a Demonstrate how the set L= {abn /n>=1}is not a regular. CO2 K5 13 25
. )
OR
b Verify whether L= {a2n|n>=1} is regular or not. CO2 K3 13 25
)
13 a Express the following grammar G into Greibach Normal CO3 K3 13 25
. ) Form(GNF)
S AB
ABS|b
BSA|a

OR
b Consider the grammar CO3 K4 13 25
) SASB| ε
AaAS | a
BSbS | A |bb
Are there any useless symbols, ε-production and unit
production? Eliminate if so.
14 a Explain the TM as computer of integer function with an CO4 K4 13 25
. ) example.
OR
b Write short notes on Two–way infinite tape TM. CO4 K6 13 25
)
15 a Point out the Measuring and Classifying Complexity. CO5 K4 13 25
. )
OR
b Illustrate the various complexity classes with an example. CO5 K3 13 25
)
PART - C (1 x 15 = 15 Marks)
Note: Application/Design/Analysis/Evaluation/Creativity/Case Study questions.
16 a Discuss briefly the finite automation modeling recognition CO4 K6 15 25
. ) of “aabbc”?
OR
b Prove that the universal language is recursively enumerable CO5 K6 15 25
) but not recursive. Generalize your answer.

**********************************ALL THE BEST**********************************

K1 – Remember; K2 – Understand; K3 – Apply; K4 – Analyse; K5 – Evaluate; K6 - Create

Course Instructor HoD/CSE DEAN SoEC DEAN ACADEMICS COE PRINCIPAL