Scribd
Upload
68 views

Model Question Paper

1. The document provides a model question paper for an MCA course with questions ranging from designing finite automata and pushdown automata to solving problems using Turing machines. 2. It contains 10 questions divided across 5 units testing different concepts like regular expressions, context-free grammars, Turing machines and decidability. 3. The questions involve tasks like designing automata and grammars to recognize specific languages, simplifying grammars, constructing Turing machines to solve problems and analyzing decidability of problems related to grammars.

Uploaded by

Naveen Chaubey
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
68 views

Model Question Paper

1. The document provides a model question paper for an MCA course with questions ranging from designing finite automata and pushdown automata to solving problems using Turing machines. 2. It contains 10 questions divided across 5 units testing different concepts like regular expressions, context-free grammars, Turing machines and decidability. 3. The questions involve tasks like designing automata and grammars to recognize specific languages, simplifying grammars, constructing Turing machines to solve problems and analyzing decidability of problems related to grammars.

Uploaded by

Naveen Chaubey
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Reg. No.

:
Name :
Model Question Paper
Programme : MCA Semester : Winter2014
Course : TH!R" !# C!MP$TAT%!N Code : %TA414
Faculty : Pro&. $.'rini(asa Rao ) PR!#.N%'HA * M Slot :
Time : T+ree Hours Max. Marks : 100
AN'WR A,, Q$'T%!N'
Q.No.
Sub.
Sec.
Question Description Marks
Unit
No.
Level Hot?
1. (a) Govt. of Tamilnadu is planning to take the statistics of the names of the people which
contains only a and b. In such scenario, the Govt. wants to know in how many names the
number of a!s and number of b!s are even in length. "esign a "#$ to recogni%e those
names.
[5] 2 D Y
(b)
&onstruct a 'ondeterministic finite automation for the given 'ondeterministic
machine with (psilon transition


)tates
Input
(psilon
Input * Input 1 Input
+
)*
)1,)+ )* ,,, ,,,
)1 )- ,,,,, )+ ,,,
)+ ,,,, ,,, )- ,,,
*)- ---- ----- ----- )-
[10] 2 E N
+
&onstruct an '#$ with (psilon for the following regular e.pressions
(a) a(a/b)0abb
(b)b0a0(a/b)aa
[10] 2 E Y
-
"esign a push down automata for the set of balanced strings which you can
generate from the given grammar
)))12)314)516
[5] 3 E Y
7 (a)
(nglish language contains a word madam!. "esign a grammar for that and check
whether this word is contained in the set of palindrome or not.
[10] 3 D Y
(b)
)implify the Grammar ( (liminate null production, unit production and useless
symbols)
)a)!8 a&" 8a(
)!b&8 6
&a)!8 b
" (
(f
[10] 3 D N
9 (a)
"esign a Turing machine which will accept two numbers and produce the product
of those two numbers
[10] 4 D N
Page 1 of 2
(b)
#or a set of given names, which are formed by c! andd!. &heck whether the
number of c!s and number ofd!s are same or not. "esign a Turing machine to
recogni%e such set of names
[10] 4 D Y
:
Given a Turing machine ;<( ),=,>,?, )
*,
@,$) with )< 4 )
*,
)
1,
)
+,
)
-
5, =< 4*,15,
><4 *,1,@5 and $<4 )
-
5. The transitions are defined as ?()
*,
* )< ()
1,
*,A) , ?()
1,
1

)
<()
+
,1,A),
?()
+,
*

)<( )
+,
*

,A), ?()
+,
1 )< ()
-,
1,A). #ind the language which is accepted by the
Turing ;achine.
[5] 4 D Y
B
Two decision problems are given below which involves unrestricted grammars.
&heck whether the grammars are solvable or notC
(a) Given a grammar G and a string w, does G generate wC
(b) Given a grammar G1 and G+, do they generate the same languageC
[10] 5 C Y
D
#ind a decision problem and Eustify your answer
[10] 5 D Y
F
Is it possible to reduce one decision problem to anotherC Gustify your answer
[5] 5 C Y
Page 2 of 2

You might also like