Scribd
Upload
71 views

TOC (7th&8th) May2018

This document contains instructions and questions for a theory of computation exam. It has three sections - Section A with 10 short 2-mark questions, Section B with 5 long 5-mark questions where students must attempt 4, and Section C with 3 long 10-mark questions where students must attempt 2. The questions cover topics like finite automata, grammars, pumping lemma, Turing machines, pushdown automata and more. Students are asked to construct various automata and grammars, reduce grammars to Chomsky normal form, determine ambiguity and more.

Uploaded by

dheena thayalan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
71 views

TOC (7th&8th) May2018

This document contains instructions and questions for a theory of computation exam. It has three sections - Section A with 10 short 2-mark questions, Section B with 5 long 5-mark questions where students must attempt 4, and Section C with 3 long 10-mark questions where students must attempt 2. The questions cover topics like finite automata, grammars, pumping lemma, Turing machines, pushdown automata and more. Students are asked to construct various automata and grammars, reduce grammars to Chomsky normal form, determine ambiguity and more.

Uploaded by

dheena thayalan
Copyright
© © All Rights Reserved
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) (2011 Onwards) (Sem. – 7, 8)


THEORY OF COMPUTATION
M Code: 71894
Subject Code: BTCS-702
Paper ID: [A2986]
Time: 3 Hrs. Max. Marks: 60

INSTRUCTIONS TO CANDIDATES:
1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to
attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students have
to attempt any TWO questions.

SECTION A
o m
1. a) Define Finite Automata.
.r c m
b) Define Transition Graphs.

p e o
.r c
c) Describe the following set by Regular Expression {1, 11, 111, 1111...).

a
d) What is the significance of Pumping Lemma?

p
b
f) Define a Grammar. r
e) Differentiate between NDFA and DFA.

p e
g) Give two properties of LR(k) grammars.
a
h) Define Recursively Enumerable Languages.

b rp
i) Compare the computational powers of Pushdown Automata and Turing Machines.
j) What are normal forms of CFG?

M-71894 Page 1 of 2
SECTION B
2. Construct a nondeterministic finite automata accepting the set of all strings over {a,b}
ending in aba, and use it to find a deterministic automaton accepting the same set.
3. Construct a Turing Machine that can accept the set of all even palindromes over {0,1}.
4. Reduce the given grammar into Chomsky Normal Form.

S  abSb | a | aAb, A bS | aAAb


5. Verify whether that the following context free grammar is ambiguous or not:

S  1A0S

S  1A0S1S

A1

S0

b’s.

o m
6. Construct a grammar G accepting the set L of all the strings over {a, b} having more a’s than

.r c
SECTION C

m
7. Consider the regular expression R

p e o
.r c
(a+b)*(aa+bb)(a+b)*

p a
Which describes the set of all the words over = {a, b}, containing either two consecutive
a’s or two b’s. Construct a Deterministic Finite Automata A that will accept the same set of

8.
words.

b r p e
Give an example of a language which is accepted by the PDA but not by DPDA. Also
design the PDA for that language.
a
9. Write short notes on the following:
a) Decidability
b) Halting Problem b rp

M-71894 Page 2 of 2

You might also like