CS8501 Theory Of Computation Important Questions for Nov/Dec 2019

CS8501 THEORY OF COMPUTATION PREVIOUS YEAR QUESTIONS

Theory of Computation (TOC) previous year questions have been given below from the year 2016 to 2019.

Previous Year Question Papers:

1. TOC April / May 2019

2. TOC Nov / Dec 2018

3. TOC April / May 2018

4. TOC Nov / Dec 2017

5. TOC April / May 2017

6. TOC Nov/ Dec 2016

How to Get Pass in CS8501 Theory of Computation

• Try to solve the problems faster, because TOC is an problematic paper and it takes more time.
• Attend the Questions which you have practiced more number of times.
• If a Question looks tough, solve it after completing all the remaining questions.

1. AUTOMATA FUNDAMENTALS

For the first unit the important questions based on the syllabus are:

Deterministic Finite Automata – Non-deterministic Finite Automata – Finite Automata with Epsilon Transitions

2. REGULAR EXPRESSIONS (RegEx) AND LANGUAGES

For the second unit the important questions based on the syllabus are:

Proving Languages not to be regular – Closure Properties of Regular Languages – Equivalence and Minimization of Automata.

3. CONTEXT FREE GRAMMAR (CFG) AND LANGUAGES

For the third unit the important topics based on the anna university syllabus are:

Equivalence of Pushdown Automata and CFG, Deterministic Pushdown Automata.

4. PROPERTIES OF CONTEXT FREE LANGUAGES (CFL)

For the fourth unit the important questions or topics based on the syllabus are:

Pumping Lemma for CFL – Closure Properties of CFL – Programming Techniques for TM.

5. UNDECIDABILITY (UD)

For the fifth unit the most important question or important topic based on the syllabus are:

Post‘s Correspondence Problem, The Class P and NP.