Toc Wheebox

12/26/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?
testNo=1575&code=1052000&showTest=320&actForm=edit&set=1
Seat No -
Total number of questions : 60
10276_THEORY OF COMPUTATION
Time : 1hr
Max Marks : 50
N.B
1) All questions are Multiple Choice Questions having single correct option.
2) Attempt any 50 questions out of 60.
3) Use of calculator is allowed.
4) Each question carries 1 Mark.
5) Specially abled students are allowed 20 minutes extra for examination.
6) Do not use pencils to darken answer.
7) Use only black/blue ball point pen to darken the appropriate circle.
8) No change will be allowed once the answer is marked on OMR Sheet.
9) Rough work shall not be done on OMR sheet or on question paper.
10) Darken ONLY ONE CIRCLE for each answer.
Q.no 1. CFG is not closed under
A : Kleene
B : Union
C : Complement
D : Concatenation
Q.no 2. If there exists a language L, for which there exists a TM, T, that accepts every word in L
and either rejects or loops for every word that is not in L, is called
A : Recursive
B : Recursively Enumerable
C : NP HARD
D : NP Complete
Q.no 3. Pushdown automata consists of _____
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=1575&code=1052000&showTest=320&actForm=edit&set=1 1/17
12/26/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=1575&code=1052000&showTest=320&actForm=edit&set=1
A : 5 tuples
B : 6 tuples
C : 4 tuples
D : 7 tuples
Q.no 4. Which of the following statement is correct
A : Moore machine and Mealy machine both has five tuples
B : Moore machine has five tuples and Mealy machine has six tuples
C : Moore machine has six tuples and Mealy machine has five tuples
D : Moore machine and Mealy machine both has six tuples
Q.no 5. A problem which is both _______ and _________ is said to be NP complete.
A : P, NP
B : NP, NP hard
C : P, P complete
D : NP Hard,P
Q.no 6. State true or false. Regular Expressions can be used with XML checkpoints
A : TRUE
B : FALSE
C:
D:
Q.no 7. If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to be
____________ under an operation op.
A : Open
B : Closed
C : Decidable
D : Not decidable
Q.no 8. Which of the functions can a turing machine not perform?
A : Copying a string
B : Deleting a symbol
C : Accepting a pal
D : Inserting a symbol
Q.no 9. Which of the following statement is not true?
A : In leftmost derivation always leftmost nonterminal is chosen to obtain next step of derivation
B : In Rightmost derivation always rightmost nonterminal is chosen to obtain next step of derivation
C : In derivation of string any nonterminal is selected to obtain next step of derivation
D : In derivation tree root node is always labelled by starting symbol
Q.no 10. Linear Bounded Automaton is a:
A : Finite Automaton
B : Turing Machine
C : Push down Automaton
D : Deterministic Finite Automata
Q.no 11. The set generated by below given regular expression is ______________________.
A:
B:
C:
D:
Q.no 12. A turing machine operates over:
A : Finite memory tape
B : Infinite memory tape
C : Depends on the algorithm
D : Depends on the input

Q.no 13. Which of the following are not in NP?
A : All problems in P
B : Boolean Satisfiability problems
C : Integer factorization problem
D : None of the mentioned
Q.no 14. The statement A TM can not solve halting problem is
A : TRUE
B : FALSE
C:
D:
Q.no 15. Minimum number of productions required to produce the language given in following
figure is ____.
A:3
B:7
C:5
D:6
Q.no 16. Which of the following statement is CORRECT?
A : A moore machine has no accepting states
B : A moore machine has accepting states
C : A Mealy machine has accepting states
D : Both machine has accepting states
Q.no 17. Is Turing machine is more powerful than Deterministic Finite Automata?
A : TRUE
B : FALSE
C:
D:
Q.no 18. While converting the context free grammar into chomsky normal form, which of the
following is not necessary
A : Elimination of null production
B : Elimination of unit production
C : converting a given grammar to chomsky normal form
D : converting a given grammar to greibach normal form
Q.no 19. Which of the following is correct for Chomsky hierarchy?
A : CSL is less than Unrestricted is less than CFL is less than Regular language
B : Regular language is less than CFL is less than CSL is less than Unrestricted
C : CFL is less than CSL is less than Unrestricted is less than Regular language
D : Regular language is less than CSL is less than CFL is less than Unrestricted
Q.no 20. The transition a Push down automaton makes is additionally dependent upon the:
A : Stack
B : Input tape
C : terminals
D : non terminals
Q.no 21. If the PDA does not stop on an accepting state and the stack is not empty, the string is:
A : rejected
B : goes into loop forever
C : accepted
D : goes into loop and hence rejected
Q.no 22. In Mealy machine the output is depends on
A : Only on current state
B : on both current state and current input
C : Only on current input
D : on all current state, current input and next state
Q.no 23. Which of the following is true for the language?
A : It is not accepted by a Turing Machine
B : It is regular but not context-free
C : It is context-free but not regular
D : It is neither regular nor context-free, but accepted by a Turing machine
Q.no 24. Which of the following problems is solvable ?
A : Writing a universal Turing machine
B : Determining of an arbitrary turing machine is an universal turing machine
C : Determining of a universal turing machine can be written for fewer than k instructions for some k
D : Determining of a universal turing machine and some input will halt
Q.no 25. Turing machine is more powerful than Finite State Machine because
A : Tape movement is confined to one direction
B : It has no finite state
C : It has the capability to remember arbitrarily long sequences of input symbols
D : It has tape symbols
Q.no 26. Which of the functions are not performed by the turing machine after reading a
symbol?
A : Writes the symbol
B : Moves the tape one cell left/right
C : Proceeds with next instruction or halts
D : Push the input in stack
Q.no 27. Fill in the blank with the most appropriate option.
Statement: In theory of computation, abstract machines are often used in ___________ regarding
computability or to analyze the complexity of an algorithm.
A : Thought experiments
B : Principle
C : Hypothesis
D : All of the mentioned
Q.no 28. Which of the following pairs have different expressive power?
A : DFA AND NDFA
B : DPDA AND NPDA
C : Deterministic single tape turing machine and Non-Deterministic single tape turing machine
D : single tape turing machine and multiple tape turing machine
Q.no 29. PDA is more powerful than ____ but less powerful than ________.
A : DFA and NFA
B : Turing machine and DFA
C : DFA and turing machine
D : Mealy machine and DFA
Q.no 30. Which among the following cannot be accepted by a regular grammar?
A : L is a set of numbers divisible by 2
B : L is a set of binary complement
C : L is a set of string with odd number of 0
D : L is a set of 0n1n
Q.no 31. If complement of L1 and complement of L2 are regular languages, then L1 dot L2 will
be
A : Regular
B : Non-regular
C : may be regular
D : may be non-regular
Q.no 32. Consider the given figure .what will be the next ID?
A:
B:
C:
Q.no 33. Describe the language generated by finite state machine given below.
A : Any string of odd number of a's
B : Any string of odd number of b’s
C : Any string of even number of a’s and odd number of b’s
D : Any string of odd number of a’s and odd number of b’s
Q.no 34. Consider the CFG given in following figure.Its equivalent simplified grammar is _____.
A:
B:
C:
D:
Q.no 35. The complexity class P consist of all the decision problems that can be solved by
___________using polynomial amount of computation time.
A : Push Down automata
B : DFA
C : NDFA
D : Deterministic Turing machine
Q.no 36. Simplify the following identity?
A:
B:
C:
D:
Q.no 37. In context to the process of removing useless symbols, which of the following is correct?
A : We remove the Nullable variables
B : We eliminate the unit productions
C : We eliminate products which yield no terminals
D : We eliminate the both unit productions and Nullable variables
Q.no 38. Which of the given problems are NP-complete?
A : Node cover problems
B : Directed Hamilton Circuit Problem
C : Both (a) and (b)
D : Turing Machine
Q.no 39. Consider the language given in following figure, what type of language it is?
A : Context free language
B : Regular language
C : Both CFL and RL

