GATE Computer Science (CS) 2018 Shift 1 Solved Paper

© examsiri.com

Question : 31 of 65

Marks: +1, -0

The set of all recursively enumerable languages is

closed under complementation
closed under intersection
a subset of the set of all recursive languages
an uncountable set

Go to Question:

Prev Question

Next Question