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 2016 Set 2
Consider the following languages.
L1 = { | M takes at least 2016 steps on some input},
L2 = { | M takes at least 2016 steps on all inputs} and
L3 = { | M accepts ε},
where for each Turing machine M, denotes a specific encoding of M.
Which one of the following is TRUE?(A) L1 is recursive and L2, L3 are not recursive(B) L2 is recursive and L1, L3 are not recursive(C) L1, L2 are recursive and L3 is not recursive(D) L1, L2, L3 are recursive
