Bihar STET – TOC Practice Test | Set 3 ⋆ CSE Study247

Bihar STET – TOC Practice Test | Set 3

Questions 51-55 of 100

0% completed (0/100 answered)

Question 51

MCQ · Single Correct 1 mark

A language L is Recursively Enumerable if and only if there exists an Enumerator that -

A Halts after 10 strings B Prints only finite strings C Prints all strings of L in some arbitrary order (possibly with repetitions) D Prints strings in alphabetical order only

Question 52

MCQ · Single Correct 1 mark

A language L is Recursive (Decidable) if and only if there exists an Enumerator that -

A Loops infinitely without printing B Prints all strings of L in STRICT LEXICOGRAPHIC (canonical) ORDER C Prints strings backwards D Prints non-member strings

Question 53

MCQ · Single Correct 1 mark

What is the 'Halting Language' $H_{TM}$?

A $H_{TM}$ = { <M, w> | Turing Machine M halts on input w } (Recursively Enumerable but UNDECIDABLE) B Regular language C Context-Free language D Decidable language

Question 54

MCQ · Single Correct 1 mark

What is the 'Empty Language Problem' for Turing Machines $E_{TM}$ = { <M> | L(M) = ∅ }?

A Context-Free B Decidable C In Class P D UNDECIDABLE (and Non-Recursively Enumerable)

Question 55

MCQ · Single Correct 1 mark

What is the 'Equivalence Problem' for Turing Machines EQ_TM = { <M1, M2> | L(M1) = L(M2) }?

A Decidable B In Class P C UNDECIDABLE (and Non-Recursively Enumerable) D Context-Free