D : non context free language
Q.no 40. Which of the following are not regular ?
A : String of zeros whose length is a perfect square
B : Set of all palindromes made up of zeros and ones
C : Strings of zeros, whose length is a prime number
D : string of even number of zeros
Q.no 41. Which of the following are decidable?

I. Whether the intersection of two regular languages is infinite
II. Whether a given context-free language is regular
III. Whether two push-down automata accept the same language
IV. Whether a given grammar is context-free
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 42. Which of the following pair of regular expressions is not equivalent ?
A:
B:
C:
D:
Q.no 43. Which of the following problems are decidable?
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
Q.no 44. Consider the finite automata and string given in following figure.The set of reachable
states for the given input string is ____________.
A:
B:
C:
D:
Q.no 45. CFG for balanced parenthesis
A:
B:
C:
D:
Q.no 46. Consider the following three regular expressions and two statements shown in below
figure. Choose its correct answer from given options.
A:
B:
C:
D:
Q.no 47. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2s complement of a binary machine"
A:
B:
C:
D:
Q.no 48. Given a NFA with N states, the maximum number of states in an equivalent minimized
DFA is at least
A:
B:
C:
D:
Q.no 49. Let S be an NP-complete problem and Q and R be two other problems not known to be
in NP. Q is polynomial time reducible to S and S is polynomial-time reducible to R. Which one of
the given statements is true?
A : R is NP complete
B : R is NP hard
C : Q is NP complete
D : Q is NP hard
Q.no 50. Which of the following problems is undecidable?
A : Membership problem for CFGs
B : Ambiguity problem for CFGs.
C : Finiteness problem for FSAs.
D : Equivalence problem for FSAs.
Q.no 51. Number of states require to simulate a computer with memory capable of storing 3
words each of length 8.
A:
B:
C:
D:
Q.no 52. What is the output of below given regular expression?
A:
B:
C:
D:
Q.no 53. Which of the following is/are Undecidable?
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
Q.no 54. Two languages L1 and L2 are given in following figure. Which statement is FALSE
about it?
A : L2 is context free
B : L1 intersection L2 is context free
C : Complement of L2 is recursive
D : Complement of L1 is context free but not regular
Q.no 55. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-blank
symbols does not contain any blank symbols B in between. Consider Alphabet a,b.
A:
B:
C:
D:
Q.no 56. Consider the statement given in following figure and describe the language L. L is
________.
A : Decidable and Recursively Enumerable
B : Undecidable but Recursively Enumerable
C : Undecidable and Not Recursively Enumerable
D : Decidable but not Recursively Enumerable
Q.no 57. The problems which have no algorithm, regardless of whether or not they are accepted
by a turing machine that fails to halts on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 58. Consider the CFG given in following figure, Which language is generated by it?
A:
B:
C:
D:
Q.no 59. The language L defined in following figure is ______.
A : Not recursive
B : is recursive and deterministic CFL.
C : Regular language
D : is not a deterministic CFL but a CFL
Q.no 60. A PDA machine configuration (p, w, y) can be correctly represented as:
A : current state, unprocessed input, stack content
B : unprocessed input, stack content, current state
C : current state, stack content, unprocessed input
D : current state, stack content, processed input
12/26/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj
Answer for Question No 1. is c
Answer for Question No 2. is b
Answer for Question No 3. is d
Answer for Question No 5. is a
https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4

Seat No -
Time : 1hr
Max Marks : 50
N.B
Q.no 1. What is the Regular Expression Matching Zero or More Specific Characters
A:
B:
C:
D:
Q.no 2. Consider a language described in following figure. Which regular expression is used to
represent it?
A:
B:
C:
D:
Q.no 3. NFA in its name has non-deterministic because of _____________________
A : The result is undetermined
B : The choice of path is non-deterministic
C : The state to be transited next is non-deterministic
D : The choice of path is deterministic
C : Accepting a pal
Q.no 5. The value of n if turing machine is defined using n-tuples:
A:6
B:7
C:8
D:5
Q.no 6. A language L is subset of alphabet is said to be TDL if there is TM say M which always
halts on every w is element of alphabet if w is element L with an answer YES however if w is not
element of L then M halts with answer NO then that language is known as _____________
A : Context Free Language
B : Turing Acceptable Language
C : Recursively Enumerable Language
D : Turing Decidable Language

Q.no 7. Which of the technique can be used to prove that a language is non regular?
A : The language accepted by finite automata are the languages denoted by regular expressions
B : For every DFA there is a regular expression denoting its language
C : For a regular expression r, there does not exist NFA with L (r )
D : For every regular expression there exist a DFA accepting its language
Q.no 8. The finite automata is called a NFA when there exists __________for a specific input
from current state to next state
A : single path
B : multiple paths
C : only two paths
D : zero path
Q.no 9. A deterministic turing machine is:
A : Ambiguous Turing Machine
B : Unambiguous Turing Machine
C : Non-Deterministic
Q.no 10. A language L is said to be ____________ if there is a turing machine M such that L of M
is equal to L and M halts at every point.
A : Turing acceptable
B : Decidable
C : Undecidable
D : NP HARD
Q.no 12. A PDA chooses the next move based on
A : Current state
B : Next input symbol
C : on stack contents
D : uses all current state ,next input symbol and top of the stack
Q.no 13. Moore machine is an application of
A : Finite Automata without output
B : Finite Automata with output
C:
D:
Q.no 14. Turing machine can be represented using the following tools:
A : Transition graph
B : Transition table
C : Queue and Input tape
Q.no 15. The generators of languages are
A : Regular expressions
B : Finite State Machine
C : Grammars
D : Finite Automata
Q.no 16. Regular expression x or y denotes the set
A : x,y
B:x
C:y
D : xy
Q.no 17. If w belongs to L of G, for some CFG, then w has a parse tree, which defines the
syntactic structure of w. w could be
A : Program
B : SQL query
C : XML document
D : All of these
Q.no 18. consider a Turing machine defined in following figure and state which statemnt is
always true about it.
A:
B:
C:
D:
Q.no 19. A two-way infinite tape turing machine is ________ superior than the basic model of the
turing machine in terms of power.
A : More
B : Less
C : No way
D : Very Much
Q.no 20. Which of the following statement is not true
A : Type 0 grammar is called unrestricted grammar
B : Type 3 grammar is recognized by FA
C : Chomsky hierarchy define only one grammar
D : Type 3 grammar is called as regular grammar

Q.no 22. Which of the following options is correct? Statement 1 Initial State of NFA is Initial
State of DFA. Statement 2 The final state of DFA will be every combination of final state of NFA.
A : Statement 1 is true and Statement 2 is true
B : Statement 1 is true and Statement 2 is false
C : Statement 1 can be true and Statement 2 is true
D : Statement 1 is false and Statement 2 is also false
Q.no 23. Which of the following statements are correct
A : Statement 1 and 2 both are correct
B : Statement 1 is false but 2 is correct
C : Statement 1 and 2 both are false
D : Statement 1 is correct but 2 is false
Q.no 24. With reference to pumping lemma of regular language,answer the following question
A:x
B:y
C:z
D : mod xy
A:
B:
C:
D:
Q.no 26. Consider a CFG given below.Corrsponding CFL is consists of ____________.
A : All length Palindromes
B : Odd length Palindromes
C : Even length Palindromes
D : prime number length palindromes
Q.no 27. What does it mean when we say that an algorithm X is asymptotically more efficient
than Y?
A : X will always be a better choice for small inputs
B : X will always be a better choice for large inputs
C : Y will always be a better choice for small inputs
D : X will always be a better choice for all inputs
Q.no 28. Consider the grammars given in following figure.and select the correct option.
A:4
B:3
C:2
D:1
Q.no 30. For a machine to surpass all the letters of alphabet excluding vowels, how many number
of states in DFA would be required?
A:3
B:2
C : 22
D : 27
Q.no 31. What is the transition function of below mentioned machine
A:
B:
C:
D:

