M

Mr. Dubey • 52.30K Points
Coach 

Q. Recursively enumerable languages are not closed under

(A) Complementation
(B) Union
(C) Intersection
(D) None of the above
Correct : Option (A)

Share

Discusssion

Login to discuss.

Related MCQs

Q. For correct behaviour during recovery, undo and redo operation must be

Q. In the last decade, many researchers started training bigger and bigger models, built with several different layers that's why this approach is c

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

Q. In which mode FTP, the client initiates both the control and data connections.

Q. The operation which is not considered a basic operation of relational algebra is

Q. If the channel is noiseless information conveyed is and if it is useless channel information conveyed is

Q. p ↔ q is logically equivalent to

Q. Which of the following is a self – balancing binary search tree?

Q. PLD contains a large number of

Q. question can be varied to suit context Disadvantages Time consuming Choose the Evaluation query technique based on above statement