GATE CSE 2016 SET 1

Planning to take coaching on Unacademy http://bit.ly/gate_unacademy or https://unacademy.com/ here is a code for 10% off PLUS1BPK1 Telegram Notification Group link:- https://t.me/joinchat/X5egW_cvdt9kMGY1 Telegram discussion Group link:- https://t.me/joinchat/VCyGUmVq8RNkMzhl Downloads resources from here https://education4fun.com/gate-cse/ MCQ (Single Correct Answer) GATE CSE 2016 Set 1 Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y’ reduces to W, and Z reduces to X’ (reduction means the standard many-one reduction). Which one of the following statements is TRUE(A) W can be recursively enumerable and Z is recursive.(B) W an be recursive and Z is recursively enumerable.(C) W is not recursively enumerable and Z is recursive.(D) W is not recursively enumerable and Z is not recursive