GATE CS 2014 Set 2 Q35: Understanding Turing Machine Encodings and Language Acceptance

GATE CS 2014,Set-2,Q35: Let (M) be the encoding of a Turing machine as a string over ∑= {0, 1}.  Let L = { (M) |M is a Turing machine that accepts a string of length 2014 }. Then, L is
(A) decidable and recursively enumerable
(B) undecidable but recursively enumerable
(C) undecidable and not recursively enumerable
(D) decidable but not recursively enumerable
Ans: (B) undecidable but recursively enumerable
----------------------------
Subscribe my channel for more updates https://www.youtube.com/monalisacs
--------------------------------------------------------------------
Theory Of Computation Lecture https://www.youtube.com/watch?v=vDJjYGui3Ho&list=PL767-rEuXhcPQWMuHXOCZzj5PqF9YBVZt
-------------------------------------------------------------------
TOC GATE Previous Questions Solved by Monalisa https://www.youtube.com/watch?v=K5wIww1OnCY&list=PL767-rEuXhcN7sn9TCRxhmvDpG7RLT3UK
-------------------------------------------------------------------
Data Structure Lecture: https://www.youtube.com/watch?v=mYDsGejk3zg&list=PL767-rEuXhcMiMbX4IU_oqWshY6z8Rc7j
---------------------------------------------------------------------
Data Structure Previous 10 year Questions: https://www.youtube.com/watch?v=mYDsGejk3zg&list=PL767-rEuXhcOWUPgW1RrIkUKAle1YBdh1
-----------------------------------------------------------------------
#GATECS2014#TOC#Undecidable