Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) Which statement is true?

(A) The tape of turing machine is infinite.
(B) The tape of turing machine is finite.
(C) The tape of turing machine is infinite when the language is regular
(D) The tape of turing machine is finite when the language is nonregular.
Correct answer : Option (A) - The tape of turing machine is infinite.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Which of the following is not the algorithm to find the minimum spanning tree of the given graph?

Q. When you double click a query object, you open

Q. The right hand side of an association rule is called__________.

Q. What utility of dweet.io allows publishing data?

Q. The validation control has ____________ control.

Q. Which design pattern is used in the Java Database connectivity JDBC(TM)?

Q. The NVIDIA G80 is a ---- CUDA core device, the NVIDIA G200 is a ---- CUDA core device, and the NVIDIA Fermi is a ---- CUDA core device.

Q. Let the disturbing mass be 50 Kg, with radius of rotation = 0.1m, if one of the balancing mass is 30 Kg at a radius of rotation 0.1m then find the other balancing mass situated at a distance of 0.2m.

Q. is the collection of memory structures and Oracle background processes that operates against an Oracle database.

Q. A capacitor stores energy in the form of an electrostatic field is a ______.