Format ACD-

ST.JOSEPH’S COLLEGE OF ENGINEERING AND TECHNOLOGY No. CF-QB

Elupatti, Thanjavur – 613 403 Issue
01
No.
QUESTION BANK Rev. No. 00

Academic Year : 2024-2025 / EVEN

Dept / Year / Semester : CSE / II / IV
Subject Code & Name :CS3452 & THEORY OF COMPUTATION
Remembering(R) – Level 1, Understanding (U) – Level 2, Applying (Ap) – Level 3,
Analyzing (Az) – Level 4, Evaluating (E) – Level 5, Creating (C) – Level 6.

UNIT I - AUTOMATA AND REGULAR EXPRESSIONS

Need for automata theory – Introduction to formal proof – Finite Automata (FA) – Deterministic Finite
Automata (DFA) – Non-deterministic Finite Automata (NFA) – Equivalence between NFA and DFA – Finite
Automata with Epsilon transitions – Equivalence of NFA and DFA- Equivalence of NFAs with and without ε-
moves- Conversion of NFA into DFA – Minimization of DFAs.

PART-A
Learning
Q.No Questions CO’S
Level

1. State the Principle of induction. R

C210.1

2. What is proof by contradiction? U

C210.1

3. Define Finite Automata (FA) and Transition Diagram. U

C210.1
Define ε-closure(q) with an example.
4. R
C210.1
Differentiate between proof by contradiction and proof by contrapositive.
5. R
C210.1
Construct a DFA for the language over {0, 1}* such that it contains “000” as a
6. substring. C210.1 Ap

What is structural induction?

7. U
C210.1

8. Construct deterministic finite automata to recognize odd number of 1’s Ap

and even number of 0’s? C210.1
Find the set of strings accepted by the finite automata.
9. R
C210.1
10. What is meant by DFA R
 C210.1
11. Define the term Epsilon transition C210.1 U
What is non deterministic finite automata?
12. U
C210.1
Define Deductive Proof.
13. R
C210.1
Design DFA to accept strings over ∑ = (0,1) with two consecutive 0’s
14. U
C210.1
PART-B
Prove the following by induction for all n≥0
C210.1
2 2 2 2 2
i. 1 +2 +3 +4 +…….+n =(n(n+1)(2n+1))/6
1. Ap
ii.13+23+….+n3=(n2(n+1)2)/4

Prove by Induction that S(n)=52n -1is divisible by 24 for n>0 1+2+……

2. +n=(n(n+1))/2 C210.1 Ap

Discuss the application of FA Constructa DFA that accepts all strings on {0,1}
3. Ap
except those containing the substring101 C210.1
Design a NFA accept the following strings over the alphabets {0,1} that begins
4. Ap
with 01 and ends with 11. Check for the validity of 01111and 0110 strings. C210.1

5. Construct DFA which recognize L={bmabn/m,n>0} C

C210.1
Determine the DFA from a given NFA

C210.1
6. C

7. Ap
C210.1
Convert the epsilon NFA andl is the difference between NFA and DFA.

Give NFA accepting the set of strings in (0+1)* such that two 0‘s are separated
8. by a string whose length is 4i,for some i>=0. C210.1 C

UNIT II - REGULAR EXPRESSIONS AND LANGUAGES

Regular expression – Regular Languages- Equivalence of Finite Automata and regular expressions – Proving
languages to be not regular (Pumping Lemma) – Closure properties of regular languages.

PART-A
Learning
Q.No Questions CO’S
Level
1. Define regular expression and give an example U
C210.2
2. State the relations among regular expression, deterministic finite automata, non
deterministic finite automaton and finite automaton with epsilon transition. C210.2 U

3. Write Regular Expression for the set of strings over {0.1} that have atleast one. C210.2 Ap

4. State the pumping lemma for regular languages. C

C210.2
5. Give a regular expression for the set of all strings having odd number of 1’s Ap
C210.2

6. Give the regular expression for the set of all strings ending in 00. Ap
C210.2
7. What are the applications of regular expression? U
C210.2
8. State Arden’s theorem. U
C210.2
9. Differentiate L* and L+ U
C210.2
Construct a r.e for the language over the set ={a,b} in which total number of a’s
10. are divisible by 3 C210.2 Ap

Regular expression denoting a language over ∑ ={1} having (i) even length of
11. string (ii) odd length of a string. C210.2 Ap

12. What are the applications of pumping lemma? C210.2 R

13. Lists on the closure properties of Regular sets. C210.2 R

PART – B

1. Using pumping lemma for the regular sets, prove that the language Ap
C210.2
L={ambn/m>n} is not regular
2. Prove any two closure properties of regular language C210.2 R

3. Construct a minimized DFA from R.E 0*(01)(0/111)*. C210.2 Ap

Prove that the following languages are not regular
C210.2

4. i.{02n/n>0} Ap
ii.{ambnam+n/m>0andn>0}

5. Prove that the class of regular sets is closed under complementation C

C210.2
 6. Construct a minimized DFA for the RE 10+(0+11)0*1 C
C210.2

UNIT III - CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA

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
and CFG-CFG to PDA-PDA to CFG – Deterministic Pushdown Automata.

PART-A
Learning
Q.No Questions CO’S
Level
1. Define CFG. R
C210.3
2. Construct context free grammar {0 m 1 n |1<=m<=n} Ap
C210.3
3. Define Ambiguous Grammar? Give an Example U
C210.3
Define a derivation tree for a CFG. C210.3
4. U
Let G = (N,T,P,S), P ={S->A1B|a, A->0A| ε , B->0B|1B| ε } give a leftmost
5. C210.3 Ap
and rightmost derivation for the string 00101

