GATE CSE 2017 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 2017 Set 1 Let A and B be infinite alphabets and let # be a symbol outside both A and B. Let f be a total functional from A* to B* .We say f is computable if there exists a Turning machine M which given an input x inA*, always halts with f(x) on its tape. Let Lf denotes the language {x#f(x)|x∈A*}. Which of the following statements is true?(A) f if computable if and only if Lf is recursive.(B) f if computable if and only if Lf is recursive enumerable.(C) if f is computable then Lf is recursive, but not conversely.(D) if f is computable then Lf is recursively enumerable, but not conversely.