Back to Browse

GATE CSE 2015 SET 2

209 views
Dec 28, 2021
3:04

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 2015 Set 2 Consider the following statements: The complement of every Turning decidable language is Turning decidable 2. There exists some language which is in NP but is not Turing decidable 3. If L is a language in NP, L is Turing decidable Which of the above statements is/are True? (A) Only 2(B) Only 3(C) Only 1 and 2(D) Only 1 and 3

Download

0 formats

No download links available.

GATE CSE 2015 SET 2 | NatokHD