Module I Topics Proving techniques Mathematical induction Diagonalization principle Pigeonhole principle Primitive recursive and partial recursive

rsive functions Computable and non computable functions

Chomsky Classification of languages.

Questions
1.

Write notes on: Countable and Uncountable sets Equinumerous sets Mathematical Induction

2. 3.

Explain diagonalization principle. Show that 2n is uncountable. Differentiate between Primitive recursive and Partial recursive functions with examples. Prove that the functions i) fadd (x,y) = x+y ii) g(x,y)=xy are primitive recursive.

4. Differentiate between computable and non computable functions

5.

Define a grammar and explain the various types of grammar. (Chomsky hierarchy of formal languages)

Module II Topics Automata Definition DFA & NFA Regular Expression

NFA DFA

Minimization of DFA

DFA Regular Expression - NFA

Pumping Lemma for Regular Languages Moore / Mealy Machine

Finite automata Applications

Questions
1.

Differentiate NFA and DFA . Construct a DFA that accepts L={w {a,b}* | no. of as in w is even and no. of bs in w is odd} Prove that for every non deterministic finite automaton there is an equivalent deterministic finite automaton. (Prove the equivalence of NFA and DFA) State and prove pumping lemma for regular languages. Show that L= { 0n 12n | n 1} is not regular. Explain the steps for Minimization of DFA. Find a minimal DFA for the language L= { an bm | n 2, m 1} Define regular expression. Draw a DFA for the regular expression ((a* + b*)*) a*

2.

3.

4.

5.

Module III Context Free Grammar Simplification of CFG

Normal forms-CNF and GNF Pumping lemma for CFL

Pushdown Automata Formal definition Deterministic and nondeterministic PDA

Designing of PDA and Language acceptability by PDA empty stack and final state

through

PDA - applications Questions

1.

Define Context free grammar and CFL. Design a context free grammar that accepts the language L={0n1n|n1} useless productions and

2. Remove all unit productions, productions from the grammar: SaA|aBB AaaA | B bB|bbC CB grammar generate?
3.

What Language does this

Explain two normal forms of Context free grammar. Convert the grammar S ABb|a, AaaA|B, BbAb into greibach normal form. State and prove pumping lemma for CFL. Show that { 0x | x is prime } is not context free. Differentiate between DPDA and NPDA.Design a PDA that accepts the language L={w|w contains equal number of 0s and 1s} from the input alphabet {0,1}.

4.

5.

Module IV Topics

Turing Machines Formal definition Language acceptability by TM TM as acceptors, Transducers Designing of TM- Two way infinite TM- Multi tape TM - Universal TM Churchs Thesis Godelization Time complexity of TM Halting Problem Rice theorem Post correspondence problem Linear Bounded Automata.

Questions
1.

Define: i)TM ii) ID of a TM iii) Church Turing Thesis iv) Universal TM Explain i) Godelization ii) Post Correspondence Problem

2.

3. Design a TM with the initial tape as 01110111110.. and the output pattern 01111101110.
4.

Explain the halting problem of turing machine. Prove that it is undecidable.

5. i) Construct a TM that increments a binary number ii) Construct a TM that adds two unary numbers

Module V Topics

Complexity Classes - Class P, Class NP Tractable and Intractable problems

P Complete -Reduction problem Context grammar nonempty

Cooks theorem NP Complete Reduction problems SAT Clique Hamiltonian TSP Vertex Cover

NP Hard problems. Questions Define : i) Tractable and Intractable problems ii)Cooks theorem Explain P,NP, P complete, NP complete and NP hard problems with examples. Prove that TSP is NP Complete Prove that 3SAT is NP Complete. 5. Show that the problem of checking whether a graph has a clique of size k is NP complete.