Scribd
Upload
11 views2 pages

TOC (7th&8th) Dec2014

Uploaded by

SUDIP HOWLADER
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

TOC (7th&8th) Dec2014

Uploaded by

SUDIP HOWLADER
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Roll No. Total No.

of Pages: 02
Total No. of Questions: 09
B. Tech. (CSE) (Sem.-7th)
THEORY OF COMPUTATION
Subject Code: BTCS-702
Paper ID: [A2986]
Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATES:
1. Section –A, is Compulsory.
2. Attempt any four questions from Section-B.
3. Attempt any two questions from Section-C.

Section –A
(10x2=20)
Q.1. Write briefly:

(a) What is a string?


o m
.r c
(b) What is the criteria for acceptability of a string by a finite automaton?

p e
(c) Define a phrase structure grammar.

(d) What are recursively enumerable sets?

p a
(e) Define terminal and non-terminal symbol.

r
(f) What is a transition graph?

b o m
w . (g) What is a derivation tree?

(h) Define leftmost and rightmost derivation. .r c


w (i) State pumping lemma for regular sets.

p e
w (j) What is Chomsky Normal Form?
a
r p
Section –B
.b
Q.2. What is Post correspondence Problem?
w w (4x5=20)

w
Q.3. State the properties of regular languages.

Page: 1
M-71894
Q.4. If G is grammar SSbS|a, show G is ambiguous.

Q.5. Give regular expression to each of subsets of {a,b}

(a) Set of all strings containing exactly 2a’s

(b) Set of all strings containing substring aa.

Q.6. Discuss the relation between languages and types of automata with help of diagram.

Section –C
(2x10=20)

Q.7. Show the equivalence of DFA and NDFA.

Q.8. What is a pushdown automata? Discuss two types of acceptance of sets by pushdown
automata.

Q.9. Write short notes on


o m
(a) LR(k) grammars
.r c
(b) Turing Machines.

p e
p a -----END-----

b r o m
w . .r c
w p e
w a
r p
.b
w w
w Page: 2
M-71894

You might also like