MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 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 is a multi tape turing machine? |
| A. | Post turing Machine |
| B. | Wang-B Machine |
| C. | Oblivious turing Machine |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 2. |
Which of the following is true about Turing’s a-machine? |
| A. | a stands for automatic |
| B. | left ended, right end-infinite |
| C. | finite number of tape symbols were allowed |
| D. | all of the mentioned |
| Answer» E. | |
| 3. |
A deterministic turing machine is: |
| A. | ambiguous turing machine |
| B. | unambiguous turing machine |
| C. | non-deterministic |
| D. | none of the mentioned |
| Answer» C. non-deterministic | |
| 4. |
Which of the following is true for two stack turing machines?a) one read only inputb) two storage tapesc) Both ( |
| A. | one read only inputb) two storage tapesc) Both (a) and ( |
| B. | two storage tapes |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
WHICH_OF_THE_FOLLOWING_IS_TRUE_ABOUT_TURING‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬•S_A-MACHINE??$# |
| A. | a stands for automatic |
| B. | left ended, right end-infinite |
| C. | finite number of tape symbols were allowed |
| D. | all of the mentioned |
| Answer» E. | |
| 6. |
Which_of_the_following_is_a_multi_tape_turing_machine?$ |
| A. | Post turing Machine |
| B. | Wang-B Machine |
| C. | Oblivious turing Machine |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 7. |
A deterministic turing machine is? |
| A. | ambiguous turing machine |
| B. | unambiguous turing machine |
| C. | non-deterministic |
| D. | none of the mentioned |
| Answer» C. non-deterministic | |
| 8. |
Which of the following is false for Quantum Turing machine? |
| A. | Abstract machine |
| B. | Any quantum algorithm can be expressed formally as a particular quantum turing machine |
| C. | Gives a solution to ‘Is a universal quantum computer sufficient’ |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 9. |
Which of the turing machines have existential and universal states? |
| A. | Alternating Turing machine |
| B. | Probalistic Turing machine |
| C. | Read-only turing machine |
| D. | None of the mentioned |
| Answer» B. Probalistic Turing machine | |
| 10. |
Which of the following is not a Non deterministic turing machine? |
| A. | Alternating Turing machine |
| B. | Probabalistic Turing machine |
| C. | Read-only turing machine |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 11. |
Which of the following is true for two stack turing machines? |
| A. | one read only input |
| B. | two storage tapes |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 12. |
In what ratio, more computation time is needed to simulate multitape turing machines using single tape turing machines? |
| A. | doubly |
| B. | triple |
| C. | quadratically |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 13. |
A multitape turing machine is ________ powerful than a single tape turing machine. |
| A. | more |
| B. | less |
| C. | equal |
| D. | none of the mentioned |
| Answer» B. less | |
| 14. |
A turing machine with several tapes in known as: |
| A. | Multi-tape turing machine |
| B. | Poly-tape turing maching |
| C. | Universal turing machine |
| D. | All of the mentioned |
| Answer» B. Poly-tape turing maching | |