Back to Browse

GATE CSE 2001

369 views
Dec 28, 2021
3:00

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 2001 Consider the following problem X. Given a Turing machine M over the input alphabet Σ, any state q of M And a word w∈Σ*, does the computation of M on w visit the state q? Which of the following statements about X is correct?(A) X is decidable(B) X is undecidable but partially decidable(C) X is undecidable and not even partially decidable(D) X is not a decision problem

Download

0 formats

No download links available.

GATE CSE 2001 | NatokHD