-->

CS6503 Theory of Computation Syllabus Notes Question Bank with answers

Anna University CS6503 Theory of Computation Notes Syllabus 2 marks with answers Part A Question Bank with answers
Anna University CS6503 Theory of Computation Syllabus Notes 2 marks with answer is provided below. CS6503 Notes Syllabus all 5 units notes are uploaded here. CS6503 TOC Syllabus notes download link is provided and students can download the CS6503 Syllabus and Lecture Notes and can make use of it.
Anna University Regulation 2013 Notes Syllabus Question Papers Question Banks - Rejinpaul
Click below link to download CS6503 Theory of Computation Study Materials .
CS6503 THEORY OF COMPUTATION  SYLLABUS REGULATION 2013
UNIT I FINITE AUTOMATA
Introduction- Basic Mathematical Notation and techniques- Finite State systems – Basic Definitions – Finite Automaton – DFA & NDFA – Finite Automaton with €- moves – Regular Languages- Regular Expression – Equivalence of NFA and DFA – Equivalence of NDFA’s with and without €-moves – Equivalence of finite Automaton and regular expressions –Minimization of DFA- - Pumping Lemma for Regular sets – Problems based on Pumping Lemma.

UNIT II GRAMMARS
Grammar Introduction– Types of Grammar - Context Free Grammars and Languages– Derivations and Languages – Ambiguity- Relationship between derivation and derivation trees – Simplification of CFG – Elimination of Useless symbols - Unit productions - Null productions – Greiback Normal form – Chomsky normal form – Problems related to CNF and GNF.

UNIT III PUSHDOWN AUTOMATA
Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata – Equivalence of Pushdown automata and CFL - pumping lemma for CFL – problems based on pumping Lemma.

UNIT IV TURING MACHINES
Definitions of Turing machines – Models – Computable languages and functions –Techniques for Turing machine construction – Multi head and Multi tape Turing Machines - The Halting problem – Partial Solvability – Problems about Turing machine- Chomskian hierarchy of languages.

UNIT V UNSOLVABLE PROBLEMS AND COMPUTABLE FUNCTIONS
Unsolvable Problems and Computable Functions – Primitive recursive functions – Recursive and recursively enumerable languages – Universal Turing machine. MEASURING AND CLASSIFYING COMPLEXITY: Tractable and Intractable problems- Tractable and possibly intractable problems - P and NP completeness - Polynomial time reductions.
Click below link to download the Notes and 2 marks with answers Question Bank Question Papers



CS6503 TOC Notes - Click here (UPDATED)
CS6503 TOC Notes - Click here (Notes-2)
CS6503 TOC Notes - Click here (Notes-3)

CS6503 TOC 2 marks with answers - Click here(QB-1)
CS6503 TOC 2 marks with answers - Click here(QB-2)
CS6503 TOC Question Bank - Click here
CS6503 TOC Question Bank - Click here
CS6503 TOC Question Bank - Click here
CS6503 TOC Question Bank - Click here
CS6503 TOC Question Papers (Previous year) - Click here


If you have any problem in downloading the above material , you can comment below.
search by students 

CS6503 Theory of Computation Anna university 5th semester Regulation 2013 notes
CS6503 Theory of Computation Anna university 8th semester Regulation 2013 notes
CS6503 Theory of Computation Syllabus Notes 4th Semester- common for all Departments
CS6503 Theory of Computation Notes Syllabus Question Papers Question Bank 2 marks with answers
CS6503 Theory of Computation Syllabus Notes Question Bank with answers CS6503 Theory of Computation Syllabus Notes Question Bank with answers Reviewed by Anirudhan R on June 20, 2015 Rating: 5

No comments:

Post Your comments,Views and thoughts Here, Give Us Time To Respond Your Queries

Powered by Blogger.