Q.no 33. Consider a language given in following figure.CFG used to produce given language is
_____.
A:
B:
C:
D:
Q.no 34. Which of the following is a P-complete type of problem?
A : Circuit Value problem
B : Linear programming
C : Context free grammar membership
Q.no 35. State true or false: Statement: Pumping lemma gives a necessary but not sufficient
condition for a language to be regular.
A : TRUE
B : FALSE
C:
D:
A : rejected
C : accepted
A:
B:
C:
D:
Q.no 38. Which of the following statements is False?
A : For every non-deterministic Turing machine, there exists an equivalent deterministic Turing
machine.
B : Turing recognizable languages are closed under union and complementation.
C : Turing decidable languages are closed under intersection

and complementation.
D : Turing recognizable languages are closed under union and intersection.
Q.no 39. Which of the following statement is not CORRECT?
A : For non deterministic PDA, equivalence is undecidable
B : For deterministic PDA, equivalence is decidable
C : For deterministic PDA, equivalence is undecidable.
D : For non deterministic PDA, equivalence is decidable
Q.no 40. Consider the CFG given in following figure. Which of the production is useless
production among it.
A:
B:
C:
D:
A:
B:
C:
D:
Q.no 42. Consider the mealy machine shown in following figure,what is the output generated by
it?
A : Reverse of a number
B : 1s complement
C : 2s complement
D : 10s complement
Q.no 43. Given regular expression is correctly represented as __________
A:
B:
C:
D:
Q.no 44. Nobody knows yet if P is equal to NP. Consider the language L defined as in image,
Which of the following statements is true ?

A : L is recursive
B : L is recursively enumerable but not recursive
C : L is not recursively enumerable
D : Whether L is recursive or not will be known after we find out if P is equal to NP
Q.no 45. Which Transition table of Turing Machine is correct to check well formedness of
parentheses
A:
B:
C:
D:
Q.no 46. consider the problem X given in following figure. And describe about it.
A : X is decidable
B : X is undecidable but partially decidable
C : X is undecidable and not even partially decidable
D : X is not a decision problem
A:
B:
C:
D:
A:
B:
C:
D:
about it?
Q.no 51. what is the answer of the question descried in following figure.
A:6
B:4
C:2
D:8
DFA is at least
A:
B:
C:
D:
Q.no 54. A single tape Turing Machine M has two states q0 and q1, of which q0 is the starting
state. The tape alphabet of M is (0, 1, B) and its input alphabet is 0, 1. The symbol B is the blank
symbol used to indicate end of an input string. The transition function of M is described in the
shown table.
The table is interpreted as:
The entry (q1, 1, R) in row q0 and column 1 signifies that if M is in state q0 and reads 1 on the
current tape square, then it writes 1 on the same tape square, moves its tape head one position to
the right and transitions to state q1.
Which of the following statements is true about M ?
A : M does not halt on any string in (0 + 1)+
B : M does not halt on any string in (00 + 1)*
C : M halts on all string ending in a 0
D : M halts on all string ending in a 1


A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 56. Consider the CFG given below,how many variables are reachable from starting symbol
in it.
A:0
B:1
C:2
D:3
Q.no 57. Consider the CFG and statements about it as shown in following figure.Which of the
statement is true about G among it
A : a, b, c all are true
B : Only a and b are true
C : Only b and c are true
D : Only a is true
A:
B:
C:
D:
Q.no 59. Consider the CFG given in following figure. Which sring is generated by it?
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
Q.no 60. Consider the grammar given in following figure, which regular expression it represents?
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
Q.no 1. Which of the following data structure is used in design of post machine
A : Stack
B : Array
C : Queue
D : Linked list
Q.no 2. Non deterministic finite automata to deterministic finite automata conversion is done via
A : Subset Construction method
B : Warshalls Algorithm
C : Ardens theorem
D : Prims Algorithm

B : Decidable
C : Undecidable
D : NP HARD
Q.no 4. Those problems that are solvable in polynomial time__
A : NP
B:P
C : Hard
D : Complete
Q.no 5. Which of the following is not a regular expression?
A:
B:
C:
D:
C:
D:
A : Kleene
B : Union
C : Complement
D : Concatenation
Q.no 8. Finite-state acceptors for the nested words can be:
A : nested word automata
B : push down automata
C : ndfa
D : ndpda
Q.no 9. Transition function of non deterministic finite automata is
A:
B:
C:
D:
Q.no 11. Consider the following figure and choose the correct answer from given below
A : star Production
B : Null Production
C : empty Production
D : useless production
Q.no 12. State whether following statement is true or false
A : TRUE
B : FALSE
C:
D:
A : single path
B : multiple paths
C : only two paths
D : zero path
Q.no 14. Which among the following is incorrect with reference to a derivation tree?
A : Every vertex has a label which is a terminal or a variable.
B : The root has a label which can be a terminal.
C : The label of the internal vertex is a variable.
D : Terminal node has a lable which can be a terminal
Q.no 15. If there exist more than on parse tree for the same string from the given grammar then
that grammar is said to be _______________
A : Recursive Grammar
B : Linear Grammar
C : Regular grammar
D : ambiguous grammar
Q.no 16. A turing machine with several tapes in known as:
A : Multi-tape turing machine
B : Poly tape turing maching
C : Universal turing machine
D : Complete turing machine
Q.no 17. Those problems require large amount of computational resources that practically not
feasible to solve these problems, are known as _________
A : Decidable
B : Undecidable
C : Tractable
D : Intractable
Q.no 18. In accordance to pumping lemma theorem of regular language, Complete the sentence
described in following figure.
A : i is greater than 0
B : i is less than 0
C : i is less than or equal to 0
D : i is greater than or equal to 0
Q.no 19. Decidable can be taken as a synonym to:
A : Recursive
B : Non Recursive
C : Recognizable
D : Non Recognizable
Q.no 20. Regular Grammar is a _______________
A : Type 3 grammar
B : Type 2 grammar
C : Type 1 grammar
D : Type 0 grammar
Q.no 21. Consider the statement given in following figure and select the option which is true.
A : NP complete is equal to NP
B:
C : NP hard is equal to NP
D : P is equal to NP complete
Q.no 22. Which term belong in intersection of the diagram
A : NP
B:P
C : NP Hard
D : NP Complete
Q.no 23. What is the result of following union operation.
A:L
B : L'
C:f
D : empty
A:x
B:y
C:z
D : mod xy
Q.no 27. X is a simple mathematical model of a computer. X has unrestricted and unlimited
memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell
holding one symbol.
Name X?
A : Push Down Automata
B : Non deterministic Finite Automata
C : Turing machines
Q.no 29. Which of the following is not an application of Pumping Lemma?
A:
B:
C:
D:
Q.no 30. The construction time for DFA from an equivalent NFA (m number of node)is:
A:
B:
C:
D:
symbol?
Q.no 32. Which of the following one can relate to the given statement: Statement: If n items are
put into m containers, with n>m, then atleast one container must contain more than one item
A : Pumping lemma of regular language
B : Pigeon Hole principle
C : Count principle
D : Pumping lemma of context free language
Q.no 34. If there exists a TM which when applied to any problem in the class, terminates, if
correct answer is yes and may or may not terminate otherwise is called
A : Stable
B : Unsolvable
C : Partially solvable
D : Unstable
Q.no 35. Two finite states are equivalent if
A : Both are final states
B : Both are non final states
C : one is final state and one is non final state
D : either both are final states or both are non final states
Q.no 36. Languge described in following figure is _______________
A : Regular language
B : Non Regular language
C : Both regular and non regular
D : neighter a regular nor a nonregular language
A : mod z
B : mod y
C : mod x
D:n
A:
B:
C:
D:
D : Only a is true
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
Q.no 43. The languages L1 and L2 are defined in following figure. Intersection of L1 and L2 is
A : Not recursive
B : Regular
C : Context free but not regular
D : Recursively enumerable but not context free
A:
B:
C:
D:
about it?
Q.no 46. Consider the regular expression given in following figure, find its equivalent regular
expression.
A:
B:
C:
D:
A:
B:
C:
D:

