Home / Engineering / Theory of Computation and Compiler Design / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?

(A) L1' is recursive and L2' is recursively enumerable
(B) L1' is recursive and L2' is not recursively enumerable
(C) L1' and L2' are recursively enumerable
(D) L1' is recursively enumerable and L2' is recursive
Correct answer : Option (B) - L1' is recursive and L2' is not recursively enumerable

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation and Compiler Design

Q. In python, the list L contains the following elements : ['A', 1,'1','George']. Which of the following ways of slicing would assign only the first two elements to the variable X ?

Q. All code inside finally block is guaranteed to execute irrespective of whether an exception occurs in the protected block or not.

Q. Sensor component

Q. In the........... Normal form, a composite attribute is converted to individual attributes.

Q. Which one is best in action between fork() and vfork()?

Q. If Linear regression model perfectly first i.e., train error is zero, then

Q. The process of strategic thinking most involves what?

Q. Which of the following does not interrupt a running process?

Q. Which of the following functions will not result in an error when no arguments are passed to it?

Q. The maximum number of edges in a 8- node undirected graph without self loops is