Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) Choose the correct statement

(A) recursive set ⊆ recursive enumerable set
(B) total function is same as partial function
(C) recursive sets are analogous to total functions
(D) both recursive set ⊆ recursive enumerable set and recursive sets are analogous to total functions are correct.
Correct answer : Option (D) - both recursive set ⊆ recursive enumerable set and recursive sets are analogous to total functions are correct.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. To resolve the clash over the access of the system BUS we use

Q. “Elliptic curve cryptography follows the associative property.”

Q. ________________ is a data transformation process.

Q. To overcome the lag in the operating speeds of the I/O device and the processor we use

Q. What is an operating system?

Q. You are purchasing an automobile priced at $20,000 by borrowing at 12% interest compounded monthly. The loan will be repaid in monthly installments for five years. What is the constant dollar value (value at the time of financing) of the 36th payment of this loan, if the general inflation rate is 5% compounded monthly?

Q. Whats so great about xml?

Q. In the coding redundancy technique we use

Q. The department relation has the an entry budget whose type has to be replaced by

Q. Memory management technique in which system stores and retrieves data from secondary storage for use in main