• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE-CS-2005 | Question 56

Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
L1\' --> Complement of L1
L2\' --> Complement of L2 

(A)

L1\' is recursive and L2\' is recursively enumer­able

(B)

L1\' is recursive and L2\' is not recursively enumerable

(C)

L1\' and L2\' are recursively enumerable

(D)

L1\' is recursively enumerable and L2\' is recursive

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments