EASA COLLEGE OF ENGINEERING & TECHNOLOGY NAVAKKARAI,COIMBATORE-641105 Department Of Computer Science And Engineering THEORY OF COMPUTATION Prepared by Karthikadevi.

D ,Lecturer/cse UNIT-I CHURCH-TURING THESIS 1. What is a Turing Machine? Turing machine is a simple mathematical model of a computer. TM has unlimited an unrestricted memory and is a much more accurate model of a general purpose computer. The turing machine is a FA with a R/W Head. It has an infinite tape divided into cells, each cell holding one symbol. 2. What are the difference between finite automata and Turing Machines? Turing machine can change symbols on its tape, whereas the FA cannot change symbols on tape. Also TM has a tape head that moves both left and right side 3. Define Turing Machine? A turing machine is a 7-tuple (Q, , , , q0, qaccept, qreject) where Q: finite set of states : input alphabet (cannot include blank symbol, _) : tape alphabet, includes and _ : transition function: Q Q {L, R} q0: start state, q0 Q q Accept: accepting state, q accept Q q Reject: rejecting state, q reject Q 4. What is configuration? Turing machine computes, changes occur in the current state, the current tap contents and the current head location. A setting of these three items is called a configuration. 5. What is a recursively enumerable language?

The languages that is accepted by TM is said to be recursively enumerable (r. e) languages. Enumerable means that the strings in the language can be enumerated by the TM. The class f r. e languages include CFLs. 6. Define variants of Turing Machine? Variants are Non deterministic turing machine. Mutlitape turing machine. Enumerators 7. What is a multitape TM? A multi-tape Turing machine consists of a finite control with k-tape heads and ktapes each tape is infinite in both directions. On a single move depending on the state of finite control and symbol scanned by each of tape heads ,the machine can change state print a new symbol on each cells scanned by tape head, move each of its tape head independently one cell to the left or right or remain stationary. 8. Define nondeterministic TM? Arbitrarily chooses move when more than one possibility exists Accepts if there is at least one computation that terminates in an accepting state 9. What is an algorithm? An algorithm is a collection of simple instruction for carrying out some task. It called procedures or recipes. 10 What is a polynomial? It is a sum of terms where each term is a product of certain variables and a constant called a coefficient. Eg.6 x*x*x*y*z*z=6xyz2 11. Define Church-Turing thesis? In 1936 Alonzo church used a notational system called -calculus to define algorithms and Alan Turing did it with his machines. These two definitions were shown to be equivalent .This connection between the informal notion and precise definition has come to be called Church-Turing thesis 12. List the types of description. Formal description. Implementation description. High-level description. is sometimes

13. What is halting problem? A TM M is a TM and M accepts w } TM A is undecidable but TM A is Turing recognizable hence TM A is sometimes called the halting problem. 14. Mention the relationship between classes of languages. 15. Define universal Turing machine. A universal Turing machine (UTM) is a TM which is capable of simulating any other Turing machine from the description of the machine. 16. What is a Diagonalization language LD? The diagonalization language consists of all strings w such that the TM whose code is w does not accept when w is given as input. 17. Why some languages are not decidable or even Turing recognizable? The reason that there are uncountable many languages yet only countably many Turing machines. Because each Turing machine can recognize a single language and there are more languages than Turing machines, some languages are not recognizable by any Turing machine. 18. What do you mean by co-Turing-recognizable? A language is called co-Turing-recognizable if it is the complement of a Turing-recognizable language 19. Define Countable and Uncountable? A set is countable if it is finite or has the same size as N (the set of natural numbers {1, 2, 3, }) Examples: N (natural numbers), Z (integers), Q (rational numbers), E (even numbers), etc. A set is uncountable if it has more elements than N. Examples: R (real numbers) [0, 1] Cantor set 20. What is a correspondence? A function that is both one-to-one and onto is called correspond.

BIG QUESTIONS 1. Explain the various techniques for Turing machine construction. 2. Briefly explain the different types of Turing machines. 3. Design a TM to accept the language L={0n1n | n>=1} 4. Explain how a TM can be used to determine the given number is prime or not? 5. Prove that if L is recognized by a TM with a two way infinite tape if it is recognized by a TM with a one way infinite tape 6. Prove that Halting problem is undecidable. 7. Design a Turing machine that accepts the language L= {an bn cn /n>1} 8. What are the various models of Turing Machine? 9. With an example explain the universal Turing machine 10. Show that halting problem of Turing machine is undecidable 11. Show that a language is decidable if it is Turing-recognizable and co- recognizable.