A : I and II
B : I and IV
C : II and III
D : II and IV
shown table.
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A:
B:
C:
D:
A:
B:
C:
D:
Q.no 53. Which of the following regular expression resembles the given diagram?
A:
B:
C:
D:
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
Q.no 55. Consider a regular language described in following figure. Which regular expression is
used to represent it?
A:
B:
C:
D:
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
________.
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
Q.no 1. Regular Expression R and the language it describes can be represented as
A : L(R), R(L)
B : R, L( R )
C : R,L
D : L ( R) , L
A:
B:
C:
D:
A : TRUE
B : FALSE
C:
D:
A : star Production
B : Null Production
Q.no 5. A CFG consist of ____tuples
A:5
B:4
C:3
D:6
Q.no 8. Finite state machine with output capability can be used to add two given integer in
binary representation.
A : TRUE
B : FALSE
C:
D:
Q.no 9. Which type of grammar is given in following figure?
A : Left Linear Grammar
B : Right Linear Grammar
C : Both right linear as well as left linear
D : Non Linear Grammar
Q.no 11. Which kind of proof is used to prove the regularity of a language?
A : Proof by contradiction
B : Direct proof
C : Proof by induction
D : Proof by analogy
A : Stack
B : Input tape
C : terminals
D : non terminals
Q.no 14. The output alphabet can be represented as
A:
B:
C:
D:
A : More
B : Less
C : No way
D : Very Much
Q.no 18. Mealy and Moore machines are also called
A : Turing machines
B : Transducer
C : Linear bounded automata
D : both turing machine and linear bounded automata
B : Decidable
C : Undecidable
D : NP HARD
Q.no 20. Which of the following can be used to simulate any turing machine?
A : Finite State Automaton
B : Universal Turing Machine
C : Counter machines
Q.no 21. Which among the following is not true for 2-way infinte TM?
A : Tape in both directions
B : Leftmost square not distinguished
C : Any computation that can be performed by 2way infinite tape can also be performed by standard
TM.
D : Tape is only in one directions
Q.no 23. With refernce to given diagram ,Which of the statements are false?
A : 1 and 3 only
B : 2 and 4 only
C : 2 and 3 only
D : 3 and 4 only
Q.no 24. While converting the context free grammar into Greibach normal form, which of the
following is necessary
C : Elimination of Left recursion
D : converting a given grammar to chomsky normal form

Q.no 25. The ability for a system of instructions to simulate a Turing Machine is called
_________
A : Turing Completeness
B : Simulation
C : Turing Halting
D : Computability
A:
B:
C:
D:
Q.no 29. Which of the following is not a Non deterministic turing machine?
A : Alternating Turing Machine
B : Probabalistic Turing Machine
C : Read-only turing Machine
D : Unsolvable
Q.no 30. Which of the following statement is correct for a concept called inherent ambiguity in
CFL?
A : Every CFG for L is ambiguous
B : Every CFG for L is unambiguous
C : Every CFG is also regular
D : Every CFG for L is non regular
A : NP
B:P
C : NP Hard
D : NP Complete
D : Turing Machine
holding one symbol.
Name X?
C : Turing machines
A:x
B:y
C:z
D : mod xy
A:
B:
C:
D:
A:
B:
C:
Q.no 38. Hamilton Circuit problem is a special case of ____________
A : Travelling Salesman Problem
B : Halting Problem
C : Hitting Set
D : Prims Algorithm
A : DFA and NFA
A : DFA AND NDFA
B : DPDA AND NPDA
A:
B:
C:
D:
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
A : X is decidable
DFA is at least
A:
B:
C:
D:
A:
B:
C:
D:
A : Not recursive

A:
B:
C:
D:
parentheses
A:
B:
C:
D:
A : Not recursive
B : Regular

represent it?
A:
B:
C:
D:
A:
B:
C:
D:
A : L is recursive
in it.
A:0
B:1
C:2
D:3
A:
B:
C:
D:
D : Only a is true
it?
B : 1s complement
C : 2s complement
D : 10s complement
A:
B:
C:
D:
A:6
B:4
C:2
D:8

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : Decidable
B : Undecidable
C : Tractable
D : Intractable
Q.no 3. __________ is the graphical representation of a grammar.
A : Binary tree
B : Red black tree
C : Parse tree
D : Binary search tree
A : L(R), R(L)
B : R, L( R )
C : R,L
D : L ( R) , L
A : Current state
A : Type 3 grammar
B : Type 2 grammar
C : Type 1 grammar
D : Type 0 grammar
A : 5 tuples
B : 6 tuples
C : 4 tuples
D : 7 tuples
Q.no 9. Transition function of Turing Machine is
A:
B:
C:
D:
figure is ____.
A:3
B:7
C:5
D:6
A:6
B:7
C:8
D:5
A : TRUE
B : FALSE
C:
D:
C:
D:
Q.no 17. Context free grammar is called Type 2 grammar because of ______________ hierarchy.
A : Chomsky
B : Greibach
C : Arden's
D : Backus
Q.no 19. Which of the following are the actions that operates on stack top?
A : Pushing
B : Popping
C : Replacing
D : All three actions are possible

B : Halting Problem
C : Hitting Set
D : Prims Algorithm
B : DFA
C : NDFA
A : 1 and 3 only
B : 2 and 4 only
C : 2 and 3 only
D : 3 and 4 only
A:L
B : L'
C:f
D : empty
Q.no 28. Statement 1: Ambiguity is the property of grammar but not the language.
Statement 2: Same language can have more than one grammar.
Which of the following options are correct with respect to the given statements?
A : Statement 1 is true but statement 2 is false
B : Statement 1 is false but statement 2 is true
C : Both the statements are true
D : Both the statements are false
Q.no 30. CFG for following regular expression is ____.
A:
B:
C:
D:
A:
B:
C:
D:
A:4
B:3
C:2
D:1
be
A : Regular
B : Non-regular
C : may be regular
A:
B:
C:
D:
A:x
B:y
C:z
D : mod xy
A : NP
B:P
C : NP Hard
D : NP Complete

TM.
Q.no 38. In Moore machine the output is depends on
A:
B:
C:
D:
D : Unsolvable
A:6
B:4
C:2
D:8
A : X is decidable
A:
B:
C:
D:
A:
B:
C:
D:
expression.
A:
B:
C:
D:
A:
B:
C:
D:
A : L is recursive
Q.no 48. Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2
is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
D : P3 is decidable if P3 is reducible to P2’s complement
Q.no 49. Find out which minimal DFA accepts same language as accepted by DFA D shown in
figure
A:
B:
C:
D:
A:
B:
C:
D:

A : I and II
B : I and IV
C : II and III
D : II and IV
A : Not recursive
B : Regular
in it.
A:0
B:1
C:2
D:3
A : Not recursive
it?
B : 1s complement
C : 2s complement
D : 10s complement
A:
B:
C:
D:
B : R is NP hard
D : Q is NP hard
shown table.
A:
B:
C:
D:
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
C:
D:
Q.no 2. While applying Pumping lemma over a language, we consider a string w that belong to L
and fragment it into _________ parts.
A:2
B:5
C:3
D:6
Q.no 3. Which of the following data structure is used in design of push down automata
A : Stack
B : Array
C : Queue
D : Linked list
Q.no 4. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
B : Turing Machine

