MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 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. |
Which of the following a Non-turing Complete language? |
| A. | Regular Language |
| B. | Context free grammars |
| C. | Epigram |
| D. | All of the mentioned |
| Answer» B. Context free grammars | |
| 2. |
Which of the games fill under the category of Turing-complete? |
| A. | Minecraft |
| B. | Minesweeper |
| C. | Dwarf Fortress |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
State true or false:Statement: Inorder to show something is Turing complete, it is enough to demonstrate that it can be used to simulate some Turing complete system. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 4. |
Which of the following remarks the given statement?Statement: Any function whose values can be computed by an algorithm, can be computed by a Turing machine. |
| A. | Smn theorem |
| B. | Structured Program theorem |
| C. | Church-Turing thesis |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Fill in the blank with an appropriate option.In automata theory, ___________ is said to be Computationally Universal if can be used to simulate any single taped Turing Machine. |
| A. | Computer’s instruction set |
| B. | A programming language |
| C. | Cellular Automaton |
| D. | All of the mentioned |
| Answer» E. | |
| 6. |
WHICH_OF_THE_GAMES_FILL_UNDER_THE_CATEGORY_OF_TURING-COMPLETE??$ |
| A. | Minecraft |
| B. | Minesweeper |
| C. | Dwarf Fortress |
| D. | All of the mentioned |
| Answer» E. | |
| 7. |
Which among are not the results of computational theory? |
| A. | In general, it is impossible to predict that what a Turing-complete program will do over an arbitrarily long time. |
| B. | It is impossible to determine for every input, whether the program will eventually stop or continue forever. |
| C. | It is not possible to determine whether a program will return true or false. |
| D. | None of the mentioned |
| Answer» E. | |
| 8. |
Which of the following can lack in a Universal computer? |
| A. | Turing Complete Instruction set |
| B. | Infinite memory |
| C. | Infinite time |
| D. | None of the mentioned |
| Answer» E. | |
| 9. |
Which of the following can be used to simulate any turing machine? |
| A. | Finite State Automaton |
| B. | Universal Turing Machine |
| C. | Counter machines |
| D. | All of the mentioned |
| Answer» C. Counter machines | |
| 10. |
Which of the following remarks the given statement? |
| A. | |
| B. | Smn theorem |
| C. | Structured Program theorem |
| Answer» D. | |
| 11. |
Let two machines be P and Q. The state in which P can simulate Q and Q can simulate P is called: |
| A. | Turing Equivalence |
| B. | State Equivalence |
| C. | Universal Turing Machine |
| D. | None of the mentioned |
| Answer» B. State Equivalence | |
| 12. |
Give a classic example of the concept of turing complete. |
| A. | lambda calculus |
| B. | C++ |
| C. | Lisp |
| D. | All of the mentioned |
| Answer» E. | |