Scribd
Upload
16 views2 pages

TOC Model

This document is a model examination for the B.E. CSE program at Surya Group of Institutions, focusing on the Theory of Computation. It includes two parts: Part A consists of nine short-answer questions, while Part B contains four detailed problems related to automata, grammars, and Turing machines. The exam is scheduled for 90 minutes and has a maximum score of 50 marks.

Uploaded by

mkkamalesh3
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 views2 pages

TOC Model

This document is a model examination for the B.E. CSE program at Surya Group of Institutions, focusing on the Theory of Computation. It includes two parts: Part A consists of nine short-answer questions, while Part B contains four detailed problems related to automata, grammars, and Turing machines. The exam is scheduled for 90 minutes and has a maximum score of 50 marks.

Uploaded by

mkkamalesh3
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/ 2

SURYA GROUP OF INSTITUTIONS

School of Engineering and Technology


Model Examination

Degree &Branch: B.E , CSE Semester : IV


Date : 21 / 05 / 2025 /AN Time : 90 Mins. Max.Marks : 50

CS3452 / THEORY OF COMPUTATION

PART A (9X2=18)
1. Mention the four types of proofs.
2. Define finite automaton and give one example.
3. Write Regular Expressions for the following languages:
a. The set of strings over alphabet {a,b,c} containing at least one a and at least one b.
b. The set of all strings of 0’s and 1’s with at most one pair of a consecutive 1’s.
4. Give the operator precedence of Regular Expression.
5. What is Ambiguous Grammer?
6. What are the two normal forms of CFG? Write their production format.
7. What is recursively enumerable language?
8. Define P and NP class
9. State post correspondence problem.

PART B (4X13=52)
10. a) Convert the following NFA to DFA.

(OR)
b) Convert the following NFA-with ε to NFA without ε

11. a) Construct the PDA accepting the language {(ab)n/n>0} by empty stack.
(OR)
b) Construct PDA for the Language L= {WWR | W is in (a+b)*}.
SURYA GROUP OF INSTITUTIONS
School of Engineering and Technology
Model Examination

12. a) What is the purpose of normalization? Construct the CNF and GNF for the following
----grammar and explain the steps.
S aAa | bBb | €
A C|a
B C |b
C CDE | €
D A |B|ab
(OR)
b). Explain about Turing Machines and Construct the Turing machine for the language L = {1n0 n 1 n
------
/n >=1 }

13. a) State the steps of the pumping lemma for CFL. Use pumping lemma to show that the language L=
{aibjck/i<j<k} is not a CFL.
(OR)

b) Simply the following grammar by eliminating null productions, unit production and useless
symbols and then convert to CNF.
S ABC/BaB
A aA/ BaC/aaa
B bBb/a/D
C CA/AC
D ξ

You might also like