Q. The set of all recursively enumerable languages is
A. closed under complementation.
B. closed under intersection.
C. a subset of the set of all recursive languages.
D. an uncountable set.
Ans: closed under intersection.
Q. The set of all recursively enumerable languages is
A. closed under complementation.
B. closed under intersection.
C. a subset of the set of all recursive languages.
D. an uncountable set.
Ans: closed under intersection.
Government Schemes Mock Test | Start Test! |
Political Science Mock Test – 42 | Start Test |
History Test – 190 | Start Test |
Quantitative Aptitude Test | Start Test! | Data Interpretation - Mock Test | Start Test! |
General Awareness - Mock Test | Start Test! |
Reasoning Ability - Mock Test | Start Test! |