UNIT-II REDUCIBILITY

1. What is reduction? A reduction is a way of converting one problem into another in such a way that a solution to the second problem can be used to solve the first problem. 2. What is reducibility? The primary method of proving some problems are computationally unsolvable. It is called reducibility. Reducibility always involves two problems which we call A and B. If A reduces to B, we can use a solution to B to solve A. 3. What is linear bounded automation? A linear bounded automation is restricted type of Turing machine where in the tape head isnt permitted to move off the portion of the tape containing the input. It has a limited amount of memory. 4. What is a accepting computation history? An accepting computation history is defined as , Let M be a Turing machine and w be a input string, for M on w is a sequence of configuration c1,c2,cl, Where c1 is the start configuration of M onw . cl is the accepting configuration of M and each ci legally follows from ci-1 according to the rules of M. 5. What is a rejecting computation history? Let M be a Turing machine and w be a input string , for M on w is a sequence of configuration c1, c2 , cl Where cl is a rejecting configuration of M on W . 6. Write down the algorithm that decides ALBA? The algorithm that decides ALBA is as follows: 1. L= on input {M,w} Where M is an LBA and w is a string . 1.1 Simulate M on w for qng^n steps until it halts 1.2 If M has halted accept if it has accepted and reject if it has rejected. If it has not halted, reject. 7. Write about the three conditions of computational history? Suppose consider the input B and it has possible input C1,C2. Cl. If B wants to check whether the Ci satisfy the three conditions of computational history 1. C1 is a start configuration for M on w 2. Each Ci+1 legally follow from Cp 3. Cl is an accepting configuration for M

8. What is called PCP? The phenomenon of undecidability is not confined to problems concerning automata. An undecidable problem concerning on simple manipulation of strings is called the post correspondence problem or PCP. An instance of the pcp is the collection P of dominos: P = {[t1/b1]}, [t2/b2],.. [tk/bk]} and a match is a sequence i1,i2,i3.il.. Where ti1, ti2.til = bi1, bi2..bil PCP={<P>/P is an instance of the post correspondence problem with a match} 9. How can we construct P so that a match is an accepting computation history for M on w? The task is to make a list of the dominos; so that the string we get by reading off the symbols on the top is same as the string of symbols on the bottom. This list is called a match. For example: [a/ab][b/ca][ca/a][a/ab][abc/c].Reading off the top strings we get abcaaabc, which is same as reading off the bottom. 10. What is MPCP? MPCP Modified Post Correspondence Problem, in that the match is required to start with the first domino in the list. MPCP = {<P>/P is an instance of the post correspondence with a match that starts with the first domino}. 11. What is called mapping reducibility? Language A is mapping reducible to language B, written A<=B; if there is a computational function f: **, Where for every w, w a f (w) B. 12. Define computable function? A turning machine computes a function by starting with the input to the function on the tape and halting with the output of the function on the tape a function f: ** is a computable function , if some turning machine M, on every input w, halts with just f(w) on its tape. Eg: All arithmetic operations on integers. 13. What is recursion theorem? Let T be a Turing machine that computes a function t: * x **. There is a Turing machine R that computes a function r: **, Where for every w: r (w) =T (<R>, w). The recursion theorem is a mathematical result that plays an important role in advanced work in the theory of computability.

14. What is self reference? The Turing machine that ignores its input and prints out a copy of its own description, we call this as SELF. There is a computable function q: **, where for any string w, q(w) is the description of a Turing machine Pw that prints out w and then halt. 15. What is computer virus? A computer virus is a computer program that is designed to spread itself among computers. Computer virus are inactive when standing alone as piece of code, but when placed appropriately in a host computer, thereby infecting it and they can become activated and transmit copies of themselves to other accessible machines. Various media can transmit viruses, including internet and transferable disks. 16. Applications of recursion theorem? 1. ATM is undecidble. 2. MINTM is not Turing recognisable 3. Fixed point theorem.

