📊 Theory of Computation
Q. 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?
  • (A) I only
  • (B) I and II
  • (C) I and III
  • (D) II and III
💬 Discuss
✅ Correct Answer: (B) I and II

You must be Logged in to update hint/solution

💬 Discussion

Related MCQs

Q. Which selective retest technique selects every test case that causes a modified program to produce a different output than its original version?

Q. The method of access which uses key transformation is known as

Q. The condition allows a general predicate over the relations being joined.

Q. Top management level is responsible for implementing plans and strategies of the organisation.

Q. Is the below statement true for the domain of positive integers ∀p ∃q ( p + q = 7)

Q. In 32 bit representation the scale factor as a range of

Q. The primary advantage of RTL technology was that

Q. When control systems are used to their fullest, they

Q. Following is not a technique of black box.

Q. _____ command is used to manipulate TCP/IP routing table.

📊 Question Analytics

👁️
929
Total Visits
📽️
2 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
89%
Success Rate