Back to Browse

GATE CSE 2014 SET 2

198 views
Dec 28, 2021
3:18

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 2014 Set 2 Let A ≤m B denotes that language A is mapping reducible (also known as many-to-one reducible) to language B. Which one of the following is FALSE?(A) If A ≤m B and B is recursive then A is recursive.(B) If A ≤m B and A is undecidable then B is undecidable.(C) If A ≤m B and B is recursively enumerable then A is recursively enumerable.(D) If A ≤m B  and B is not recursively enumerable then A is not recursively enumerable.

Download

0 formats

No download links available.

GATE CSE 2014 SET 2 | NatokHD