Roll

Date
No.

CGC COLLEGE OF ENGINEERING

B.TECH (CSESem.–5th)
2nd Sessional
Subject: Formal Language & Automata Theory
Subject Code: (BTCS-502-18)
Time: 1.0 Hr. Max. Marks: 24
INSTRUCTIONS TO CANDIDATES:
1. SECTION-A is COMPULSORY.
2. ATTEMPT ANY TWO QUESTIONS FROM SECTION - B AND ONE QUESTION FROM SECTION – C.
Course Objectives
CO1: Write a formal notation for strings, languages and machines.
CO2: Design finite automata to accept a set of strings of a language.
CO3: Design context free grammars to generate strings of context free language.
CO4: Determine equivalence of languages accepted by Push Down Automata and languages generated by
context free grammars.
CO5:
Distinguish between computability and non-computability and Decidability& un-decidability.

Section – A (2×4 = 8)

What is the difference between acceptance of string in PDA with null stack or with
1. CO3
final state? 2
2. CO1
What is context Sensitive grammar. 2
3 Compare the computational powers of Pushdown Automata and Turing Machines. 2 CO3

4. Give instantaneous description of turing machine. 2 CO1

Section – B (2×4 = 8)
5
Explain NDPDA and DPDA with the help of example. 2+2=4 CO4
.
6
Explain the closure properties of Context free grammars. 1+1+1+1=4 CO3
.
7
Explain pumping lemma for Context free languages with the help of example. 4 CO3
.
Section – C (1×8 = 8)

8. Design a PDA which recognizes the set of all even length palindromes over {a,b}. 8 CO4

What are Turing machines? Explain different ways by which we can represent the
9. 4+4=8
Turing machines. CO5