2 z 3 5 woo auyuoAds ssa wwwergpvonline.com ‘Total No.of Questions: 5] [Total No, of Printed Pages :3 Roll No. CS-505, BLE, V Semester Examination, June 2016 ‘Theory of Computation ‘Time : Three Hours Maximum Marks: 70 Hote: i) Answer five questions. Ineach question part A,B, Cis ‘compulsory and D paras internal choice. i)_Allpans ofeach question are tobe attempied at one pce. i) Allquesions cary equal marks cut of which pt AandB. (vax. 50 words) cary 2 marks, part (Max. 100 words) ‘cerry 3 marks, past D (Max. 400 words) cary’ 7 rarks. 4). Exceptnumericals, Derivation, Design and Drawingete juoadiarssust wio9'ay! Unit-1 4) Design DPA that accepts all strings with at most 32's, by DesignaNFA for {cbab"/n >= 0} €) Construct Moore machine for the following Mealy machine wos suyjuordi.rauain— 44) Weiteand explain Myhill-Nerode theorem. cs-s0s i ro www.rgpvonline.com woxsuquoadirnan i 2moa‘ suyjuoadaarausist mop auyUOAdSsrAAM 5-505, ‘Construct NFA forthe follosving grammar S—> Ab | ab, A> Ab | Bb,B > Bala Unit-11 . 8) Give CFG for RE (O11+)*(01)* 1) Explain GNF conversion steps, ©) Explain ambiguous grammar problem, ©) Conver following CRG to CNF S—> ASB/E A> aASfa Bo SdS/Afbb oR ‘Convert the following grammar into GNF S-+Xa/BB B->9/SB xb Ava Unit 9) Feplain PDA, b)__Explainhow many way's PDA can accept (final ost ull store). ©) Explein pumping lemma for CFL, ona www.rgpvonline.com (ond Barsanas 3 3 ‘woo -suyuo ada 5. al 4) Design push down automate which accepts L={07/nzi} oR Designs push down onatich aoe etofbalned parentheses. ({( }}) Unit-1V 9) Explain ofa turing machine. b) Explain Multi Tape and Universal Turning machine, ©) Explain church hypothesis 6, Design turing machin to add two numbers aandb. oR Desiga turing machine for accepting stings ofthe language defined {car /ore(0+1)+}. vait-¥ 8) Explain P and NP problems. 1) Difference between NP complete w NP hard problem. ©) Explain process of Reducibilty. 4) Describe Hamiltonian path problems oR Describe vertex caver problem. s-505 www.rgpvonline.com Hod SrMA