Theory of Computation Question Paper 2015 - Tutorialsduniya

Visit https://www.tutorialsduniya.com for Notes, books, programs, question papers with solutions etc.
This question paper contains 4+2 printed pages]
Roll No. I. I I I I I I I I I I I
S. No. ofQuestionPaper 6075
Unique Paper Code 234501 D
m
Name of the Paper Theory of Computation (CSHT-511)
co
Name of the Course : B.Sc. (Hons.) Computer Science
Semester :V
a.
Duration : 3· Hours Maximum Marks : 75
iy
(Write your Roll No. on the top immediately on receipt of this question paper.)
un
Question No. 1 (Section A) is compulsory.
sD
Attempt any four questions from Section B.
Parts of a question should be attempted together.

al
Assume L = {a, b} for all the questions unless specified otherwise.

ri
to
Section A
1. (a) Is for all sets (S+) * = (S*)+ ? 2

Tu
(b) Generate a CFG for a* b*. 2
(c) . Give Regular expression for all words that do not end in a double letter. 2
P.T.O.
For any query, contact us at help@tutorialsduniya.com
( 2 ) 6075
(d) Defme Deterministic Finite Automata 2
(e) Design a Deterministic Finite Automata for all strings that either starts with ab or ends
with ba. 3
m
(j) Give the full details of the following Turing Machines : 3
co
>L Land > L u
R
a.
. (g) Convert the following Transition graph into Regular Expression. 4
iy
un
a lsD
ri
(h) Convert the following CFG into CNF : 4

to
Tu
S --7 bAiaB ·
A --7 bAA I aS Ia
B --7 aBBibSib
\
( 3 ) 6075
(i) Show that the language L = {an b an+l where n = 1 2 3 .... } is non-regular. 4
(j) Construct a DFA for the language where every 00 is followed by 1 over alphabet
set {0, 1}. 4
m
(k) Construct PDA :
co
L = {an bn cn+m : n > = 0, m. > = 0} · . 5
a.
Section B
2. (a)
iyFind the Union Machine for the given FA 1 and FA2 . 5

un
sD
al
ri
to
Tu
P.T.O.
( 4 ) 6075
(b) Convert the given NFA into DFA. 5
om
.. ·... ~ :· ·.,.·
~~-.. ,; ::,.:
·~ .:.__.:··.>~+·
c
a.
iy
un
3. (a) Build a DFA and give Regular Expression that define L 1 nL2 where :
L 1 : (a+b) b (a+b)*
lsD
L 2 : b (a+ b)*. 6
a
(b) Show that the language :

ri
to
Tu
is non Context Free. 4
4. (a) Show the Complement of the Context Free Language may or may not be Context
Free. 5
(
( 5 )
6075
(b) Show that the CFG is ambiguous :
S -7 XaX
om
X -7 aXIbXI". <;
5. ({1) Explain the Concept of Random Access Turing Machine. }
.c
(b) Explain Halting Problem._
2
a
(c)
iy
Give PDA for the language : un
L ={an b2n where n = 1 2 3 .... }. 6
6. (a) Show that if Lis recursive, then L is also recursively enumerable.

lsD
(b) Design a Turing Machine which gives two's complement of a given input in binruy fl,nr
a
on the input tape. -

6
ri
7. (a) Describethe Language for the following R~gular Expressions :

3
to
(i) (a+b)*ab(a+b)*
Tu
(ii) (a(a + bb)*) *
(b) Build a DFA that accepts all words with exactly four letters.
3
P.T.O.
l~-----~--~~------------------
j
I
( 6 ) 6075
(c) Trace the following PDA for the given string sequence aaaabb. 4
m
co
a.
iy
un
lsD
r ia
to
Tu
1200
l
TUTORIALSDUNIYA.COM
Get FREE Compiled Books, Notes, Programs, Question Papers with Solution
etc of the following subjects at https://www.tutorialsduniya.com
 C and C++  Computer System Architecture

 Java  Discrete Structures
 Data Structures  Operating Systems
 Computer Networks  Algorithms
 Android Programming  DataBase Management Systems
 PHP Programming  Software Engineering
 JavaScript  Theory of Computation
 Java Server Pages  Operational Research
 Python  System Programming
 Microprocessor  Data Mining
 Artificial Intelligence  Computer Graphics
 Machine Learning  Data Science
 DU Programs: https://www.tutorialsduniya.com/programs
 TutorialsDuniya App: http://bit.ly/TutorialsDuniyaApp
 C++ Tutorial: https://www.tutorialsduniya.com/cplusplus
 Java Tutorial: https://www.tutorialsduniya.com/java
 JavaScript Tutorial: https://www.tutorialsduniya.com/javascript
 Python Tutorial: https://www.tutorialsduniya.com/python
 Kotlin Tutorial: https://www.tutorialsduniya.com/kotlin
 JSP Tutorial: https://www.tutorialsduniya.com/jsp

Theory of Computation Question Paper 2015 - Tutorialsduniya

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Theory of Computation Question Paper 2015 - Tutorialsduniya

Uploaded by

Copyright:

Available Formats

Visit https://www.tutorialsduniya.com for Notes, books, programs, question papers with solutions etc.

This question paper contains 4+2 printed pages]

Unique Paper Code 234501 D

Attempt any four questions from Section B.

Parts of a question should be attempted together.

Assume L = {a, b} for all the questions unless specified otherwise.

1. (a) Is for all sets (S+) * = (S*)+ ? 2

(b) Generate a CFG for a* b*. 2

(d) Defme Deterministic Finite Automata 2

(h) Convert the following CFG into CNF : 4

iyFind the Union Machine for the given FA 1 and FA2 . 5

(b) Convert the given NFA into DFA. 5

(b) Show that the language :

is non Context Free. 4

(b) Show that the CFG is ambiguous :

5. ({1) Explain the Concept of Random Access Turing Machine. }

6. (a) Show that if Lis recursive, then L is also recursively enumerable.

on the input tape. -

7. (a) Describethe Language for the following R~gular Expressions :

(ii) (a(a + bb))

 C and C++  Computer System Architecture

You might also like