Is the grammar below ambiguous S SS | (S) | S(S)S | E?

6. C210.3 Ap

Construct a CFG for set of strings that contain equal number of a’s and b’s over
7. ∑ = {a,b}. C210.3 R
8. What is unambiguity? U
C210.3
9. Mention the application of CFG
C210.3 R
10. Define the instantaneous descriptions(ID) of pushdown Automaton C210.3 U
What are the diiferent types of language accepted by a PDA and define them?
11. C210.3 U

12. What is DPDA? Give Example C210.3 R

PART–B

1. Construct the PDA for the LanguageL={WCWR|W is in (0+1)*.

C210.3 Ap
n
2. Construct the PDA accepting the language { (ab) /n>0} by emptystack.
C210.3 Ap
2n n
Construct a transition table for PDA which accepts the language L={ (a b /n>0}
3. C210.3
Trace your PDA for the input with n=3. Ap

Construct PDA for the Language L={WWR|W is in (a+b)*}.

4. C210.3 Ap
 5. Discuss the equivalence between PDA and CFG U
C210.3
Construct a PDA for the language L={x€{a,b}*/na(x)>nb(x)}
6. C210.3 Ap
Convert PDA to CFG.PDA is given by P=({p,q},{0,1},
C210.3
7. {X,Z},δ,q,Z),δisdefinedby δ(p,1,Z)={(p,XZ)}, δ(p, ε,Z)={(p, ε)}, C
δ(p,1,X)={(p,XX)}, δ(q,1,X)={(q, ε,)}, δ(p,0,X)={(q,X)}, δ(q,0,Z)={(p,Z)}.
Explain acceptance by final state and acceptance by empty stack of a
8. Pushdown Automata. C210.3 U

UNIT IV - NORMAL FORMS AND TURING MACHINES

Normal forms for CFG – Simplification of CFG- Chomsky Normal Form (CNF) and 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).

PART-A
Learning
Q.No Questions CO’S
Level
1. Define CNF form.
C210.4 R
Eliminate the ε production from the CFG given below
C210.4
2. A-> 0 B 1 | 1 B 1 Ap
B-> 0 B | 1 B | ε

3. Define GNF Form. U

C210.4
Convert the following grammar into an equivalent one with no unit
C210.4
4. productions and no useless symbols SABA AaAA|aBC|bB Ap
B A|bB|Cb CCC|Cc

5. What are the three ways to simplify a context free grammar? U

C210.4
Construct CFG without ε production from : S →a | Ab | aBa , A →b | ε , B→b
6. C210.4 Ap
| A.

What do you mean by null production and unit production? Give an example.
7. C210.4 U

Convert the following grammar G in greibach normal form.SABb|a

8. C210.4 Ap
AaaA|B BbAb

9. State the two normal forms and give an example. U

C210.4
10. Define Instantaneous description of turing machine C210.4 R
11. What are the applications of Turing Machine? C210.4 R
12. Define the language of Turing machine C210.4 U
 13. What is a multitape turing machine? C210.4 R

PART –B

1. Discuss the closure properties of CFL.

C210.4 R

2. Show that language {0n1n2n/n>=1} is not CFL. C210.4 Ap

State the pumping lemma for CFL.Use pumping lemma to show that the
3. C210.4 Ap
language L={aibjck/i<j<k} is not a CFL.

4. State and explain the pumping Lemma for CFG C210.4 U

5. Explain pumping Lemma for CFL. C210.4 R

6. Design a TM that accepts the language of odd integers written in binary C210.4 Ap

7. Construct the Turing machine for the language L={0n1n|n >=1 } Ap

C210.4

8. Design TM which reverses the given string{abb}. C210.4 Ap

UNIT V UNDECIDABILITY
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.

PART-A
Q.N Learning
Questions CO’S
o Level
1. When we say a problem is decidable? Give an example of undecidable C210.5 R
problem.
2. What is recursively enumerable language? C210.5 R
3. Mention the difference between P and NP problems. C210.5 U
4. How to prove that the Post Correspondence problem is Undecidable. C210.5
R
5. Show that any PSPACE-hard language is also NP-hard. C210.5 R
6. Show that the collection of all Turing machines is countable. C210.5 R
7. Mention the difference between decidable and undecidable problems. C210.5 U
8. What is universal turing machine C210.5 U
9. Features of Universal TM C210.5 U
10. Give example for NP-complete problems. C210.5 U
11. When a language is said to be recursive? C210.5 U
12. Define modified posts correspondence problem. C210.5 R
13. State two languages, which are not recursively enumerable. C210.5 R
14. Define posts correspondence problem. C210.5 R
PART – B
Prove that‗ If L‘ is a recursive language, then L‘ is also a Recursive C210.5
1. Language‘ R

Prove that If a language L and L‘ are recursively enumerable(RE),then C210.5

2. L is Recursive‘. R

3. Discuss the difference between NP-complete and NP-hard problems. C210.5

R

4. Explain about―A language that is not Recursively Enumerable C210.5

U
Explain post correspondence problems and decidable and undecidable C210.5
5. problems with examples. U

Prove that for two recursive language L1 and L2 their union and intersection C210.5
6. is recursive. R

7. Explain tractable and intractable problem with suitable example. C210.5 R

C210.5
8. If L and its complement are recursively enumerable language, prove that L is U
recursive

Course Instructor HoD