B : Decidable
C : Undecidable
D : NP HARD
represent it?
A:
B:
C:
D:
A : Ardens theorem
B : Ogden’s Lemma
C : Pumping Lemma
D : Jordens theorem
A:6
B:7
C:8
D:5
Q.no 11. Turing Machine also behave like General purpose computer and that TM is known as
_______
A : TRUE
B : FALSE
C:
D:
A : TRUE
B : FALSE
C:
D:
A : Stack
B : Input tape
C : terminals
D : non terminals
A : TRUE
B : FALSE
C:
D:
B : DFA
C : NDFA
Q.no 22. Complete the statement given in following figure to make it true with reference to CFG.
A : Left Recursive Grammar
B : Non Recursive Grammar
C : Right Recursive Grammar
D : Right Linear Grammar
Q.no 23. Consider the given alphabet and regular expression R. What type of language it
represents?
A:
B:
C:
D:
TM.
A : rejected
C : accepted
A:
B:
C:
B : Halting Problem
C : Hitting Set
D : Prims Algorithm
holding one symbol.
Name X?
C : Turing machines
A:
B:
C:
D:
Q.no 33. How many states are required to design a deterministic finite automata which accept
strings that end with bb.
A:4
B:3
C:2
D:1
symbol?

A:
B:
C:
D:
A:3
B:2
C : 22
D : 27
A:
B:
C:
D:
CFL?
C : Both CFL and RL
A : Stable
B : Unsolvable
D : Unstable
A:
B:
C:
D:
A:
B:
C:
D:
A : L is recursive
expression.
A:
B:
C:
D:
A:
B:
C:
D:
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
in it.
A:0
B:1
C:2
D:3
B : R is NP hard
D : Q is NP hard
A:
B:
C:
D:
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
figure
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A : Not recursive
B : Regular
A:
B:
C:
D:
shown table.
A:
B:
C:
D:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : Current state
A:5
B:4
C:3
D:6
Q.no 3. Which of the following case does not exist in complexity theory?
A : Best case
B : Worst case
C : Average case
D : Null case
A : Pushing
B : Popping
C : Replacing
A : More
B : Less
C : No way
D : Very Much
A : TRUE
B : FALSE
C:
D:
C : Accepting a pal
A : Recursive
C : NP HARD
D : NP Complete
A : star Production
B : Null Production
Q.no 12. The language accepted by Push down Automaton:
A : Recursive Language
B : Context free language
C : Linearly Bounded language
D : Non context free language
A:
B:
C:
D:
A : Program
B : SQL query
C : XML document
D : All of these
figure is ____.
A:3
B:7
C:5
D:6
Q.no 18. If T1 and T2 are two turing machines. The composite can be represented using the
expression:
A : T1T2
B : T2T1
C : T1 X T2
D : T2T2T1
Q.no 19. A context free grammar is a ___________
A : English Grammar
B : Regular Grammar
C : Context Sensitive Grammar
D : Left Linear Grammar
A:6
B:7
C:8
D:5
A:
B:
C:
D:
symbol?
A : DFA AND NDFA
B : DPDA AND NPDA
A : rejected
C : accepted
_____.
A:
B:
C:
D:
A:3
B:2
C : 22
D : 27
Q.no 30. How many strings can be generated as described in following figure.
A : 35
B : 49
C : 360
D : 720
than Y?
B:
A : Stable
B : Unsolvable
D : Unstable
A : TRUE
B : FALSE
C:
D:
be
A : Regular
B : Non-regular
C : may be regular
represents?
A:
B:
C:
D:
A : 1 and 3 only
B : 2 and 4 only
C : 2 and 3 only
D : 3 and 4 only
A:L
B : L'
C:f
D : empty
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
A:
B:
C:
D:
D : Only a is true
it?
B : 1s complement
C : 2s complement
D : 10s complement
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
shown table.
parentheses
A:
B:
C:
D:
represent it?
A:
B:
C:
D:
A:
B:
C:
D:
expression.
A:
B:
C:
D:
A : L is recursive
A : Not recursive
B : Regular
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : More
B : Less
C : No way
D : Very Much
Q.no 3. A formal language is recursive if :
A : A total turing machine exists
B : A turing machine that halts for every input
C : Turing machine rejects if the input does not belong to the language
A : Recursive
B : Non Recursive
C : Recognizable
C : Grammars
D : Finite Automata
C : Accepting a pal
A : Binary tree
B : Red black tree
C : Parse tree
A : Recursive
C : NP HARD
D : NP Complete
A : x,y
B:x
C:y
D : xy
Q.no 11. The language accepted by a turing machine is called ____________
A : Recursive Ennumerable
B : Recursive
D : PDA
A : Open
B : Closed
C : Decidable
D : Not decidable
Q.no 14. Which of the following conversion is not feasible?
A : Regular expression to automaton conversion
B : Automaton to Regular Expression Conversion
C : NFA to DFA
D : Regular expression to FA with output conversion
A:
B:
C:
D:
A : Chomsky
B : Greibach
C : Arden's
D : Backus
represent it?
A:
B:
C:
D:
Q.no 19. Regular expressions are closed under___________
A : Intersection
B : Union
C : Kleene star
D : ALL
A : P, NP
B : NP, NP hard
C : P, P complete
D : NP Hard,P
symbol?
A:x
B:y
C:z
D : mod xy

A : Stable
B : Unsolvable
D : Unstable
A:
B:
C:
D:
C : Both CFL and RL
B:
A:
B:
C:
D:
A:
B:
C:
D:
Q.no 34. Which of the following is analogous to NFA and NPDA

A : Regular language and Context Free language
B : Regular language and Context Sensitive language
C : Context free language and Context Sensitive language
D : Non Regular language and Non Context Free language
B : DFA
C : NDFA
D : Turing Machine
A : 35
B : 49
C : 360
D : 720
B : Halting Problem
C : Hitting Set
D : Prims Algorithm
A:
B:
C:
D:
A:
B:
C:
D:
it?
B : 1s complement
C : 2s complement
D : 10s complement
D : Only a is true

A : I and II
B : I and IV
C : II and III
D : II and IV
A:
B:
C:
D:
A : X is decidable

A:
B:
C:
D:
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A:
B:
C:
D:
in it.
A:0
B:1
C:2
D:3
represent it?
A:
B:
C:
D:
expression.
A:
B:
C:
D:
A : Not recursive
about it?
________.
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
represent it?
A:
B:
C:
D:
B : Direct proof
B : Recursive
D : PDA

A : Open
B : Closed
C : Decidable
D : Not decidable
A:
B:
C:
D:
A : TRUE
B : FALSE
C:
D:
A : Binary tree
B : Red black tree
C : Parse tree
C : ndfa
D : ndpda
A : More
B : Less
C : No way
D : Very Much
Q.no 15. Which of the following can be used to simulate any turing machine?
A : Finite State Automaton
B : Universal Turing Machine
C : Counter machines
A:
B:
C:
D:
A : English Grammar
B : Regular Grammar
A : Program
B : SQL query
C : XML document
D : All of these
A : TRUE
B : FALSE
C:
D:

represents?
A:
B:
C:
D:
A:
B:
C:
D:
_____.
A:
B:
C:
D:
A:
B:
C:
D:
A:4
B:3
C:2
D:1
B : Principle
C : Hypothesis
Q.no 33. The travelling salesman problem can be solved using _________
A : A spanning tree
B : A minimum spanning tree
C : Bellman Ford algorithm
D : DFS traversal
_________
B : Simulation
C : Turing Halting
D : Computability
A:3
B:2
C : 22
D : 27
A:
B:
C:
D:
than Y?

A : rejected
C : accepted
symbol?
A:6
B:4
C:2
D:8
A:
B:
C:
D:
A : Not recursive
B : Regular
in it.
A:0
B:1
C:2
D:3
about it?
expression.
A:
B:
C:
D:
shown table.
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A:
B:
C:
D:
DFA is at least
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
B : R is NP hard
D : Q is NP hard
D : Only a is true
A : X is decidable
A:
B:
C:
D:
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
A : Not recursive

