Scribd
Upload
19 views

Tcs Dec 2021

paper

Uploaded by

Kapil bhatia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
19 views

Tcs Dec 2021

paper

Uploaded by

Kapil bhatia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
eoting and Information T University of Muntoar FAN Ka Somaiya Institute of statute Anat Question Paper Pattern(For Online Examination Max. Marks:60) J. Somalya Tnstitute of Engineering and Information Technology; Sion, Mumbai- 23{ Autonomous College Affiliated to University of Mumbai) End Semester E) 21 B.Tech-Program Examination: TY Semester V j Course Code: IUCECSOL and Course Name: Theoretical Computer Science e Duration:03Hours Max.Marks:60 Instructions: ~ (UAL questions are compulsory. @)Draw neat diagrams wherever applicable Assume suitable data, if necessary. Qo. Question Max.MarCO. BTLevel ks Solve any six questions out of eight: 12 What is deductive prook, z Cor U EXpiain regular expression with an example, z Coz U When we saya problem is decidable? Give an example of 2 co6 undecidable problem? What are the applications of pumping lemma, z Cos u [Explain CFL with an example 2 | eos v [Define Deterministic PDA, What are the components oF z PDA? x pte is the language accepted by TM? Write down the z COs pplication of TM? ive the applications of finite state automata, z Cor u Solve any four questions out of six. 16 tate that whether a following Language is Regular ornow | a con Apel | L = {WW*| [\W=2 over S=fa,b}} . 2 th i | | Ne q Cr Ap | | OO | | mre the following NFA with ¢ moves to DFA without e| ves. tip gn a mulli head Turing Machine for checking whether 14 cos Ap inary string is a palindrome or not. Show the ID for 1001 K J Somaiya Institute of En An clutonomons lostvue sfitated to University of Mumba ing and Information Technology in We Construct a pda A accepting L by empty store, ic. L=N(A)| Define Pumping Lemma for Regular Languages. Prove that th C03 AD language L= fan: n isa prime number} is not regular Construct PDA to accept all strings of O's and I's such thal Cos Ap umber of 1's is less than number of 0's by final state method. at is the language accepted by the following finite automata Cor ‘An 8 Or Solve any two questions out of three. (Design finite state machine to add 2 binary numbers of equal CO Ap length. fonstruct the PDA accepting the language Cos ‘Ap [L={ab* jn>=1) illustrate the Turing machine for computing COs Ap {m, n)=m-n ( proper subtraction), Solve any two questions out of three, [Cossinuct PDA from the Tellowing Grammar Coa Ap B > bAb A > aB [Design regular grammars for the following languages, os Ap ) Strings of a's and b's having strings without ending wit b. i) Strings of 0's and 1's with three consecutive 0's, i) ee Proof for the statement: if L is a context free language, ther C06 An cones

You might also like