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 1997
Which one of the following is not decidable?(A) Given a Turing machine M, a string s and an integer k, M accepts s within k steps(B) Equivalence of two given Turing machines(C) Language accepted by a given finite state machine is not empty(D) Language generated by a context free grammar is non-empty
