CS2303 Theory of Computation MJ2014 Question Paper

Sponsored Ads:

Quick Links

University Papers	University Syllabus	Entrance Exam
PSU Papers	Bank Papers	Placement Papers
VTU	Anna Univerity Syllabus	Anna Univerity Papers

Anna University , Chennai

Question Paper Code : 51348

B.E./B.Tech. DEGREE EXAMINATIONx MAY/JUNE 2014.

Fifth Semester

Computer Science and Engineering

CS 2303/CS 53/ 10144 CS 504 — THEORY OF COMPUTATION

(Common to Seventh Semester Information Technology)

(Regulation 2008/2010)

(Common to PTCS 2303 — Theory of computation for B.E. (Part-Time) Fifth Semester Computer Science and Engineering — Regulation 2009)

University Papers | Syllabus | Entrance Exam | Govt & PSU Papers | Bank Papers

Programming Questions | Travel Tips | Mobile Review | Placement Papers | Books

ANNA UNIVERSITY SYLLABUS: CLICK HERE

OTHER DEPARTMENT PAPERS: CLICK HERE

Download PDF File - CLICK HERE

For More Question paper of CSE - CLICK HERE

For more question paper of IT - CLICK HERE

PART A — (10 x 2 20 marks)

1.What is a finite automaton?
2.Enumerate the difference between DFA and NFA.
3.Construct a finite automaton for the regular expression 
4.Mention the closure properties of regular languages.
5.Construct a CFG for the language of palindrome strings over (a, b).
6.What do you say a grammar is ambiguous?
7.State pumping Lemma for context free languages.
8.Define a turing machine.
9. When a language is said to be recursively enumerable?
10.Define the classes P and NP.