Important Questions For Theory Of Computation
- 1. CS3452/CS8501 MOST IMPORTANT QUESTIONS Pass Easy Medium Hard Understand Easy Medium Hard Mark Score Easy Medium Hard Theory Numerical/Programs
- 2. Unit 1 ● Need for automata theory ● Introduction to formal proof ● Finite Automata (FA) ○ Deterministic Finite Automata (DFA) ○ Non-deterministic Finite Automata (NFA) ○ Finite Automata with Epsilon transitions ● Equivalence between NFA and DFA ● Equivalence of NFAs with and without ε-moves ● Conversion of NFA into DFA ● Minimization of DFAs.
- 5. Unit 2 ● Regular expression ● Regular Languages ● Equivalence of Finite Automata and regular expressions ● Proving languages to be not regular (Pumping Lemma) ● Closure properties of regular languages.
- 6. Unit 3 ● Types of Grammar - Chomsky‘s hierarchy of languages ● Context-Free Grammar (CFG) and Languages ● Derivations and Parse trees – Ambiguity in grammars and languages ● Push Down Automata (PDA): Definition – Moves - Instantaneous descriptions -Languages of pushdown automata ● Equivalence of pushdown automata ● CFG-CFG to PDA-PDA to CFG ● Deterministic Pushdown Automata
- 7. Source : stucor website
- 8. Unit 4 ● Normal forms for CFG ○ Simplification of CFG ○ Chomsky Normal Form (CNF) ○ Greibach Normal Form (GNF) ● Pumping lemma for CFL ● Closure properties of Context Free Languages ● Turing Machine : Basic model – definition and representation – Instantaneous Description – Language acceptance by TM – TM as Computer of Integer functions – Programming techniques for Turing machines (subroutines).
- 9. Source : stucor website
- 10. Source : stucor website
- 11. Unit 5 ● Unsolvable Problems and Computable Functions –PCP-MPCP ● Recursive and recursively enumerable languages – Properties ● Universal Turing machine -Tractable and Intractable problems ● P and NP completeness ○ Kruskal’s algorithm ○ Travelling Salesman Problem ○ 3-CNF SAT problems.
- 12. Source : stucor website
- 13. ORDER OF UNITS PREPARATION MARK SCORING PASS MARK ONLY