Scribd
Upload
13 views6 pages

2 Marks

The document contains multiple question papers for B.E./B.Tech. degree examinations in Computer Science and Engineering, specifically focusing on the Theory of Computation. Each paper includes a variety of questions divided into two parts, covering topics such as automata, context-free grammars, Turing machines, and computational complexity. The exams are structured to assess students' understanding of theoretical concepts and their applications in computation.

Uploaded by

kaviharavichandran0740
Copyright
© © All Rights Reserved
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
13 views6 pages

2 Marks

The document contains multiple question papers for B.E./B.Tech. degree examinations in Computer Science and Engineering, specifically focusing on the Theory of Computation. Each paper includes a variety of questions divided into two parts, covering topics such as automata, context-free grammars, Turing machines, and computational complexity. The exams are structured to assess students' understanding of theoretical concepts and their applications in computation.

Uploaded by

kaviharavichandran0740
Copyright
© © All Rights Reserved
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/ 6

EnggTree.

com

Downloaded from EnggTree.com


*X60383* Reg. No. :

Question Paper Code : X 60383


B.E./B.Tech. Degree Examinations, NOVEMBER/DECEMBER 2020
Fifth Semester
Computer Science and Engineering
CS 2303/CS 53/CS 1303/10144 CS 504 – Theory of Computation
(Regulations 2008/2010)
(Common to PTCS 2303 – Theory of computation for B.E. (Part-Time) Fifth
semester-Computer science and Engineering – Regulations 2009)

Time : Three hours maximum : 100 marks

Answer all questions

Part – A (10×2=20 Marks)

1. Draw the transition diagram (automata) for an identifier.

2. What is a non deterministic finite automaton ?

3. Construct NFA for the regular expression a*b*.

4. Is regular set is closed under complementation ? Justify.

5. What is a CFG ?

6. Define the term Ambiguity in grammars.

7. State the pumping lemma for CFLs.

8. What are the applications of Turing Machine ?

9. What is meant by recursive enumerable language ?

10. Define PCP.


Reg. No. :

Question Paper Code : 40395

B.E./B.Tech. DEGREE EXAMINATIONS, NOVEMBER/DECEMBER 2021.

Fifth Semester

Computer Science and Engineering

CS 8501 –– THEORY OF COMPUTATION

(Regulations 2017)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)


1. Write regular expression to represent exponential constants of ‘C’ language.
2. Define extended transition diagram.
3. Write regular expression to recognize the set of strings over {a,b} having odd
number of a’s and b’s and that starts with ‘a’.
4. When two states are said to be distinguished? Give example.
5. Write CFG to accept the language defined by,
{ i j k
L = a b c i, j, k >= 0 and i = j + k . }
6. List out the steps for performing LL parsing.
7. Draw pushdown automata to accept all palindromes of odd length.
8. Formally define the pushdown automata based on the types of acceptance.
9. Draw Turing machine to compute double the value of an integer.
10. State Post’s correspondence problem.

PART B — (5 × 13 = 65 marks)
11. (a) Design an ε – NFA (Nondeterministic finite automaton) to recognize the
language L, containing only binary strings of non-zero length whose bits
sum to a multiple of 3. Convert ε – NFA into an equivalent minimized
deterministic finite automaton. Illustrate the computation of your model
on any sample input.
Or
*X10319* Reg. No. :

Question Paper Code : X 10319


B.E./B.Tech. Degree ExaminationS, november/december 2020
Fifth Semester
Computer Science and Engineering
CS 8501 – THEORY OF COMPUTATION
(Regulations 2017)

Time : Three Hours Maximum : 100 Marks

Answer all questions

Part – A (10×2 = 20 Marks)

1. Define Deterministic Finite Automaton.

2. State any four types of proofs.

3. Write the regular expression for all strings that contain no more than one
occurrence of aa.

4. Write a regular expression for even number of a’s and even number of b’s of a
string w = {a, b}*.

5. Write a Context Free Grammar for the language consisting of equal number of
a’s and b’s.

6. Define Deterministic PDA.

7. What are the two normal forms of CFG ? Write their productions format.

8. Define the language recognized by any Turing Machine.

9. What are recursive languages ?

10. Define the classes P and NP problem. Give example problems for both.

Part – B (5×13 = 65 Marks)

11. a) Prove that for every L recognized by an NFA, there exists an equivalent DFA
accepting the same language L.
(OR)
b) Prove that for every L recognized by an ∈-NFA, there exists an equivalent DFA
accepting the same language L.
*X20402* Reg. No. :

Question Paper Code : X 20402


B.E./B.Tech. Degree Examinations, november/december 2020
Fifth/Eighth Semester
Computer Science and Engineering
CS6503 – theory of computation
(Common to : Information Technology)
(Regulations 2013)

Time : Three Hours Maximum : 100 Marks

Answer all questions

Part – A (10×2=20 Marks)

1. Find the set of strings accepted by the finite automata.

2. Prove that L = {aibi | i ≥ 0} is not regular.

3. Difference between regular expression and regular language.

4. Consider the following grammar G with productions.


S → aaSb
S → λ

5. State the pumping lemma for CFLs.

6. Design a DFA to accept the language. L = {w/w is of even length and begins with 01}.

7. Define Turing machine.

8. What is halting problem ?

9. How to prove that the post correspondence problem is undecidable ?

10. Differentiate NP-hard and NP-completeness problem.

You might also like