Home / Engineering / Theory of Computation MCQs / Page 10
Theory of Computation MCQs | Page - 10
Dear candidates you will find MCQ questions of Theory of Computation here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
M
Q. 91) We think of a Turing machine’s transition function as a
M
Q. 93) A random access machine (RAM) and truing machine are different in
M
Q. 95) Given S = {a, b}, which one of the following sets is not countable?
M
Q. 96) 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.”
M
Q. 97) Which of the following conversion is not possible (algorithmically)?
M
Q. 98) Consider a language L for which there exists a Turing machine ™, T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is
M
Q. 99) Consider the following statements
I. Recursive languages are closed under complementation
II. Recursively enumerable languages are closed under union
III. Recursively enumerable languages are closed under complementation
Which of the above statement are TRUE?
M
Q. 100) Recursively enumerable languages are not closed under
Explore Sets
Theory of Computation MCQs Set 1
Theory of Computation MCQs Set 2
Theory of Computation MCQs Set 3
Theory of Computation MCQs Set 4
Theory of Computation MCQs Set 5
Theory of Computation MCQs Set 6
Theory of Computation MCQs Set 7
Theory of Computation MCQs Set 8
Theory of Computation MCQs Set 9
Theory of Computation MCQs Set 10
Theory of Computation MCQs Set 11
Theory of Computation MCQs Set 12
Theory of Computation MCQs Set 13
Explore More Categories
Click on category to learn MCQs of that category.Electronics and Communication Engineering
Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.
