https://www.rgpvonline.

com

Total No. of Questions : 8] [1] [Total No. of Printed Pages : 4

Roll No ..................................
IT-503(A)-CBGS
B.Tech., V Semester
Examination, June 2020
Choice Based Grading System (CBGS)
Theory of Computation
Time : Three Hours
Maximum Marks : 70
Note: i) Attempt any five questions.
{H$Ýht nm±M àíZm| H$mo hb H$s{OE&
ii) All questions carry equal marks.
g^r àíZm| Ho$ g_mZ A§H$ h¢&
iii) All parts of each question to be attempted at one place.
àíZm| Ho$ g^r ^mJm| Ho$ EH$ hr ñWmZ na {b{IE&
iv) In case of any doubt or dispute the English version
question should be treated as final.
{H$gr ^r àH$ma Ho$ g§Xoh AWdm {ddmX H$s pñW{V ‘| A§J«oOr ^mfm
Ho$ àíZ H$mo A§{V‘ ‘mZm Om¶oJm&

1. a) Find the grammar generating : L = {an | bn ci | n > 1, i > 0}

7
J«m‘a OZaoqQ>J H$m nVm bJmBE: L = {an | bnci | n > 1, i > 0}
b) Design a PDA which recognizes the set of all even length
palindromes over {a, b}. 7
EH$ PDA {S>μOmBZ H$a| Omo {a, b} go A{YH$ g^r b§~mB© Ho$
palindromes Ho$ goQ> H$mo nhMmZ|&
IT-503(A)-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[2]

2. a) What do you mean by Parsing? How left most and right most
derivation helps to find out the ambiguity in a grammar? 7
nmaqgJ go Amn ³¶m g‘PVo h¡? H¡$go ~mE± ‘moñQ> Am¡a XmE± ‘moñQ>
S>o[adoeZ AñnîQ>Vm H$mo nVm H$aZo ‘| ‘XX H$aVm h¡?
b) Explain pumping lemma for context free languages with
the help of example. 7
CXmhaU H$s ‘XX go context free languages Ho$ {bE pumping
lemma H$s ì¶m»¶m H$s{OE&

3. a) Design Turing Machine of {0 n 1 n | n > = 1} 7

Q>çy[a¨J ‘erZ {S>OmBZ H$a| {0 n 1 n | n > = 1}
b) Give an example of a language which is accepted by the
PDA but not by DPDA. Also design the PDA for that
language. 7
EH$ Eogr ^mfm H$m CXmhaU X| {Ogo PDA Ûmam ñdrH$ma {H$¶m OmVm
h¡ bo{H$Z DPDA Ûmam Zht& Cg ^mfm Ho$ {bE PDA {S>OmBZ H$a|&
4. a) What are Turing machines? Explain different ways by which
we can represent the Turing machines. 7
Q>çy[a§J ‘erZ ³¶m h¡? {d{^Þ VarHo$ ~VmBE {Oggo h‘| Q>çy[a¨J
‘erZm| H$m à{V{Z{YËd H$a gHo$&
b) Prove that there exists a DFA for every NFA which accept
the same language. 7
{gÕ H$a| {H$ ha NFA Ho$ {bE EH$ DFA ‘m¡OyX h¡ Omo g‘mZ ^mfm
H$mo ñdrH$ma H$aVm h¡&
5. a) What is a Pushdown Automata? Discuss two types of
acceptance of sets by pushdown automata. 7
nweS>mCZ Am°Q>mo‘oQ>m ³¶m h¡? nweS>mCZ Am°Q>mo‘oQ>m Ho$ Ûmam Xmo àH$ma
Ho$ ‘mݶ goQ>m| H$s ì¶m»¶m H$s{OE&
IT-503(A)-CBGS Contd...
PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[3]

b) Show that halting problem of a hiring machine is

undecidable. 7
àX{e©V H$[aE {H$ EH$ H$m‘ na aIZo H$s ‘erZ H$s g‘ñ¶m H$mo hb
H$aZm Ag§^d h¡&
6. a) Design a turing machine which computes the
multiplication of two numbers. 7
EH$ Q>çy[a§J ‘erZ H$m {S>μOmBZ H$a| Omo Xmo g§»¶mAm| H$mo JwUZ H$a|&
b) Describe the working of Linear bound automata with the
help of example. 7
CXmhaU H$s ‘XX go Linear bound automata Ho$ H$m‘ H$m dU©Z
H$s{OE&
7. a) Write regular expressions for the following languages of
all strings in {0, 1}* 7
{0, 1}* ‘| g^r strings H$s {ZåZ{b{IV ^mfmAm| Ho$ {bE regular
expressions {bI|&
i) Strings that contains odd number of 0’s.
ii) Strings that begin or end with 00 or 11.
b) Define Pumping Lemma for regular languages. Prove that
the language L = {an: n is a prime number} is not regular.
7
{Z¶{‘V ^mfmAm| Ho$ {bE npån§J boå‘m H$mo n[a^m{fV H$a|& {gÕ H$a|
{H$ ^mfm L = {an: n is a prime number} {Z¶{‘V Zht h¡&
8. Explain the following terms with example. 14
a) Universal Turing Machine
b) NFA
c) Recursively enumerable language
d) Cellular Automata

IT-503(A)-CBGS PTO

https://www.rgpvonline.com
 https://www.rgpvonline.com

[4]

{ZåZ{b{IV Q>‘© H$s CXmhaU Ho$ gmW ì¶m»¶m H$a|&

A) ¶y{Zdg©b Q>çy[a§J ‘erZ
~) NFA
g) nwZamdVu ^mfm
X) gobbw a Am°Q>m‘o Qo >m

******

IT-503(A)-CBGS PTO

https://www.rgpvonline.com