Seat No -
Time : 1hr
Max Marks : 50
N.B
C : ndfa
D : ndpda
A:5
B:4
C:3
D:6
A : Best case
B : Worst case
C : Average case
D : Null case
A : TRUE
B : FALSE
C:
D:
A:
B:
C:
D:

C : Grammars
D : Finite Automata
B : Linear Grammar
C : Regular grammar
Q.no 11. Which Grammar can be translated to deterministic finite automata
C : Context free grammar
D : Generic grammar
A : Kleene
B : Union
C : Complement
D : Concatenation
A:
B:
C:
D:
A : TRUE
B : FALSE
C:
D:
A : Ardens theorem
B : Ogden’s Lemma
C : Pumping Lemma
D : Jordens theorem
A:
B:
C:
D:
C : NFA to DFA
A : L(R), R(L)
B : R, L( R )
C : R,L
D : L ( R) , L
represents?
A:
B:
C:
D:
than Y?
C : Both CFL and RL
A : mod z
B : mod y
C : mod x
D:n
A:
B:
C:
D:
A:
B:
C:
D:
CFL?
A : DFA AND NDFA
B : DPDA AND NPDA
A : NP
B:P
C : NP Hard
D : NP Complete
A:4
B:3
C:2
D:1
machine.

A:L
B : L'
C:f
D : empty
A:3
B:2
C : 22
D : 27
_________
B : Simulation
C : Turing Halting
D : Computability
A:
B:
C:
D:
A:
B:
C:
D:
A:6
B:4
C:2
D:8
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
shown table.

A:
B:
C:
D:
A:
B:
C:
D:
A : Not recursive
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A : X is decidable
DFA is at least
A:
B:
C:
D:
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
B : R is NP hard
D : Q is NP hard
parentheses
A:
B:
C:
D:
A:
B:
C:
D:
A : L is recursive

Seat No -
Time : 1hr
Max Marks : 50
N.B
B : Recursive
D : PDA
Q.no 2. Which of the following is a simulator for non deterministic automata?
A : Gedit
B : JFLAP
C : FAUTO
D : grep
A : Best case
B : Worst case
C : Average case
D : Null case
B : Turing Machine
A : Recursive
C : NP HARD
D : NP Complete
A : Intersection
B : Union
C : Kleene star
D : ALL
B : Direct proof
Q.no 8. An algorithm is called efficient if it runs in ____________ time on a serial computer.
A : Polynomial
B : Non polynomial
C : Logarithmic
D : Non Logarithmic
A:
B:
C:
D:
A : Type 3 grammar
B : Type 2 grammar
C : Type 1 grammar
D : Type 0 grammar
A : Decidable
B : Undecidable
C : Tractable
D : Intractable
A : TRUE
B : FALSE
C:
D:
A : Binary tree
B : Red black tree
C : Parse tree
A : single path
B : multiple paths
C : only two paths
D : zero path
figure is ____.
A:3
B:7
C:5
D:6
A : L(R), R(L)
B : R, L( R )
C : R,L
D : L ( R) , L
D : Generic grammar
A : mod z
B : mod y
C : mod x
D:n
A:4
B:3
C:2
D:1
A : DFA and NFA
A:x
B:y
C:z
D : mod xy
_____.
A:
B:
C:
D:
be
A : Regular
B : Non-regular
C : may be regular
A : NP
B:P
C : NP Hard
D : NP Complete
A : rejected
C : accepted
A:3
B:2
C : 22
D : 27
A : DFA AND NDFA
B : DPDA AND NPDA
than Y?
A:
B:
C:
D:
A:
B:
C:
D:
A:L
B : L'
C:f
D : empty
D : Turing Machine
A : X is decidable
A:
B:
C:
D:

A : I and II
B : I and IV
C : II and III
D : II and IV
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A : Not recursive
B : Regular
about it?
A:
B:
C:
D:
represent it?
A:
B:
C:
D:
A:
B:
C:
D:
in it.
A:0
B:1
C:2
D:3
parentheses
A:
B:
C:
D:
figure
A:
B:
C:
D:
B : R is NP hard
D : Q is NP hard
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
A:
B:
C:
D:
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
expression:
A : T1T2
B : T2T1
C : T1 X T2
D : T2T2T1
Q.no 3. consider a Turing machine defined in following figure and state which statemnt is always
true about it.
A:
B:
C:
D:
Q.no 4. If w belongs to L of G, for some CFG, then w has a parse tree, which defines the syntactic
structure of w. w could be
A : Program
B : SQL query
C : XML document
D : All of these
A : English Grammar
B : Regular Grammar

C : Accepting a pal
A : Polynomial
B : Non polynomial
C : Logarithmic
D : Non Logarithmic
A : TRUE
B : FALSE
C:
D:
A:
B:
C:
D:
A : L(R), R(L)
B : R, L( R )
C : R,L
D : L ( R) , L
A : More
B : Less
C : No way
D : Very Much
B : Decidable
C : Undecidable
D : NP HARD
B : Recursive
D : PDA
Q.no 15. Following language is represented by ______regular expression.
A:
B:
C:
D:
A : star Production
B : Null Production
A : Open
B : Closed
C : Decidable
D : Not decidable
A : P, NP
B : NP, NP hard
C : P, P complete
D : NP Hard,P
Q.no 19. Finite automata needs minimum ________number of stacks
A:0
B:1
C:2
D:3
A:6
B:7
C:8
D:5
symbol?
_____.
A:
B:
C:
D:
A:
B:
C:
D:
CFL?
A : 35
B : 49
C : 360
D : 720
A:
B:
C:
D:
A:L
B : L'
C:f
D : empty
A : A spanning tree
D : DFS traversal
C : Both CFL and RL
A:
B:
C:
B : Principle
C : Hypothesis
in it.
A:0
B:1
C:2
D:3
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
parentheses
A:
B:
C:
D:
expression.
A:
B:
C:
D:
about it?
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
represent it?
A:
B:
C:
D:
B : R is NP hard
D : Q is NP hard
shown table.

A : X is decidable
A : Not recursive
B : Regular
A:
B:
C:
D:
A : Not recursive
it?
B : 1s complement
C : 2s complement
D : 10s complement

Seat No -
Time : 1hr
Max Marks : 50
N.B
B : Recursive
D : PDA
B : Turing Machine
B : Direct proof
A : Intersection
B : Union
C : Kleene star
D : ALL

B : Decidable
C : Undecidable
D : NP HARD
C : Accepting a pal
A:
B:
C:
D:
A : Turing machines
B : Transducer
A : star Production
B : Null Production
C : Grammars
D : Finite Automata
A:
B:
C:
D:
A : English Grammar
B : Regular Grammar
Q.no 19. consider a Turing machine defined in following figure and state which statemnt is
always true about it.
A:
B:
C:
D:
represent it?
A:
B:
C:
D:
A : 35
B : 49
C : 360
D : 720
C : Both CFL and RL
TM.
_____.
A:
B:
C:
D:
A:
B:
C:
D:
be
A : Regular
B : Non-regular
C : may be regular
A:L
B : L'
C:f
D : empty
A:3
B:2
C : 22
D : 27
B : DFA
C : NDFA

A:
B:
C:
D:
A : A spanning tree
D : DFS traversal
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A:
B:
C:
D:
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
figure
A:
B:
C:
D:
A:
B:
C:
D:

A : I and II
B : I and IV
C : II and III
D : II and IV
DFA is at least
A:
B:
C:
D:
it?
B : 1s complement
C : 2s complement
D : 10s complement
A:
B:
C:
D:
A : X is decidable
shown table.
A:
B:
C:
D:
in it.
A:0
B:1
C:2
D:3
A : Not recursive
A:6
B:4
C:2
D:8
A : Not recursive
B : Regular

