MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1702 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 1701. |
The space complexity of a turing machine is undefined if: |
| A. | It is a multitape turing machine |
| B. | If no string of length n causes T to use infinite number of tape squares |
| C. | If some input of length n causes T to loop forever |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 1702. |
Which among the following is smallest for n=50 |
| A. | 2n2 |
| B. | n2+3n+7 |
| C. | n3 |
| D. | 2n |
| Answer» C. n3 | |