17. What is a fixed point? A fixed point of a function is a value that isnt changed by application of the function. 18. Define formula. A formula is a well formed string over this alphabet. 19. What are the Boolean operations and Quantifiers? The form of the alphabet of this language: {^,v,,(,),for all, x , there exists,R1,.Rk}.The symbols ^,v, are called Boolean operations. The symbols of for all and there exists are called Quantifiers. The symbol x denotes the variable R1, R2,..Rk, called the relations. 20. What is atomic formula? A string of the form Ri (x1, x2, x3,..xj) is an atomic formula. The value j is the arity of the relation symbol Ri. 21. What is called Sentence/Statement and Free variable? A variable that isnt bound within the scope of a quantifier is called a Free variable. A formula with no free variable is called a Sentence or Statement.

22. What is model? A universe together with an assignment of relations to relation symbol is called a model. A model M is a tuple (U, P1, P2..Pk), where U is the universe and P1 through Pk are the relations assigned to symbols R1 through Rk. 23. What is language of a model? Language of a model is the collection of formulae that use only the relational symbols the model assign and that use each relation symbol with the correct arity. If is a sentence in a language of a model , is either true or false in that model. 24. What is decidable theory? Let (N,+) be the model, except without x relation. Its theory is Th(N,+). For example: the formula[x+x=y] is true therefore a member of Th (N, +). 25. What is undecidable theory? Let (N, + , X) be a model whose universe is the Natural numbers with the usual +,X relations. Church showed that Th(N,+,X) the theory of this model; is undecidable.

26. What is called Turing Reducibility? Language A is Turing reducible to language B, written A<=TB, if A is decidable relative to B. Turing reducibility is a generalization of mapping reducibility. 27. What is called Oracle Turing machine? An Oracle for a language B is an external device that is capable of reporting whether any string w is a member of B. An Oracle Turing machine is a modified Turing machine that has the additional capability of quering an Oracle. 28. What is information? Definition of information depends upon the application. For example: A= 0101010101010101 B= 11101110111000111 Sequence A contain little information because it is merely a repetition of pattern 01 twenty times. In contrast sequence B appears to contain more information. 29. What is minimal Description? Minimal Description of x, written d(x), is the shortest string (M, w), where TM, M on input w halts with x on its tape.

30. What is Descriptive complexity? The Descriptive complexity of x, written k(x) is k(x) = |d(x)| where k(x) length of the minimal description of x. The definition of k(x) is intended to capture the amount of information in the string x. 31. When an x is a C-compressible? Let x be a string, say that x is C-compressible if k(x) <= |x| - C. BIG QUESTIONS 1. Explain how Post correspondence problem is undecidable? 2. Prove that HALTTM is undecidable. 3. Prove that ETM is undecidable. 4. Prove that REGULAR TM is undecidable. 5. Prove that EQ TM is undecidable. 6. Prove that A LBA is decidable. 7. Prove that E LBA is undecidable. 8. Prove that ALL CFG is undecidable. 9. State and prove PCP is undecidable.

UNIT-III TIME COMPLEXITY 1. Define complexity Complexity Theory = study of what is computationally feasible (or tractable) with limited resources: running time Storage space Number of random bits Degree of parallelism Rounds of interaction Others 2. Define time complexity The time complexity of a TM M is a function f:N N, where f(n) is the maximum number of steps M uses on any input of length n. 3. Define Asymptotic Notation Running time of an algorithm as a function of input size n for large n. Expressed using only the highest-order term in the expression for the exact running time 4. What do you mean by polynomial and exponential bounds? Bounds of the form nc for c greater than 0 .such a bound are called polynomial bounds. Bounds of the form 2(n ) .such a bound are called exponential bounds when is a real number greater than 0 5. What is Hamiltonian path? A Hamiltonian path in a directed graph G is a directed path that goes through each node exactly once. We consider a special case of this problem where the start node and target node are fixed. 10. Prove that EQ TM is neither Turing-recognizable nor co-Turing-recognizable. 11. State and prove recursion theorem 12. Explain self-reference in detail. 13. Explain decidability of logical theories? 14. Write a brief note on a decidable theory? 6. List the types of Asymptotic Notation. Big Oh (O) notation provides an upper bound for the function f Omega () notation provides a lower-bound Theta (Q) notation is used when an algorithm can be bounded both from above and below by the same function

 Little oh (o) defines a loose upper bound. 7. What is Hamiltonian path? A Hamiltonian path in a directed graph G is a directed path that goes through each node exactly once. We consider a special case of this problem where the start node and target node are fixed. 8. Defines brute force search 15. Write a brief note on an undecidable theory? 16. Explain Turing reducibility? Exponential time algorithms typically arise when we solve by searching through a space of solutions called brute force search 9. Define running time. The running time of N is the function NN, where f(n) is the maximum of steps that N uses on any branch of its computation on any of length n. 10. Define class P The class of all sets L that can be recognized in polynomial time by deterministic TM. The class of all decision problems that can be decided in polynomial time. 11. Define class NP. Problems that can be solved in polynomial time by a nondeterministic TM. Includes all problems in P and some problems possibly outside P. 12. Define verifier. A verifier for a language A is an algorithm V, where A = {w | V accepts <w,c> for some string c}. We measure the time of a verifier only in terms of the length of w, so a polynomial time verifier runs in polynomial time in the length of w. A language A is polynomially verifiable if it has a polynomial time verifier. The above string c, used as additional information to verify that wA, is called a certificate, or proof, of membership in A. 13. What do you mean by NP-completeness? If a polynomial time algorithm exists for any of the NP-complete problems, all problems in NP would be polynomial time solvable. These problems are called by NP-completeness 14. Define polynomial time computable functions. A function f: * is a polynomial time computable functions if some polynomial time turing machine exists that halts with just f(w) on its tape. when started on any input w.