about it?

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : Recursive
B : Non Recursive
C : Recognizable
A : TRUE
B : FALSE
C:
D:
C:
D:
A : L(R), R(L)
B : R, L( R )
C : R,L
D : L ( R) , L
A : Type 3 grammar
B : Type 2 grammar
C : Type 1 grammar
D : Type 0 grammar
A:
B:
C:
D:
A : Turing machines
B : Transducer
A:
B:
C:
D:
C : ndfa
D : ndpda
A : English Grammar
B : Regular Grammar
A:
B:
C:
D:
A : Ardens theorem
B : Ogden’s Lemma
C : Pumping Lemma
D : Jordens theorem
expression:
A : T1T2
B : T2T1
C : T1 X T2
D : T2T2T1
A : Chomsky
B : Greibach
C : Arden's
D : Backus
A : Stack
B : Array
C : Queue
D : Linked list
A:
B:
C:
D:
A:
B:
C:
A:4
B:3
C:2
D:1
A : TRUE
B : FALSE
C:
D:
A:x
B:y
C:z
D : mod xy
A:L
B : L'
C:f
D : empty
A : A spanning tree
D : DFS traversal
C : Both CFL and RL
A:3
B:2
C : 22
D : 27
C : Count principle
A:
B:
C:
D:
A:
B:
C:
D:
A : 1 and 3 only
B : 2 and 4 only
C : 2 and 3 only
D : 3 and 4 only

A:
B:
C:
D:
A:
B:
C:
D:
A : NP
B:P
C : NP Hard
D : NP Complete
it?
B : 1s complement
C : 2s complement
D : 10s complement
A : Not recursive
B : Regular
A:
B:
C:
D:
A:
B:
C:
D:
A : Not recursive
DFA is at least
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A : X is decidable
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
A:
B:
C:
D:
B : R is NP hard
D : Q is NP hard
A:
B:
C:
D:
shown table.
D : Only a is true
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : P, NP
B : NP, NP hard
C : P, P complete
D : NP Hard,P
A : Polynomial
B : Non polynomial
C : Logarithmic
D : Non Logarithmic
A : Stack
B : Array
C : Queue
D : Linked list
C : Accepting a pal
A : Recursive
B : Non Recursive
C : Recognizable
A:
B:
C:
D:
A : Pushing
B : Popping
C : Replacing
A:
B:
C:
D:
A : TRUE
B : FALSE
C:
D:
C : NFA to DFA
A : single path
B : multiple paths
C : only two paths
D : zero path
Q.no 17. While applying Pumping lemma over a language, we consider a string w that belong to
L and fragment it into _________ parts.
A:2
B:5
C:3
D:6
A : Turing machines
B : Transducer
A : Ardens theorem
B : Ogden’s Lemma
C : Pumping Lemma
D : Jordens theorem
A:6
B:7
C:8
D:5
A : DFA AND NDFA
B : DPDA AND NPDA
C : Both CFL and RL
A:
B:
C:
A:4
B:3
C:2
D:1
than Y?

be
A : Regular
B : Non-regular
C : may be regular
A : rejected
C : accepted
A : 1 and 3 only
B : 2 and 4 only
C : 2 and 3 only
D : 3 and 4 only
B : DFA
C : NDFA
D : Turing Machine

A : DFA and NFA
B : Halting Problem
C : Hitting Set
D : Prims Algorithm
D : Only a is true
A:
B:
C:
D:
A:
B:
C:
D:
A : Not recursive
B : Regular
parentheses
A:
B:
C:
D:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4

A : I and II
B : I and IV
C : II and III
D : II and IV
in it.
A:0
B:1
C:2
D:3
A:
B:
C:
D:
A:6
B:4
C:2
D:8
A:
B:
C:
D:
A:
B:
C:
D:
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A:
B:
C:
D:
A : L is recursive
A:
B:
C:
D:
it?
B : 1s complement
C : 2s complement
D : 10s complement

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : Type 3 grammar
B : Type 2 grammar
C : Type 1 grammar
D : Type 0 grammar
C:
D:
A : TRUE
B : FALSE
C:
D:
A : TRUE
B : FALSE
C:
D:
B : Direct proof
A:
B:
C:
D:
D : Generic grammar
B : Linear Grammar
C : Regular grammar
A : Kleene
B : Union
C : Complement
D : Concatenation
expression:
A : T1T2
B : T2T1
C : T1 X T2
D : T2T2T1
A : Polynomial
B : Non polynomial
C : Logarithmic
D : Non Logarithmic
A:
B:
C:
D:
A:
B:
C:
D:
A : Pushing
B : Popping
C : Replacing
A : Stack
B : Array
C : Queue
D : Linked list
TM.
A : 35
B : 49
C : 360
D : 720
A:4
B:3
C:2
D:1
A:3
B:2
C : 22
D : 27
B : Principle
C : Hypothesis
CFL?
_____.
A:
B:
C:
D:

A : NP
B:P
C : NP Hard
D : NP Complete
A:
B:
C:
D:
A:
B:
C:
D:
shown table.

A:6
B:4
C:2
D:8
________.
A : X is decidable

parentheses
A:
B:
C:
D:
about it?
A:
B:
C:
D:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A:
B:
C:
D:
DFA is at least
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A : Not recursive
B : Regular
A:
B:
C:
D:
figure
A:
B:
C:
D:
in it.
A:0
B:1
C:2
D:3

A : I and II
B : I and IV
C : II and III
D : II and IV
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : star Production
B : Null Production
C : Grammars
D : Finite Automata
A : single path
B : multiple paths
C : only two paths
D : zero path
A : Gedit
B : JFLAP
C : FAUTO
D : grep
B : Linear Grammar
C : Regular grammar
A : TRUE
B : FALSE
C:
D:
A : Binary tree
B : Red black tree
C : Parse tree
A : More
B : Less
C : No way
D : Very Much
A : TRUE
B : FALSE
C:
D:
A : TRUE
B : FALSE
C:
D:
Q.no 16. Complete the statement given in following figure with reference to definiton of CFG.
A:V
B:T
C:
D:

A:
B:
C:
D:
Q.no 19. A problem is called __________ if its has an efficient algorithm for itself.
A : Tractable
B : Intractable
C : Computational
D : Computable
B : Direct proof
A:x
B:y
C:z
D : mod xy
A:3
B:2
C : 22
D : 27
machine.

A:
B:
C:
D:
A : Stable
B : Unsolvable
D : Unstable
A:
B:
C:
A : rejected
C : accepted
A : NP
B:P
C : NP Hard
D : NP Complete
A : A spanning tree
D : DFS traversal
holding one symbol.
Name X?
C : Turing machines
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
figure
A:
B:
C:
D:
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
DFA is at least
A:
B:
C:
D:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A : Not recursive
B : Regular
A:
B:
C:
D:
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A:
B:
C:
D:
expression.
A:
B:
C:
D:
A : Not recursive
A:
B:
C:
D:
in it.
A:0
B:1
C:2
D:3
parentheses
A:
B:
C:
D:
represent it?
A:
B:
C:
D:
A:
B:
C:
D:
B : R is NP hard
D : Q is NP hard

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : Recursive
B : Non Recursive
C : Recognizable
Q.no 3. Non deterministic finite automata to deterministic finite automata conversion is done via

