Top 150+ Solved Theory of Computation MCQ Questions Answer
Q. What is the reason behind a Turing machine is more powerful than finite state machine FSM?
a. turing machine head movement is continued to one direction.
b. turing machine head moment is in both directions i.e. left moment and right moment as well.
c. turing machine has capability remember arbitrary long sequence of input string.
d. all are correct.
Q. A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.
a. 0
b. exectly 2
c. 2 or more
d. both exectly 2 or more are correct
Q. If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be
a. recursive enumerable
b. recursive
c. context free language (cfl)
d. none of them
Q. If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be
a. recursive enumerable
b. recursive
c. context free language
d. none of these
Q. Universal Turing machine (UTM) influenced the concepts of
a. computability
b. interpretive implementation of programming language
c. program and data is in same memory
d. all are correct
Q. The number of symbols necessary to simulate a Turing machine with m symbols and n states
a. 4m × n + m
b. 4m × n + n
c. m+n
d. none of them
Q. A universal Turing machine is a
a. reprogrammable truing machine
b. two-tape turing machine
c. single tape turing machine
d. none of them
Q. He difference between a read-only Turing machine and a two-way finite state machine is
a. head movement
b. finite control
c. storage capacity
d. power
Q. Which is correct regard an off-line Truing machine?
a. an offline turing machine is a special type of multi-tape turing machine
b. an offline turing machine is a kind of multi-tracks truing machine
c. an offline turing machine is a kind of single-track turing machine
d. none of them
Q. Four pairs are following; in each pair both objects have some common thing. Choose the odd pair;
a. (tm, 2pda)
b. (computer, utm)
c. (2pda, npda)
d. (fa, pda)
Q. We think of a Turing machine’s transition function as a
a. computer system
b. software
c. hardware
d. all of them
Q. Church’s Thesis supports
a. a turing machine as a general-purpose computer system
b. a turing machine an algorithm and an algorithm as a turing machine
c. both tm is an general-purpose computer and tm is an algorithm and vice-versa are correct
d. none of them is correct
Q. A random access machine (RAM) and truing machine are different in
a. power
b. accessing
c. storage
d. both accessing and storage are correct
Q. In which of the stated below is the following statement true?“For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”
a. m1 is a non-deterministic finite automata
b. m1 is a non-deterministic push-down automata
c. m1 is a non-deterministic turing machine
d. for no machine m1 use the above statement true
Q. Which of the following conversion is not possible (algorithmically)?
a. regular grammar to context-free grammar
b. non-deterministic finite state automata to deterministic finite state automata
c. non-deterministic pushdown automata to deterministic pushdown automata
d. none deterministic turing machine to deterministic turing machine