15. Define polynomial time mapping reducible. We say that A is polynomial time mapping reducible, or simply polynomial time reducible, to B, written APB, if a polynomial time computable function f: * * exists s.t. for every string w*, wA if f(w)B. Such a function f is called a polynomial time reduction of A to B. 16. Define literal. A literal is a Boolean variable x or a negated Boolean variable x. 17. Define clause. A clause s several literals connected with s, as in (x y z t). 18. Define conjunctive normal form. A Boolean formula is in conjunctive normal form, called a cnf-formula, if it comprises several clauses connected with s, as in (x y z t) (x z) (x y t) A cnf-formula is a 3cnf-formula if all the clauses have 3 literals, as in (x y z) (x z t) (x y t) (z BIG QUESTIONS 1. Show that every CFL is a member of class P problem 2. Show that a language is in NP if it is decided by some non deterministic Polynomial time Turing machine. 3. Explain the cook-Levin theorem 4. Explain about the vertex cover problem. 5. Explain about Hamiltonian path problem. 6. Briefly discuss about the subset sum problem? 7. With an example explain BIG-O and SMALL-O notation. 8. Explain about Analyzing algorithms in detail? 9. Explain CLASS P in briefly with an example? 10. State and prove PATH P. 11. State and prove RELPRIME P. 12. Prove that every context-free language is a member of P. 13. Explain with an example CLASS-NP?

UNIT-IV 1. Define space complexity 2. Design a turing machine M to implement the function multiplicationusing the 3. 4. 5. 6. 7. 8. 9. 10. 11.

subroutinecopy. Design a TM to compute proper subtraction m-n. Design a TM to accept the language L={0n1 n/n=1} Construct a TM to recognize the language L={ 02n/n=0} Enumerate the various techniques adopted for the construction of a TM. Explain finite control can be treated as storage for a finite amount of information. Illustrate with an example the techniques of creating the tape to have multiple tracks. Illustrate with example the techniques of checking off symbols. Construct a part of TM to shift non blank symbol two cells to the right end. support that tape does not contain blanks between non blanks. Prove that if L is recognized by a TM with a two way infinite tape iff it is recognized by a TM with a one way infinite tape UNIT V 1) Discussion detail about universal TM. 2) Show that the complement of a recursive language is recursive. 3) Show that Lu is recursively enumerable but not recursive. 4) Show that LD is not recursively enumerable. 5) If a language L and its complement L are both recursively enumerable, then show that L and hence L are recursive. 6) Prove that there exists a recursively enumerable language whose complement is not recursively enumerable. 7) Prove that any non-trivial property of the recursively enumerable languages is undecidable. (Rices theorem). 8) Prove that Halting problem is undecidable. 9) Obtain an NDFA without e-transition to the following NDFA with E-transition:

F= {q2}, initial state={q0} 0 q0 q1 {q0} 1 {q1} 2 e {q1} {q2}

q2

{q2}

10) Define Moore Machine with example. 11) Define Mealy machine with example. 12)Prove that machineM2. for every Moore machine M1 there is a Mealy

