C369 Soules USN | | | | 15CS54 Fifth Semester B.E. Degree Examinati .2018/Jan.2019 Automata Theory and Computability Are Time: 3 hrs. a Max. Marks: 80 Note: Answer any FIVE full questions, choo8ing ONE full question from each module. NY AY j & £1 a. Define the following with example “>” sid z i) String ii) Language Alphabet iv) DRSM. (08 Marks) a b. Design a DFSM to accept e: following languages. i ) L={We (0,1): W 1 as a substring} * i) L={We {a,b}": ‘even number of a’s andyeven number of b's}. (08 Marks) aw a : - or Y 3 % 2 a Define NDFSM. Convert the following NDESM to its equivalent DESM. (08 Marks) ae Ns) SS ' Ee AD 2a b. MinimgSope (08 Marks) 5s 3 a. Defi lar expression Regular expéession for the following language. i) LSfar" be | n> 2. Any revealing of identification, appeal to evaluator and for eg 3 F 5 g 0, (08 Marks) 5 i) ab" | m2 1 nm 2 3}. i b. Obtain the Regular expgesion for the fo FSM. (08 Marks) Pee 5 é a OR 2 4 a, Define a Regular grammét~Design regular grammars for the following languages. z i) Strings of a’s and bs With at least one a. i ii) Strings of a’s and’b’s having strings without ending with ab. & iii) Strings of 0:s’and 1's with three consecutive 0°s. (08 Marks) ' b, State and prove pumping theorem for regular languages. (08 Marks) 1of215CS54 Module-3 © 2 ‘a, Define context free grammar. Design a context free @fanimar for the languages. (08 Marks) i) L={0"1™2"|m>0 , n>0} ii) i |i#]}, 120,520} iii) fa" b™? | n> 3}. Consider the grammar G witiprodudtion. _ OY S—> ADB & A> adle EWIT-LIB Y ~~ (08 Marks) B—aB| Ble vy Obtain leftmost derivation , right srivation and parse tree fot the string aaabab. SS OR & a. Define a PDA. Obtain a PDA Yo-accept L= fa" b| W € {a, b} ty, Draw the transition diagram. (08 Marks) b. Convert the followi into equivalent P) S— aABC ? A> aBla S ¢ (08 Marks) B= balb Coa » a lang how that (10 Marks) ¢"| n> 0} is not contexr: g b. Explain Turing machine modek “ (06 Marks) aE OT Fs ss oR. a. Designa Turing mci accept the wr {0"1"2"| a (08 Marks) b. Design a Turing zaclio to accept strins 's and b’s ending with ab or ba, (08 Marks) ~ = Moutnte-s & a. Explain the following : "y , i)_Nondeierministic Turing aghine iD Muifetape Turing machine. (06 Marks) b. Deine lowing : > i) Re erie nul ge i) oe e language. (06 Marks) c. Wat is Post cores obi s (04 Marks) &. ‘What is Halting a of Turing aa, (06 Marks) Define the f i) Quantyrmcomputer : (06 Marks) c. Explain CI ‘Turing Thesis. <> > (04 Marks) s a & eeeee s 2of2CEC SISCH ENE USN | ole 1SCS54 | Fifth Semester B.E. Degree Examination, Dec.2019/Jan.2020 Automata Theory and Computability Time: 3 hrs. Max. Marks: 80 Note: Answer any FIVE full questions, choosing ONE full question from each module. 0 | a. Briefly describe the applications.of Theory of computation, (04 Marks) b. Define DFSM. Build DFSM forthe following languages. ) L= bw {a,b}" : every ain w is immediately followed by b} 4) L= tw « {a, b}” pw dogs not contain substring’aab}. (08 Marks) © Describe Machine based hierarchy of language clisses. (04 Marks) ox» [EWIT-LIBRARY | 2 a. For the following NDFSM, use ndfsmtodfsm to ‘SM. Begin by showing the value of eps (q) for each state q (08 Marks) (08 Marks) Medule-2 3° 4 Define Regular Expression. Write regular expression for the following = )) L= {we {a, b}” :w does not end inba} ii) L = {w e{0—9}" : w corresponds to the decimal encoding, without leading 0°s , of an odd natural umber} (06 Marks) 5. Consider the FSM M. Use’the fimtoregexheuristic algorithm to construct ‘¢ regular expression that describes L(M). (05 Marks) — 6 \y* lof210 15CS54 © Consider the FSM M. Use famtoregex algorithm to, construct a regular expression that describes L(M). (05 Marks) OR a. Show that regular languages are closedunder complement and set difference, (06 Marks) b. State and prove pumping lemma theorem for regular languages, And show that the language L= {a"b" : n= 0} is not regular, (10 Marks) Module. a. Define CFG, Design CFG for the languages i) L= fa'b| 2i= 3) Pay i) L= {0 1"Jn>1} (08 Marks) b. Define Chomskey, Normal form, Convert the following CFG to CNF S—aACa AsalB B=Cle CC lE. EWIT-LIBRARY (08 Marks) OR . a. Define Ambiguity. Consider thé grammar E ++ EE }# BE | - EE | x | y. Find the leftmost, rightmost derivations and parse trees for the string" + - xyxy”. (07 Marks) b. Define PDA. Design a PDA to accept the following language. L= {ww*: we {a,b}: Draw the transition diagram for the constructed PDA. (09 Marks) M. a. Design a TM to atcept the language L {a" b” | n > 1} Obtain the transition table and transition diagram. Also show the instantaneous description for the string “aabb”. (11 Marks) b. Explain the working principle of TM with diagram, (05 Marks) OR 4 State and prove pumping theorem for CFL's shown that the language L = {a" be": n > 0} is not context free. (10 Marks) >. Explain the hierarchy within the class of CFLs (hierarchy of languages). (03 Marks) ¢. Show that CFL’s are.closed under reverse. (03 Marks) Module-5 a. Explain Multitape TM, with diagram: (05 Marks) b. Prove that every language accepted by a multitape TM is acceptable by some standard TM. (06 Marks) ¢. Explain the model of Linear Bounded Automata. (05 Marks) OR Write short notes on : a. Undecidable languages. b. Halting problem of TM. ©. Post correspondence problem. d. Church ~ Turing Thesis. (16 Marks) 2of2Gales Sensis | | 15CS/1S54 ow {TT TTT TTT Fifth Semester B.E. Degree Examination, June/July 2018 Automata Theory and Computability Time: 3 hrs. Max. Marks: 80 Note: Answer any FIVE full questions, choosing one full question from each module. He With a neat diagram, explain a hierarchy of language classes in automata theory. (04 Marks) Define deterministic FSM. Draw a DESM to accept decimal strings which are divisible by 3. (06 Marks) Convert the @itowing NDFSM to its equivalent DPSM. (Refer Fig.Q.1(6)) G)4 Fig.Q.1(c) Also write transition table for DFSM. (06 Marks) EWIT-LIBRARY oR Minimize the following finite automata, (Refer Fig.Q.2(a)) (06 Marks) Fig.Q.2(a) Construct a mealy machine for the following: i) Design a mealy machine for a binary input sequence. Such that, if it has a substring 101, the machine outputs A. If input has substring 110, the machine outputs B. Otherwise it outputs C. ii) Design a mealy machine that takes binary number as input and produces 2's complement of that number as output. Assume the string is read from LSB to MSB and end carry is discarded. (06 Marks) Convert the following mealy machine to Moore machine. (Refer Fig.Q.2(c)). (04 Marks) Fig.Q.2(6) Lof3ISCS/1S54 Module-2 Define regular expression, Obtain a regular expression for the following languages: i) L={a"b"|m+n is even}. ii) a"b"|m2 1. n21nm 23} iii) L={w fyw|mod3=0 where we (ab)'} - (08 Marks) Design an NDFSM that accept the language L(aa"(a+b)). (04 Marks) Convert the regular expression (0 +1)" 1(0 +1) to NDFSM. (04 Marks) on (EWIT-LIBRARY | If the regular grammars define exactly the regular language, then prove that the class of languages that cat be defined with regular grammars is exactly the regular languages. (04 Marks) Prove that the regular languages are closed under complement, intersection, difference, reverse and letter substitution. (08 Marks) State and prove pumping theorem for regular language. (04 Marks) Define a context-free grammar. Obtain the grammar to generate the language L=fw)n,(w) =n, 069} (04 Marks) For the regular expression (011 +1)" (01) obtain the context free grammar. (04 Marks) ‘What is ambiguity? Show that the following grammar is ambiguous. Sabb A-raS|bAAla B+ bS|aBB|b (08 Marks) OR Define PDA (Push Down automata). Obtain a PDA to accept the language L(M) = {wOw"| wea + b)"}, where WR is reverse of W by a final state, (08 Marks) For the grammar: S—>aABB\adA Arabia B > bBB| A Coa Obtain the corresponding PDA. (04 Marks) Obtain a CFG for the PDA shown below: igo, a, Z) = (qo. AZ) fiqo. a, A) = Go. AY Alqv. b, AY= (qh fa. (04 Marks) 20f310 15CS/IS54 Mod: 4 Consider the grammar S>0AIIB A OAAIS|I RY io ByiT-LIBRARY| BBB) 0s|0 —— Obtain the grammar in CNF. (08 Marks) ‘Show that L = {a"b" 0} is not context free. (08 Marks) OR With a neat diagram, explain the working of'a basic Turing machine. (04 Marks) Obtain a Turing machine to accept the language L = {0°I"|n 21}. (05 Marks) Briefly explain the techniques for TM construction. (04 Marks) Mo 5 Obtain a Turing machine to recognize the language L = fO'"2"|n 2p (08 Marks) Prove that HALT, ={(M,W)| the Turing machine M halts on input W} is undecidable. a With example, explain the quantum computation. (04 Marks) OR Write a short note on: Multiple Turing machine Non deterministic Turing machine ‘The model of linear bounded automaton ‘The post correspondence problem. (16 Marks) tenes 30f3ce8 SonSHE USN | | ISCS/IS54 Fifth Semester BE. Degree Examination, June/July 2019 ‘Automata Theory and Computability Max. Marks: 80 Time: 3 hrs Note: Answer any FIVE,full questions, choosing 1° ‘ONE full question from each module. : Modul = 4 a. Define the following : i) string. ji) alphabet. ii) language. (06 Marks) i &. Deuion a deterministic finite sta machine forthe following language over = {a PI aa i) L= {W|| W| mod 3 > || mod 2 } e ii) L= {w | W ends either with ab or ba} (10 Marks) a a OR 2 a. Write a note on finite state transducers. (07 Marks) b._ Define DESM? Minimize the following FSM. (Refer Fig. Q2(b)] O16 fEwircienary} | eat Fig.Q2(b) (09 Marks) Module. 3 a Write the equivalent Regular’.Expression for, the given Finite state machine. [Reter Fig.Q3(@)] i (08 Marks) Fig Q3(a) b. Write the Regular Expression for the following language. i) {w € {a, b}* with atmost one a} ii) {w € [a, b}* does not end with ba} iii) {w © {0, 1}* has substring 001} ivy (w = {0, 1} |W is even}. (08 Marks) OR 4 a. State and prove the pumping theorem for regular language. (08 Marks) b. Show thatthe language L={a"b"|n 0 | is not regular, (08 Marks) 1 of210 Module-3 Define grammar. Write the CFG for the following language. iy L={we fa, by In, Ov)=n,(w)} i) L {aibii= isi}. I5SCS/ISS4 (08 Marks) ‘What is inherent ambiguity? Show that the language given is inherently amtriguous? L=[aPb% |jnm20 fufa%Me" (nin 0 | SwiT-LIBRARY (08 Marks) or Define PDA® Design PDA forthe language L={a"bMa(izm 0 | Convert the following langilage’from CFG to PDA L = fww* jw ef0, 17} Convert the following OFG fo CNF E> E+E |E*E| (E)| id. led Prove that the language L = |a*b"c" |n 20 | is not context free. Prove that CFL are not closed under interseetion, complement or difference? OR Design a Turing machine to accept D> {abrc® jn20 kk Define a turning machine. Explain the working ofa turning machine. Write a note on multitape machine. Module-5' Write a short notes on Growth rate of function & Church-turning thesis Linear bounded automata. OR Write a short notes on Post correspondence problem Halting problem in turning machine ‘Various types of turning machine (06 Marks) (06 Marks) (04 Marks) (08 Marks) (08 Marks) (08 Marks) (05 Marks) (03 Marks) (05 Marks) (06 Marks) (05 Marks) (0s Marks) (08 Marks) (06 Marks)treated as malpractice. ning blank pages. 42+8= 50, will Aiagonal cross 3 r) Fifth Semester B.E. Degree Examination, Feb./Mar. 2022 Time: 3 hrs, Note: Answer any FIVE full questions, c a CECSISCH ENE = Automata Theory and Computability Modute-1 Define the following with example:() Alphabet (ii) String’ (i) Language Draw a DFA to accept string of a's and b’s ending with ab or ba, Draw a DFA to accept strings of a's and b’s such that: (Language has evén fuumber of as and odd number of b's Gi) Language has.novmiore than three a's, OR Define differénttypes of finite state machines.” Minimize the following Finite state machine ("6 [opi = B/E B |C\F «c |D/H ~ D{E/H| os . Je |Fir *F G/B G |H/sB » H [Ne [at VE EWIT-LIBRARY Fig.Q2(c) Define Regular expression and Write RE for the following language: )L= fab" |n20,m>0y Gi) L= {a"b™| m2 1,n21,nm23} Explain different types of grammars. Obtain « FSM from the following grammar: S—aT TotT Taw We W-aP and obtain the equivalent regular expression. lof2 15CS54 ‘Max. Marks: 80 choosing ONE full question from each module, (06 Marks) (04 Marks) (06 Marks) (04 Marks) (06 Marks) (06 Marks) (04 Marks) (06 Marks) (06 Marks)10 a eee 15CS54 OR Define a Regular grammar. Design regular grammars forthé following languages (®) Strings of a's and b’s ending with ab {i) Strings of a’s and b’s having a substring aab, (06 Marks) State and prove pumping lemma for regulars languages? (06 Marks) Show thet L= {WW"| We (0+1)) is not rege using pumping lemma, (04 Marks) ve Define context fiee grammar, Write a coftex! free grammar for the langage L= fa"? b"/n>0andm>n} , (06 Marks) Define ambiguity of a grammar. Check sihether the following grammar is ambiguous or not. S—aSix X—aXla (04 Marks) Simplify the following grammats S adlaBblec AaB B> alAa C+ccD D— ddd +EWIT-LIBRARY (06 Marks) OR Define PDA. Obtain a PDA to accept = {WW"|We fa, b}*}. Write the transition diagram, (08 Marks) Convert the following grammar inti equivalent PDA. E>E+T ; © EST a* ToT+F ¥ ToF . F>() XX Fid (08 Marks) dule~. State pumping lemma for context ffee languages, Show that L = {a’b’e" | n 2 0} is not context free’ (08 Marks) ‘What ix Turing machine?, Explain different ways of representing Turing machines ~~ (08 Marks) 7 OR What isan ID ofa Tig Machine? Deft the language accepted bya Turing Machine (04 Marks) Design a TM to actept the language L.= {ab |n > 1) (06 Marks) Explain Turiaig Machine Model. (06 Marks) . Module-5 What are the various techniques for TM construction? (06 Marks) Derive the following: (i) Reeursvely enumerable language (ji) Decidable language ; (04 Marks) What is post correspondence problem? (06 Marks) = OR What is halting’problem? Explain, (04 Marks) Define the following: (i) Quantum computer (i) Class NP (04 Marks) Explain Church Turing Hypothesis. (8 Marks) 2of2a t z z USN CBCSIS CHEN ES | | ] 15CS54 Fifth Semester B.E. Degree Examination, Jan./Feb. 2021 Automata Theory and Computability Time: 3 hrs. ‘Max. Marks: 80 Note: Answer any FIVE full questions, choosing ONE full question from each module. Mod Define the following terms with example: (Length ofa string (ii) Reversal (ii) Proper substring (iv) Language {v) Power of an alphabet. (05 Marks) Design a FSM to acceptset of all strings that either begins or ends or both with substring ab. (05 Marks) Convert the given NDFSM to DFSM. (Refer Fig.Ql(e)) de =o ee FigQle) ¢ (06 Marks) OR: Construct a minimized DFSM for the following: . (08 Marks) A BOND E F G HAY /EWIT-LIBRARY 9BQB EAC ELS 1 EAR H HI Bae E b. Define NDFSM and construet NDFSM for the following languages: (i), To recognize the following set of strings abé, abd and aacd (ii), L= {w)we abab® or/iba® where n 2.0) Gif) L = {wiw = abalot [w|i even} (08 Marks) jule-2 Define Regular expression. Obtain’® regular expression for the following languages: (i) L= {wis even} (ii) L= {win w the S® charaéter from right is a and either character is b} (iii) L = {w:w contains both aa and aba as sub string} (06 Marks) b, Construct FSM for the following RE: (ab ii) b+ (ab), (fi) (+ (ab))* (iv) (babb* + a)* — (v) (+ €) (ab)* (a+ €) (10 Marks) OR ‘a. Show that for every RE there is an equivalent FSM. (05 Marks) b. Prove thatthe regular languages are closed under intersection and difference. __ (06 Marks) 1of210 c oe 15CS854 Obtain RE from the following FSM. (Refer Fig.Q4(c)) (05 Marks) \dule-3 Defies Samicet ae ec ad page ect ney een @ albick :i+j =k, iz 0920} a"b™ck : n +2m =k (06 Marks) Consider the grammar G, with productions: S—>AbB a> — Aadl < ARY sows OY [EWIT-LIBRARY] Give the left most @gtivation, rightmost derivation and parse tree forthe string aaabab. (06 Marks) ‘What is agbigous grammar? Prove that the following grammar is ambiqous on the string aab G:S ~yaS}aSbS\e (04 Marks) OR Build & PDA to accept delimiters‘or balanced Paranthesis faving paranthesis(,(,), | a (08 Marks) Explain the following terms) Pushdown Automate Da) (i) Languages ofa PDA (04 Marks) Obtain a CFG for PDA Mwith the transitions, B(qo, 8, Z) = (qo, AZ) an (qo, b, A) = (qo, AA) B(qoa, A)= (ane) . (04 Marts) 4 Module-4 State and Brove pumping Lemma for context free languages. (06 Marks) Provetthat L = {w € {a, b, c}* where na(w)=n,(w)=nw)} is not context free. (04 Marks) Prove that the Context Freé’Languages are closed ‘under, union and concatenation. (06 Marks) eS oR With a neat diagram, explain the working of'a basic TM. (06 Marks) Design a TM to actept the following language L = {0° 1"2"|n>1} (10 Marks) Write short notes on: Multi Tape TM Non Deterministic TM Post Correspondence Probiém (16 Marks) 4 OR Prove that every-Language accepted by a multitape TM is accepted by standard TM with single tape. (06 Marks) Write note on: (i) Linear Bounded Automata (ii) Recursive Language (10 Marks) 2 of2treated as malpractice, ‘your answers, compulsorily draw diagonal cross lines on the remaining blank pages. : & i CECSIS CHEN E USN | LT] L 15CS54 Time: 1 a b, 2 @ b 3 a. b Fifth Semester B.E. Degree Examination, July/August 2022 Automata Theory and Computability 3 hrs. Max. Marks: 80 Note: Answer any FIVE full questions, cliosing ONE full question from each module. ~ Module-1 ite Automata. Design DFSM for following languages. ahs mod 3 = 0}. List the applications of Fi i) L={W || n,| mod: ii) L= {strings of a’s and b°S which start with ab and ends with a}. (10 Marks) Define Finite State Transducers. Obtain and equivalent Moore machine for the Mealy machine given below (06 Marks) ats Fig. Qi(b) DefiflesPower of an Alphabet/ 0} is not regular. (08 Marks) OR S 1of210 15CS54 Obtain Regular expression for Finite State Machine given below and give the language defined by Regular expression. (08 Marks) 4 > o List the closure properties of Regular Lang construct the RegulgG rammar for following : i) L= {(01)'101 (0+ ” ii) L= fart be m20} iii) L= {1 +1) O+10)}. Y (08 Marks) Module-3 Define CFG. Construct CFG far the languages given below. i) L= {Win (W)=m (W)} ii) L= fa?! b™ cc" |n, m20}, (08 Marks) Define CNF. Design PDA®* for the language L = {0° b" 1°" | n, m > 0}. Write the Instantaneous Descriptionsfor the string ObbI 1 (08 Marks) OR Consider the Gfammiar J E>E+E/E>E|E*E|B/E|(®)|1 EWIT-LIBRARY 1 0] 1 fj b| fa | 1b|10)11 and compute the following for input string (al + bO + 00), i) LMD ii) RMD iii) Parse Tree iv) Is this ambiguous? Justify your answer. ~ (08 Marks) List out the simplification techniques of CFG. Expltin, PDA and obtain an equivalent PDA for CFG given below: -S->a|b|aSb|/b 9a. V SS (08 Marks) ) - .” “i s Moai List the Closure propérties of CFLs and prove that language | = {a”* b® c™" | n> 0} is not context free language. (08 Marks) Define TM. Explain working of TM with neat diagram. (08 Marks) OR Design and construct 'TM to’accept the language: = {W | W is balance parenthesis}. Show the moves made by TM foF'string W = (()() (08 Marks) List the techniques for-TM-construction. Explain the concept of string membership in CFL Using context free grammar and Push DownAutomata. (08 Marks) Module-5 List the variants 6f TM. Prove, that for every language accepted by multi tape TM is iccepted by some Single tape TM. (08 Marks) Define Linear Bounded Automata (LBA). Explain the model of LBA with neat diagram and state the relation between LBA and context sensitive language (08 Marks) OR State the definition ofAlgorithm by Church ~ Turing. Explain the Quantum computers. (08 Marks), Define P, NP ekisses with respect to TM. Explain post correspondence problem and prove that PCP with two list x= (01, 1,1) ; y=(01?, 10, 1') has no solution. (08 Marks) 2of2un [| |] | 1SC884 Fifth Semester B.E. Degree Examination, June/July 2023 Automata Theory and Computability ~ Time: 3 hrs Max. Marks: 80 Note: Answer any FIVE full questions, choosing ONE full question from each module. Module-1 1a. Define the following terms with exampl é (i Alphabet (ii) Lengthofstring (iii) prefix (05 Marks) z b. Build a DFSM for the language: E L= {we {a,b}* : no two consecutive characters até the same} (05 Marks) c. For the following NDFSM, use ndfsmtodfsm to construct an equivalent DFSM. Begin by showing the value of eps(q) for each state g, »& Fig.Q\e) (06 Marks) OR 2 a, Explain the Machine-Based Hierarchy of Language classesé (05 Marks) b. Build a nondeterministic FSM for the language L = {a € {a,b}* : = bab or jo) is odd} (05 Marks) c. Minimize'the DFSM. (06 Marks) Module-2 3. a, Define Regular Expression and write a RE to describe each of the following language: aa () L={a"b" 24, <3} 2 Gi) L= {@€ {a,b}* :@has both aa and bb as substrings} (05 Marks) é Show that Regular Languages are closed under complement. (05 Marks) 5 ©. Build a Regular Expression from the given FSM. Om. @J—-Q) Fig.Q3(c) (06 Marks) lof315CS54 OR Show a regular grammar for the FSM. yore ae ab Fig.Q4(@) (05 Marks) Build an FSM from the RE (a*UB*c*)*. (05 Marks) State and prove the pumping lemma for Regular Languages: (06 Marks) : Module-3 Define context free grdanfhar. Design a CFG for thé}anguage L = {a"e"d?" : n,m 20} ¢ (05 Marks) Consider the CFG with productions E>E+T|T TOT+EIR F>@)\ON Write the leftmost derivation, rightmost derivation and a parse tree for the string 0 + | * | (05 Marks) Design a PDA for the language D="{a"b":n 20} " (06 Marks) OR Prove whether the given grammar is ambiguous grammar or not. S— aBbA AaSbAAla ; B > bS | aBB [b forthe string aab. (05 Marks) Define Chomsky.xiormal form. Apply:the formalization algorithm to convert the grammar to CNF. S— ABC™ AsaC|D BbBl<|A « Cx Ac| Ce D> aa F (05 Marks) Design a PDA forthé language L = {a'b’c* 21+ j=k,i20,j20}. (06 Marks) Module-4 Prove that the Janguage L = {a’b’e” :n 2 1} is not context free. (05 Marks) Show that cOntext free languages are closure under union, concatenation and kleene star. (05 Marks) Design a Turing Machine to recognize all strings consisting of an even number of 1's (06 Marks) OR Explain techniquesuséd for TM construction. (05 Marks) What is the relationship between DCFL's and the L’s that are not inherently ambiguous? Explain. (05 Marks) Design avTuring Machine that accepts L = {a"" : n > 1}. Obtain the instantaneous description for the string aabb. (06 Marks) 20f3ve 15CS54 Module-S Let fin) = 4n? + Sn? + 7n +3. Prove that fin) = O(n’). (05 Marks) Write a note on quantum computers. (05 Marks) Find the running time for the Euclidean algorithitfor evaluating gedta, b) where a and b are integers expressed in binary representation. (06 Marks) OR Explain the multi-tape TM. (05 Marks) Explain the model of Linear Bounded/Automata. (05 Marks) Define PCP. Does the PCP with two lists x = (b, bab, ba) ahd y = (0, ba, a) have a solution, (06 Marks) 30f3