22705 22705 22705 22705 22705 22705 22705 22705 22705

22705 Roll No.

22705 22705 22705 22705 22705 Total22705
No. of Pages
22705 : 02 22705

Total No. of Questions : 18

B.Tech.(CSE) (2011 Onwards) (Sem.–7,8)
22705 22705 22705 THEORY
22705 OF COMPUTATION
22705 22705 22705 22705 22705

Subject Code : BTCS-702

Paper ID : [A2986]
22705 Time : 3 Hrs.
22705 22705 22705 22705 22705 Max. Marks
22705 22705 : 60 22705

INSTRUCTION TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
22705 22705
each. 22705 22705 22705 22705 22705 22705 22705

2. SECTION-B contains FIVE questions carrying FIVE marks each and students
have to attempt ANY FOUR questions.
3. SECTION-C contains T HREE questions carrying T EN marks each and students
22705 22705 have to22705
attempt ANY22705 22705
T WO questions. 22705 22705 22705 22705

SECTION-A
22705 22705 22705

Answer briefly :
22705 22705

o m 22705 22705 22705 22705

22705 1.
22705 Differentiate
22705 between22705 .r c
NFA and DFA.
22705 22705 22705 22705 22705

2.
p e
State Pumping Lemma for Context Free Languages.
m
pa o
.r c
22705 22705 22705 22705 22705 22705 22705 22705 22705
3. What is Chomsky Classification of formal languages?

22705
4.
22705 22705
br
Differentiate between Moore and Mealy Machine.
22705 22705

p e
22705 22705 22705 22705

5.
a
What is the difference between acceptance of string in PDA with null stack or with final
state?
p
22705 22705
6.
22705 22705
Explain briefly Lex and Yacc.
22705

br 22705 22705 22705 22705

7. Explain the concept of Unit Production.

22705 22705 22705 22705 22705 22705 22705 22705 22705

8. Explain the acceptance of the string over NFA and DFA over the same alphabet.

22705 9.
22705 Define 22705
terminal and non-terminal
22705 symbol.
22705 22705 22705 22705 22705

10. Define leftmost and rightmost derivation.

22705 22705 22705 22705 22705 22705 22705 22705 22705

22705 1 | M-71894
22705 22705 22705 22705 22705 22705 (S2)-165
22705 22705

22705 22705 22705 22705 22705 22705 22705 22705 22705

22705 22705 22705 22705 22705 22705 22705 22705 22705

SECTION-B
22705 22705 22705 22705 22705 22705 22705 22705 22705

11. Explain in brief the properties of LL (k) grammars.

22705 12.
22705 Explain22705
in brief various
22705 types of languages.
22705 Also name the automata
22705 22705 accepting
22705 those 22705
languages.

13. Find the grammar generating L = {an|bnci |n>l, i>0}.

22705 22705 22705 22705 22705 22705 22705 22705 22705

14. Design a Turing Machine which recognizes the set of all even length palindromes over
{0,1}.
22705 22705 22705 22705 22705 22705 22705 22705 22705
15. Consider the following productions.

SaB|bA A  aS|bAA|a B  bS|aBB|b

22705 22705 22705 22705 22705 22705 22705 22705 22705

For the string aaabbabbba, find the

22705 22705 a) Leftmost

22705 derivation
22705 22705

o m 22705 22705 22705 22705

.r c
b) Rightmost derivation
22705 22705 22705 22705 22705 22705 22705 22705 22705
c) Parse Tree

p e m
pa o
.r c
22705 22705 22705 22705 22705 22705 22705 22705 22705

br
SECTION-C

22705
16.
22705
Write short
22705
notes on :22705 22705

p
22705e 22705 22705 22705

(a) Griebach Normal Form.

p a
22705 22705 (b) Push Down Automata.
22705 22705 22705

br 22705 22705 22705 22705

(c) Cellular Automata

22705 22705 22705 22705 22705 22705 22705 22705 22705
17. Describe “equivalent states” in finite state automaton and prove that the relation
“equivalent” among states is an ‘equivalence’ relation. How this equivalence relation can
be used to minimize the number of states in FA?
22705 22705 22705 22705 22705 22705 22705 22705 22705

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

22705 22705 22705 22705 22705 22705 22705 22705 22705

22705 2 | M-71894
22705 22705 22705 22705 22705 22705 (S2)-165
22705 22705

22705 22705 22705 22705 22705 22705 22705 22705 22705