C : Ardens theorem
D : Prims Algorithm
A : TRUE
B : FALSE
C:
D:
A:5
B:4
C:3
D:6
A : Gedit
B : JFLAP
C : FAUTO
D : grep
A : More
B : Less
C : No way
D : Very Much
A : TRUE
B : FALSE
C:
D:
A : TRUE
B : FALSE
C:
D:
A : Pushing
B : Popping
C : Replacing
A : TRUE
B : FALSE
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A:0
B:1
C:2
D:3
A : Recursive
C : NP HARD
D : NP Complete
B : Turing Machine
B : Principle
C : Hypothesis
A:4
B:3
C:2
D:1
A:L
B : L'
C:f
D : empty
symbol?
C : Both CFL and RL
A : rejected
C : accepted
D : Unsolvable
A : 1 and 3 only
B : 2 and 4 only
C : 2 and 3 only
D : 3 and 4 only
CFL?
B : DFA
C : NDFA
A:
B:
C:
D:
A:
B:
C:
D:
________.
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A:
B:
C:
D:
it?
B : 1s complement
C : 2s complement
D : 10s complement
A:
B:
C:
D:
A:
B:
C:
D:
expression.
A:
B:
C:
D:
A : Not recursive
B : Regular
A : X is decidable
figure
A:
B:
C:
D:
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
parentheses
A:
B:
C:
D:
represent it?
A:
B:
C:
D:
in it.
A:0
B:1
C:2
D:3

Seat No -
Time : 1hr
Max Marks : 50
N.B
A : TRUE
B : FALSE
C:
D:
Q.no 2. If w belongs to L of G, for some CFG, then w has a parse tree, which defines the syntactic
structure of w. w could be
A : Program
B : SQL query
C : XML document
D : All of these
A : Ardens theorem
B : Ogden’s Lemma
C : Pumping Lemma
D : Jordens theorem
Q.no 7. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
A : Current state
B : Direct proof
Q.no 11. Non deterministic finite automata to deterministic finite automata conversion is done
via
C : Ardens theorem
D : Prims Algorithm
A : 5 tuples
B : 6 tuples
C : 4 tuples
D : 7 tuples
A : More
B : Less
C : No way
D : Very Much
A : Stack
B : Array
C : Queue
D : Linked list
A : Open
B : Closed
C : Decidable
D : Not decidable
A:0
B:1
C:2
D:3
C : ndfa
D : ndpda
A:
B:
C:
D:
A : Decidable
B : Undecidable
C : Tractable
D : Intractable
B:
D : Turing Machine
_____.
A:
B:
C:
D:
C : Both CFL and RL
A:4
B:3
C:2
D:1
B : DFA
C : NDFA
A:
B:
C:
D:
C : Count principle
A : 1 and 3 only
B : 2 and 4 only
C : 2 and 3 only
D : 3 and 4 only
A : A spanning tree
D : DFS traversal
machine.

holding one symbol.
Name X?
C : Turing machines
A:
B:
C:
D:
A : Stable
B : Unsolvable
D : Unstable
A : NP
B:P
C : NP Hard
D : NP Complete
A : DFA AND NDFA
B : DPDA AND NPDA
A:x
B:y
C:z
D : mod xy
A:
B:
C:
D:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
D : Only a is true
A:
B:
C:
D:
A:
B:
C:
D:
about it?
A : L is recursive
in it.
A:0
B:1
C:2
D:3
A:
B:
C:
D:
A : Not recursive
B : Regular

A : I and II
B : I and IV
C : II and III
D : II and IV
A:
B:
C:
D:
A : Not recursive
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
A : X is decidable
shown table.
DFA is at least
A:
B:
C:
D:

Seat No -
Time : 1hr
Max Marks : 50
N.B
Q.no 1. While applying Pumping lemma over a language, we consider a string w that belong to L
and fragment it into _________ parts.
A:2
B:5
C:3
D:6
A : Binary tree
B : Red black tree
C : Parse tree
A:
B:
C:
D:
A : Decidable
B : Undecidable
C : Tractable
D : Intractable
A:
B:
C:
D:
B : Recursive
D : PDA

B : Decidable
C : Undecidable
D : NP HARD
figure is ____.
A:3
B:7
C:5
D:6
A : Chomsky
B : Greibach
C : Arden's
D : Backus
Q.no 13. Complete the statement given in following figure with reference to definiton of CFG.
A:V
B:T
C:
D:
Q.no 14. What is the Regular Expression Matching Zero or More Specific Characters
A:
B:
C:
D:
expression:
A : T1T2
B : T2T1
C : T1 X T2
D : T2T2T1
A : Current state
A:6
B:7
C:8
D:5
A : x,y
B:x
C:y
D : xy
A : rejected
C : accepted
B : Halting Problem
C : Hitting Set
D : Prims Algorithm
_________
B : Simulation
C : Turing Halting
D : Computability
holding one symbol.
Name X?
C : Turing machines
A : A spanning tree
D : DFS traversal
A:L
B : L'
C:f
D : empty
A : DFA and NFA

A:
B:
C:
D:
TM.
symbol?
A:x
B:y
C:z
D : mod xy
A : TRUE
B : FALSE
C:
D:
A:
B:
C:
D : Only a is true
about it?
A:6
B:4
C:2
D:8
A:
B:
C:
D:
________.
B : R is NP hard
D : Q is NP hard
A : 3 only
B : 3 and 4 only
C : 1, 2 and 3 only
D : 2 and 3 only
A:
B:
C:
D:
A : L is recursive
figure
A:
B:
C:
D:
A:
B:
C:
D:
A:
B:
C:
D:
A : Not recursive
B : Regular
A : 1, 2, 3, 4
B : 1, 2
C : 2,3,4
D : 3, 4
A:
B:
C:
D:
A : aaaabb
B : aabbbb
C : aabbab
D : abbbba
A : X is decidable


Toc Wheebox

Uploaded by

Copyright:

Available Formats

You might also like

Toc Wheebox

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Toc Wheebox

Uploaded by

Copyright:

Available Formats

12/26/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?

2) Attempt any 50 questions out of 60.

3) Use of calculator is allowed.

4) Each question carries 1 Mark.

5) Specially abled students are allowed 20 minutes extra for examination.

6) Do not use pencils to darken answer.

8) No change will be allowed once the answer is marked on OMR Sheet.

9) Rough work shall not be done on OMR sheet or on question paper.

10) Darken ONLY ONE CIRCLE for each answer.

Q.no 1. CFG is not closed under

Q.no 3. Pushdown automata consists of _____

Q.no 4. Which of the following statement is correct

A : Moore machine and Mealy machine both has five tuples

D : Moore machine and Mealy machine both has six tuples

Q.no 5. A problem which is both _______ and _________ is said to be NP complete.

Q.no 8. Which of the functions can a turing machine not perform?

Q.no 9. Which of the following statement is not true?

C : In derivation of string any nonterminal is selected to obtain next step of derivation

D : In derivation tree root node is always labelled by starting symbol

Q.no 10. Linear Bounded Automaton is a:

C : Push down Automaton

D : Deterministic Finite Automata

Q.no 12. A turing machine operates over:

A : Finite memory tape

B : Infinite memory tape

C : Depends on the algorithm

D : Depends on the input

Q.no 13. Which of the following are not in NP?

B : Boolean Satisfiability problems

C : Integer factorization problem

D : None of the mentioned

Q.no 14. The statement A TM can not solve halting problem is

Q.no 16. Which of the following statement is CORRECT?

A : A moore machine has no accepting states

B : A moore machine has accepting states

C : A Mealy machine has accepting states

D : Both machine has accepting states

A : Elimination of null production

B : Elimination of unit production

C : converting a given grammar to chomsky normal form

D : converting a given grammar to greibach normal form

Q.no 19. Which of the following is correct for Chomsky hierarchy?

B : goes into loop forever

D : goes into loop and hence rejected

Q.no 22. In Mealy machine the output is depends on

A : Only on current state

B : on both current state and current input

C : Only on current input

D : on all current state, current input and next state

Q.no 23. Which of the following is true for the language?

A : It is not accepted by a Turing Machine

B : It is regular but not context-free

C : It is context-free but not regular

D : It is neither regular nor context-free, but accepted by a Turing machine

Q.no 24. Which of the following problems is solvable ?

A : Writing a universal Turing machine

B : Determining of an arbitrary turing machine is an universal turing machine

D : Determining of a universal turing machine and some input will halt

Q.no 5. A problem which is both _ and ___ is said to be NP complete.