Pz) Geran sigcenedt ater werngz feenuts,z rs Punyashlok Ahilyadevi Holkar University, Sc a= Online Examination 2020-21 B.Sc.(ECS) III Sem-V (w.e.f. June-2018) CBCS Subject: Theory of Computer Science Q.1.Which of the following regular expression identity is true? Mer) aul C. (rts) =r +s" Q.2.A Turing machine operates over. A. depends on algorithmB. finite memory tape &- infinite memory tape D. none of these Q.3.The value of nif Turing machine is defined using n-tuples. A.6) BB C.5\BT Q.4.Which of the following is a correct statement’? A. Mealy machine has accepting stat AB Moore machine has no accepting states. can convert mealy to moore but not vice versa, D. All of the above. 1,23} and B={1,2,3.4) then A is _ __ subset of B. B. Super C. Improper D. none of these oQ.6.Finite automata has A. finite memory Bread only memory ©. finite control I-A of these Q.7 Which of the following string is not generated by the following grammar” SeoSaSbS € Naabh 1h aba Coasbabh (D aabh QAWhich of the following language cannot defined by DEA but can be defined by PDA Aah’ D. (aeby aa (ashy CaP Dabs ba Q.9. The number of non-empty subsets of a subsets of {abcd} is AY a cS 0 16 Q10 _ iy a regular eypression and denotes the set [€} AO wy Vee D, None of these QUE TPL (y= f€. ab, aa, abybadbh, } then ee ArT by Bab Coash'D. None of these Q.12. The capital letters denotes symbal may be A Variable B. Terminal C.Roth Aand BD. None of these Q.13. Proper prefix of the string ‘abe* are A {€ Cte abe} 1 t€c.be } habe | LDT€.aab} Q.14. Turing machine (TM) is more powerful than FMS (Finite State Machine) because A. tape movement is confined to one direction B it has no finite state ‘Gathas the capability to remember D. none of these bitranly long sequences of input symbols ‘aOOVadns OSA Language is represented by rey sing docs not belong te the regular set rep Aaa Weataba © aaa aba expression a” (achay Which af the fattossing resented by the above exp QIOIEA iy the NA ate NS SEE AlL postive integers and 1 (the vet tall nepative Inteyers, thon AO Ae ce D. none of these Q17-18 PDA one situation has more thaw one transition then itis knows ns AIM WpPDa NCNPDA 1, stuck QURLIEA hay a ctements, the P(A) funy clements A yer cm bra QU19, Number of states required fo accept all the strings that endy Witte 1 iy yar We Gt D. None of these Q.20. "CLG" stands for A Context Pree Graph He Context Pree Grammar ©. Context Finite Graph. D. Contest inite Go nar, Q.21, The productions required to generate the language [= fa, aa, ana, is VACA [a WA-wA| € CA—aAB [a [€ D.A-alafa [€ . A finite automation with stack iy Mnowa ay APA nM DEA LDP Q.24. If rightmost and feflaeyt production by single non-te then ities known ay production A. cross unit ©. self D. Note of these ay (4QLALA push down auicunsta iv wale ba be 11 A hae ak MOK nag aaa adi all coatlgurations, A. Binley U Now regula © Nowdeiwomaitiy Be DNleaminints 25, The Grammar can De detlied an CQW. 1, PLSD tithe givga doliantigns what dea 8 repreventy? A Accepting State AB Starving Vacadio © Scasitive Cramimnae D. Nowe of thong .26.Pumping tema iy geowcally used Roe pron ing that A. given grammar is wgular < Be Biven granumar is noe regular Co whether 10 given regular expwersions ary equivalat oe nod DL None of these Q.27, Which of the following is lve or a grammar Cin Chomsky Noanat bev AN. G has no useless symbols B. Ghas no unit pertuctions ©. G has no epsilon prosbictious A PoNone of the mentioned Q2K Amar) al bh The numbse af steps to for ats Ao yh C4 bs Q.28. Which among the following is the ot of the pare tee” A. Production UW. Terminal 1 ©. Variable V VP. Starting Variable S Q.30. Let § and 1 be language over (a,b) tepresentesl by regular eXpression (a) NY and (a+ DY Respectively. Which of the following is true" A.Sissudsetofl WL is subset of § \oS1 DSho QAM. ATA with null sting accepting capability is Known av ANEA ABENEA with epsilon moves ©.DEA D. AlLofthese Q.32, A and Bare said tobe it they have vo common element A. Equal AB Disioint Co guivatent D. oveclapping ~ i"LCT etna cl antes fgeioa Bo CoE DIE for the langoage bo athe AX Ba ves de QL WD of De Hukning 1 tTbe A. ABNEA are DEA BAN DEA are NTA NR A a DINE A arnt DEA Ras ditferent power AS A Reaguage areeptad by Determinictic Pak dows anata ix choad amier wtiact oF Be RuAming? A. Comptcmont AB Unie © ROA) at ER) D. News of the mentioned QE Waed oF Be following automata BALES sack ay mvihiary sore? A Biemte aohvenaia \.B Dhak down automata © Tarng matans DAM of the menDENt QETLATE Panic waset of Sct bs hnowar as A SaSt Be finer ct Cee D. None of these QUSUEA and Bare So sets SiVER. te SON a Way at CAE TO RSD aad AUB TTC, MADRE a NO RW cw Ne QA poring machine WAN several tap in known a VAY Mentintape poring machine 1B. Podaps turing mashing C Uaiveral raring machine DAM ot the mentioned Q.40 The kegic of pumpang femma a goad example of LA pigerestote primcipie 0. diunknend-vonquer tectinnges ‘Ciecanton D aeration QT Toning machene wan invcoted By a A Alan Tanne Bh Taree man C Tunng tanng DD. Nawe of hoe cxQ42te GNF grammar ts required in the form of A A=BC Ia LB Asan © Both a and b D. None of these Q43 the language | WW" } is A. Accepted by a DPDA not by NPDA \ Be Accepted by a NPDA not by PDA €. Cannot say D. None of these QHNPDA is more powerful than DPDA Va Tre B. False QA The language accepted by finite automata ix A. Contest five B. non-regular LC regular D. none of these Q46.Most compley computing problems can he address through APDA IM C. Pumping lemma D, NEA Q47. The number of all possible subsets of a set contining n clement is An Bin Cn! vor QASIPA={8: vis. multiple of 4} and N= {y: v is a multiple of 6} then ANB consists of all Multiples of AQ B2 \car Da Q.49.Given the Isnguage I.=fab.aa,baa}, which of the following string are in 1 1) absabasabaa 2) anaahaaaa 3) baaagahaaaab 4) baaaaabaa Al2and3 \BHATand 4 CLs and 4 DAS and 4 Q.50.The context free grammar given by SXYX XaX [bX | € Y->bbh generates the language which iy defined by repular expression. AL(a) by bh H. abbb (a + by” Lata! by (bbb) (3 + by” D. (a = 6) (bbb) (a by” u eee ee