Professional Documents
Culture Documents
Search …
Here are 60+ most important TOC mcq sppu and also contains Theory of computation mcq with answers pdf to
free download. The toc sppu mcqs are most probably will get asked into your online exams. Best Luck.
Q.no 1. Which of the following does not belong to the language if input alphabet set is
a,b
A : a
B : b
C : epsilon
D:c
Advertisement
Show Answer
Q.no 2. Which of the following regular expressions represents the set of strings which
A : (rt)*
B : (tr)*
C : (rt)
D : (tr)
Advertisement
Show Answer
(tr)
Q.no 3. 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
Advertisement
Show Answer
Recursively Enumerable
A : decidable
B : Undecidable
C : sometimes decidable
D : infinite
Advertisement
Show Answer
decidable
Q.no 5. Which of the production rule can be accepted by Chomsky grammar. (i) A->BC,
(ii) A->a
A : only i
B : only ii
C : both i and ii
D : neither i nor ii
Show Answer
neither i nor ii
Advertisement
Show Answer
A : Its memory
B : number of states
C : start state
D : input symbols
Show Answer
Its memory
Q.no 8. Turing machine is more powerful than (a) Finite automata, (b) Push down
automata
A : Only (a)
B : Only (b)
Advertisement
Show Answer
B : Turing man
C : Turing taring
D : Turling Bake
Show Answer
Alan Turing
Q.no 10. Construct a regular expression for the language that contains strings having at
A : (100)*
B : 1* (00)* 1*
C : [ (1 + 0 )* (00) (1 + 0 )] +
D : ((0+1)(0+1))
Advertisement
Show Answer
[ (1 + 0 )* (00) (1 + 0 )] +
Show Answer
Q.no 12. is the class of decision problems that can be solved by nondeterministic polynomial algorithms?
A : NP
B : P
C : Hard
D : Complete
Advertisement
Show Answer
NP
Show Answer
Show Answer
Q.no 15. If P, Q, R are three regular expressions and if P does not contain epsilon, then
A : R = QP*
B : R = PQ
C : R = RP
D : R = QP
Advertisement
Show Answer
R = QP*
Q.no 16. Which among the following are incorrect regular identities?
A:
B :
C:
D:
Show Answer
D:
Q.no 17. Which of the following are the actions that operates on stack top?
A : only push
B : only pop
Advertisement
Show Answer
Show Answer
A : leftmost derivation
B : rightmost derivation
Show Answer
Q.no 20. A language L is said to be ___ if there is a turing machine M such that
A : Turing acceptable
B : Decidable
C : Undecidable
D : NP-HARD
Advertisement
Show Answer
Decidable
D : Turing Machine
Show Answer
Q.no 22. The production of the form A->B , where A and B are non terminals is called
A : Null production
C : Unit production
Show Answer
Unit production
Q.no 23. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which the total number of a’s is divisible by 2.
A : ((a+b)(a+b))
B : (a + ab)*
C : ( b* a bab)* + b*
D : a* b (aa)b a
Show Answer
( b* a bab)* + b*
Q.no 24. Which of the following statement(s) are correct? (a) All languages can be
generated by CFG, (b) Any regular language has an equivalent CFG, (c) Some non
B : Only (b)
C : Only (c)
Advertisement
Show Answer
A : Set of Nonterminals
B : Start symbol
C : Set of terminals
D : Production
Show Answer
Set of Nonterminals
D : current state
Show Answer
Show Answer
Q.no 28. Construct a regular expression for the language that contains strings having
A : (1+0)*
B :
C : ((0+1)(0+1))*
D : (01 + 10)*
Advertisement
Show Answer
B:
Q.no 29. The difference between number of states in FA for regular expression (a + b)
and (a + b) * is:
A : 1
B : 2
C : 3
D:0
Show Answer
Show Answer
Q.no 31. Which among the following is the LEAF of the parse tree?
A : Production P
B : Nonterminal V
C : Terminal T
D : Starting symbol S
Show Answer
Terminal T
Q.no 32. The ability for a system of instructions to simulate a Turing Machine is called
A : Turing Completeness
B : Simulation
C : Turing Halting
D : Computability
Advertisement
Show Answer
Turing Completeness
A : Every language that is defined by regular expression can also be defined by finite
automata
B : Every language defined by finite automata can also be defined by regular expression
C : We can convert regular expressions into finite automata
Show Answer
Atomicity
D : There exists a unique DFA for every regular language
Q.no 34. Which of the following statements is false?
Turing machine.
and complement.
Show Answer
Q.no 35. How many strings of length less than 4 contain the language described by the
A : 7
B : 10
C : 12
D : 11
Show Answer
12
Advertisement
Show Answer
Q.no 37. According to the given language, which among the following expressions does
A : (0+1+0+1+0+1+0+1)^4
B : (0+1)^4
C : (01)^4
D : (0+1+ε)^4
Show Answer
(0+1+ε)^4
Q.no 38. Identify the following problem: If G=(V, E) and V’ is subset of V, then V’ is an
A : Satisfiability
B : Independent set
C : Node-Cover Problem
Show Answer
Independent set
Q.no 39. Which of the following is analogous to the NFA and NPDA ?
D : Unrestricted language
Show Answer
Which of the following productions denies the format of Chomsky Normal Form?
A : 2,4
B : 1,3
C : 1, 2, 3, 4
D : 2, 3, 4
Show Answer
2,4
Q.no 41.
A : X is decidable
Show Answer
Q.no 42.
A : A
B : B
C : C
D:D
Show Answer
S-> aSa|bSb|a|b
Advertisement
Show Answer
Q.no 44. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
A : 10
B : 11
C : 12
D : 15
Show Answer
10
S->SS|0S1 |1S0|Є
generates :
D : 0’s followed by 1’s
Show Answer
Q.no 46. Which of the following will not be accepted by the following DFA?
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
Show Answer
ababaabaa
Q.no 47. Consider three decision problems P1, P2 and P3. It is known that P1 is
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
Advertisement
FAT BU RN E R
Only 1 Cup Of This Before Sleep And
6,5 Kg Will Vanish In 1 Week
LEARN MORE →
Show Answer
P3 is undecidable if P2 is reducible to P3
A :
B :
C :
D:
Show Answer
D:
Q.no 49. Which grammar accepts the language of {a, b} having strings ending with ‘a’.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D :c
Show Answer
S->aS | bS |a
A : Copies a string
B : Delete a symbol
C : Insert a symbol
Show Answer
Delete a symbol
Q.no 51. Find the pair of regular expressions that are equivalent
Advertisement
Show Answer
Q.no 52. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A :
B :
C :
D:
Show Answer
A:
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
C : Both deterministic and non deterministic PDA always accet same set of languages.
Show Answer
Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 54. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Advertisement
Show Answer
Type 3
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 nonblank symbols does not
contain any blank symbols B in between. Consider Alphabet
{a,b}.
A :
B :
C :
D:
Show Answer
A:
L1 = (a + b)* a
and
L2 = b (a + b ) *
A : (a + b ) * ab
B : ab (a + b ) *
C : a ( a + b ) * b
D : b (a + b ) * a
Show Answer
b (a + b ) * a
II. There exists some language which is in NP but is not Turing decidable
A : Only II
B : Only III
C : Only I and II
Show Answer
Q.no 58. Which Transition table of Turing Machine is correct for the following problem
A :
B :
C :
D:
Show Answer
B:
Q.no 59.
B : X is decidable
Show Answer
A : 3
B : 5
C : 7
D:2
Advertisement