13) State the pumping lemma for regular sets or regular language. 14) What is the use of the pumping lemma for regular sets?
THEORY OF COMPUTATION
QUESTION BANK

UNIT I PART A: 1. 2. 3. . ". %. &. (. +. 10. 11. 12. 13. 1 . 1". 1%. 1&. 1(. 1+. 20. 21. 22. 23. 2 . 2". 2%. What is a Turing machine? Give its schematic description. Give the difference between finite automata & Turing machine. Give the snapshot of TM computing even no of 0s. Give the forma! definition of a TM. What is meant b# a configuration of a TM? Give e$amp!e. What is meant b# a #ie!d? Give e$amp!e. What are the t#pes of configuration? 'efine them. 'efine Turing)recogni*ab!e !anguage. What are deciders? 'efine Turing)decidab!e !anguage. 'efine recursive!# enumerab!e !anguage. 'efine variants of a TM. 'efine robustness of a TM. What is meant b# the ,sta# put- feature of a TM? .ist out the variants of a TM. Give the forma! definition of a Mu!ti)tape TM. Give the forma! definition of a /ondeterministic TM. What is meant b# an enumerator? 'efine 0i!bert1s prob!em. What is a po!#nomia!? Give its structure. 'efine the 2hurch)Turing thesis. 'efine the term decidabi!it#. What are decidab!e !anguages? Give e$amp!e. What is meant b# an acceptance prob!em? Give e$amp!e. 3s 4567 a decidab!e !anguage? 3f #es8 prove. 'efine s#mmetric difference.

2&. 'epict the re!ationship among c!asses of !anguages. 2(. 'efine ha!ting prob!em. Give an e$amp!e. 2+. 'efine 9niversa! TM. 30. What is diagona!i*ation method? 31. 'efine correspondence. Give e$amp!e. 32. 'efine the term ,countab!e- & ,uncountab!e-. 33. What is meant b# an infinite binar# se:uence? 3 . What is characteristic se:uence? 3". 'efine co)Turing)recogni*ab!e. 3%. When a !anguage is said to be ,decidab!e-? 3&. What is an acceptance prob!em? 3(. 'efine s#mmetric difference. 3+. ;<etch the re!ationship among the c!asses of !anguages. 0. 'efine 0a!ting prob!em. 1. What is diagona!i*ation method? 2. 'efine the term correspondence. 3. What are uncountab!e sets? . 'efine the characteristic se:uence of a !anguage. ". 'efine co)Turing recogni*ab!e !anguage. PART B: 1. 2. 3. . 6$p!ain the functions of a TM with an e$amp!e. Give an account on the variants of TM with neat diagrams. 6$p!ain 2hurch)Turing thesis based on the 0i!bert=s prob!em. ;how that 4'>48 4/>48 45678 6'>48 6?'>4 are decidab!e !anguages with suitab!e TM descriptions. (or) ;how that the prob!ems concerning finite automata are acceptance@decidab!e prob!ems with suitab!e TM descriptions. ". ;how that the prob!ems concerning 2>Gs are decidab!e with suitab!e TM descriptions. %. What is 0a!ting prob!em? Arove that it is undecidab!e using diagona!i*ation method. UNIT II

PART A: 1. 'efine reducibi!it#. 2. What is meant b# reduction? 3. 'efine the prob!em that describes whether a TM ha!ts on a given input. (The ques !o" !s HA#TTM . You h$%e o &!%e ! s '$"&u$&e ( )e*!"e ! ) . What is a computation histor#? 'efine its t#pes. ". 'efine !inear bounded automaton B.C4D. %. .ist out the constraints of .C4. &. 'epict *ig)*agging. (. 'efine post correspondence prob!em. +. What is a domino? 10. What is modified post correspondence prob!em? 11. 'efine mapping reducibi!it#. 12. 'efine computab!e functions. 13. 'efine computabi!it# theor#. 1 . 'efine recursion theorem. +,. 'efine se!f)reference. (&!%e he -se'*. )!$&r$/ $'so)

1%. What are the termino!ogies for recursion theorem? 1&. Give the app!ications of recursion theorem. 1(. 'efine minima! TM. 1+. What is meant b# the fi$ed)point of a function? 20. 'efine twin prime conEecture. 21. What are :uantifiers? 22. What is a we!!)formed formu!a? 23. What is an atomic formu!a? 2 . 'efine the scope of a :uantifier. 2". 'efine prene$ norma! form. 2%. What is meant b# a free variab!e & sentence? 2&. 'efine a mode! & its !anguage. 2(. 'efine the theor# of a mode!. 2+. What is meant b# a decidab!e theor#? 30. 'efine Turing reducibi!it#. 31. 'efine an orac!e TM. PART B: 1. Give the prob!ems that are undecidab!e based on reducibi!it#. Arove them individua!!#. 2. Give the prob!ems that are reducib!e via computation histories. ;how that whether the# are decidab!e or undecidab!e. 3. 'efine A2A. ;how that A2A is undecidab!e with suitab!e e$amp!e. . 6$p!ain mapping reducibi!it# in detai! with suitab!e e$amp!es ( heore/s). ". Give an account on se!f)reference. (or) 6$p!ain in detai! about recursion theorem. %. Give a detai!ed account on decidabi!it# of !ogica! theories with appropriate e$amp!es.

UNIT III PART A: 1. 'efine comp!e$it# theor#. 0. 'efine time comp!e$it# or running time of a TM. (*or 1o h NTM ( 2TM 3ou shou') 4r! e) 3. What is meant b# worst)case ana!#sis & average)case ana!#sis? . 'efine as#mptotic ana!#sis. ". What is meant b# upper bound & !ower bound? %. What is meant b# po!#nomia! bound & e$ponentia! bound? &. 'efine the time comp!e$it# c!ass. (. What is meant b# a !inear time? +. 'efine brute)force search. 10. 'efine the c!ass A. 11. .ist out a!! the prob!ems that are in c!ass A. 12. What is 6uc!idean a!gorithm? 13. 'efine d#namic programming. 1 . 'efine the c!ass /A. 1". What is 0ami!tonian path? Give e$amp!e. 1%. 'efine po!#nomia! verifiabi!it#. 1&. What is a verifier? 1(. What is meant b# the term ,certificate-? 1+. .ist out a!! the prob!ems that are in c!ass /A. 20. 'ifferentiate c!ass A with c!ass /A. 21. What is a c!i:ue? 22. 6$p!ain A vs /A. 23. 'efine /A)comp!eteness. 2 . .ist out a!! the prob!ems that are /A comp!ete. 2". 'efine satisfiabi!it# prob!em. 2%. What are ca!!ed as Coo!ean variab!es? 2&. When a Coo!ean formu!a is said to be satisfiab!e? 2(. 'efine 2oo<).evin=s theorem. 2+. 'efine po!#nomia! time reducibi!it#. 30. What is a cnf)formu!a? 31. 'efine 3cnf. 32. What is a !itera!? 33. 'efine tab!eau. 3 . 'efine verte$)cover prob!em. 3". 'efine gadgets & its t#pes. A45T CF 1. 6$p!ain how to ana!#se the a!gorithms & measure its time comp!e$it# with suitab!e e$amp!es. 2. 6$p!ain the c!ass A prob!ems in detai!. Arove that the# be!ong to c!ass A. 3. .ist out the prob!ems in /A. Arove that the# be!ong to /A c!ass. . 6$p!ain how 3;4T is po!#nomia! time reducib!e to 2.3?96. ". Arove that ;4T prob!em is /A)comp!ete using 2oo<).evin=s theorem. %. 6$p!ain /A)comp!eteness. Give the prob!ems under /A)comp!ete and show that the# are /A) comp!ete. &. Arove that 04MA4T0 is /A)comp!ete with suitab!e e$amp!e.

UNIT I5 PART A: 1. 'efine space comp!e$it# of a TM. 2. 'efine space comp!e$it# c!asses. 3. 'efine ;avitch=s theorem. . What is meant b# #ie!dabi!it# prob!em? ". 'efine A;A426 c!ass. %. 'efine A;A426)comp!eteness. &. 'epict the re!ationship among A8 /A8 A;A4268 and 67AT3M6. (. What is T?C> prob!em? +. What are the t#pes of :uantifiers? 10. 'efine . & /. c!asses. 11. 'efine /.)comp!eteness. 12. What is a !og space transducer? 13. What is co/.? 1 . 3s /.Gco/.? Hustif# #our answer. 1". What is genera!ised geograph# prob!em? 1%. What is formu!a)game? 1&. 'efine intractabi!it#. 1(. What is hierarch# theorem? 1+. What are the t#pes of hierarch# theorem? 'efine them. 20. 'efine the term ,space constructib!e-. 21. 'efine the term ,time constructib!e-. 22. 'efine e$ponentia! space comp!eteness. 23. 'efine re!ativi*ation. 2 . What are the !imits of diagona!i*ation method? 2". 'efine circuit comp!e$it#. 2%. What is a Coo!ean circuit? Give e$amp!e & show how it is computed. 2&. What is a circuit fami!#? 2(. 'efine si*e comp!e$it# of a circuit fami!#. 2+. 'efine depth comp!e$it# of a circuit fami!#. 30. 'efine circuit si*e comp!e$it# of a !anguage. 31. 'efine circuit depth comp!e$it# of a !anguage. 32. A.T /. is a subset of A;A426. 33. A.T A;A426 is a subset of 67A;A426. 3 . ;.T if 4 I. C & C J .8 then 4 J .. A45T CF 1. 6$p!ain ;avitch=s theorem in detai! with e$amp!e. 2. A.T T?C> is A;A426)comp!ete prob!em. 3. A.T >K5M9.4)G4M6 & Genera!ised Geograph# prob!ems are in A;A426)comp!ete. . A.T /.Gco/. with suitab!e a!gorithm. ". 6$p!ain t#pes of hierarch# theorems with e$amp!es. %. 6$p!ain e$ponentia! space comp!eteness with e$amp!e. &. 6$p!ain circuit comp!e$it# with suitab!e prob!ems. (. Give a detai!ed account on re!ativi*ation.

UNIT 5 PART A: 1. 2. 3. . ". %. &. (. +. 10. 11. 12. 13. 1 . 1". 1%. 1&. 1(. 1+. 20. 21. 22. 23. 2 . 2". 2%. 2&. 2(. 2+. 30. 31. 32. 33. 3 . 3". 3%. 3&. 3(. 3+. 0. 1. 2. 3. . ". What is meant b# an optimi*ation prob!em? 'efine optima! so!ution. 'efine appro$imation a!gorithm. What is meant b# decision prob!em? What is meant b# minimi*ation & ma$imi*ation prob!ems? 'efine the term ,<)optima!-. What is a probabi!istic a!gorithm? 'efine probabi!istic TM. 'efine coin)f!ip step. 'efine the c!ass CAA. What is amp!ification !emma? 'efine error probabi!it#. What is meant b# prima!it#? What is >ermat test? 'efine >ermat1s !itt!e theorem. 'efine pseudoprime. What is chinese remainder theorem? 'efine 5A c!ass. What is meant b# branching program? What is read)once branching program? 'efine a!ternation. 'efine a!ternating TM. 'efine 4A8 4A;A426 and 4. c!asses. What is tauto!og#? What is meant b# interactive proof s#stem? 'efien graph non)isomorphism prob!em. What are the inputs of a verifier & a prover? 'efine them. 'efine 3A c!ass. 3s 3AGA;A426? Hustif# #our answer. 'efine para!!e! computation. What is A54M? 'efine uniform Coo!ean circuit. What is the processor comp!e$it# of a Coo!ean circuit? What is the para!!e! time comp!e$it# of a Coo!ean circuit? When a fami!# of circuit is said to be uniform? 'efine /2 c!ass. 'efine /2 computab!e function. Arove that /2 is the subset of A. What is cr#ptograph#? What is a secret <e#? 'efine the term ,one)time pad-. What is meant b# private)<e# & pub!ic)<e# cr#ptos#stem? 'efine one)wa# permutation. 'efine one)wa# function. What is meant b# trapdoor function?

PART B: 1. 6$p!ain probabi!istic a!gorithms in detai! with an e$amp!e prob!em(6r!/$'! 3). 2. A.T 6?5KCA is in CAA c!ass. 3. Give an account on a!ternation with suitab!e e$amp!es. . 6$p!ain interactive proof s#stems with an e$amp!e prob!em. ". Arove the fo!!owingF aD 3A G A;A426 bD 3A A;A426 cD A;A426 IP 6. Define the counting problem for satisfiability. Prove that the language #SAT IP. 7. Prove the following : a) NC1 L b) NL NC2 c) NC P 8. Explain an application of complexity theory(cryptography) (cryptography) & its research fields.