MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 19 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
With reference to binary strings, state true or false:Statement: For any turing machine, the input alphabet is restricted to {0,1}. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
Which of the following is true for The Halting problem?a) It is recursively ennumerableb) It is undecidablec) Both ( |
| A. | It is recursively ennumerableb) It is undecidablec) Both (a) and ( |
| B. | It is undecidable |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 3. |
Statement: If L id R.E., Lc needs to be R.E. Is it correct? |
| A. | Yes |
| B. | No |
| C. | Maybe |
| D. | Cannot predict |
| Answer» C. Maybe | |
| 4. |
Which of the following are correct statements?a) TMs that always halt are known as Decidable problemsb) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.c) Both ( |
| A. | TMs that always halt are known as Decidable problemsb) TMs that are guaranteed to halt only on acceptance are recursive ennumerable.c) Both (a) and ( |
| B. | TMs that are guaranteed to halt only on acceptance are recursive ennumerable. |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Which of the following are decidable problems?a) Can a particular line of code in a program ever be executed?b) Do two given CFG’s generate the same languagec) Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w} |
| A. | Can a particular line of code in a program ever be executed?b) Do two given CFG’s generate the same languagec) Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}a) A concrete undecidable problem |
| B. | Do two given CFG’s generate the same languagec) Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidable |
| C. | Is a given CFG ambiguous?d) None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidablec) -A is not recognizable |
| D. | None of the mentioned 7.Which one of the following is true for the given?A={(M,w)|M is a turing machine that accepts string w}a) A concrete undecidable problemb) A is recognizable but not decidablec) -A is not recognizabled) All of the mentionedView Answer |
| Answer» E. | |
| 6. |
Which of the following are incorrect options?a) Informally, problem is a yes/no question about an infinite set of possible instancesb) Formally, a problem is a languagec) Both ( |
| A. | Informally, problem is a yes/no question about an infinite set of possible instancesb) Formally, a problem is a languagec) Both (a) and ( |
| B. | Formally, a problem is a language |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» E. | |
| 7. |
Which of the following are undecidable problems?a) Determining whether two grammars generate the same languageb) Determining whether a grammar is ambiguousc) Both ( |
| A. | Determining whether two grammars generate the same languageb) Determining whether a grammar is ambiguousc) Both (a) and ( |
| B. | Determining whether a grammar is ambiguous |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 8. |
Diagonalization can be useful in:a) To find a non recursively ennumerable languageb) To prove undecidablility of haltig problemc) Both ( |
| A. | To find a non recursively ennumerable languageb) To prove undecidablility of haltig problemc) Both (a) and ( |
| B. | To prove undecidablility of haltig problem |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 9. |
Which of the following technique is used to find whether a natural language isnt recursive ennumerable?a) Diagonalizationb) Recursive Inductionc) Both ( |
| A. | Diagonalizationb) Recursive Inductionc) Both (a) and ( |
| B. | Recursive Induction |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» B. Recursive Induction | |
| 10. |
STATEMENT:_IF_L_ID_R.E.,_LC_NEEDS_TO_BE_R.E._IS_IT_CORRECT??$ |
| A. | Yes |
| B. | No |
| C. | Maybe |
| D. | Cannot predict |
| Answer» C. Maybe | |
| 11. |
With reference to binary strings, state true or false:$ |
| A. | |
| B. | true |
| Answer» B. true | |
| 12. |
Which of the following is true for The Halting problem?$ |
| A. | It is recursively ennumerable |
| B. | It is undecidable |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 13. |
With reference ti enumeration of binary strings, the conversion of binary strings to integer is possible by treating the resulting string as a base ____ integer. |
| A. | 2 |
| B. | 8 |
| C. | 16 |
| D. | All of the mentioned |
| Answer» B. 8 | |
| 14. |
Which one of the following is true for the given? |
| A. | |M is a turing machine that accepts string w} |
| B. | A concrete undecidable problem |
| C. | A is recognizable but not decidable |
| D. | -A is not recognizable |
| Answer» E. | |
| 15. |
If a problem has an algorithm to answer it, we call it _________ |
| A. | decidable |
| B. | solved |
| C. | recognizable |
| D. | none of the mentioned |
| Answer» B. solved | |
| 16. |
Which of the following are incorrect options? |
| A. | Informally, problem is a yes/no question about an infinite set of possible instances |
| B. | Formally, a problem is a language |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» E. | |
| 17. |
Which of the following are undecidable problems? |
| A. | Determining whether two grammars generate the same language |
| B. | Determining whether a grammar is ambiguous |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 18. |
Diagonalization can be useful in: |
| A. | To find a non recursively ennumerable language |
| B. | To prove undecidablility of haltig problem |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 19. |
Which of the following technique is used to find whether a natural language isnt recursive ennumerable? |
| A. | Diagonalization |
| B. | Recursive Induction |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» B. Recursive Induction | |