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. |
The class of recursive language is known as: |
| A. | R |
| B. | RC |
| C. | RL |
| D. | All of the mentioned |
| Answer» B. RC | |
| 2. |
Recursive languages are also known as: |
| A. | decidable |
| B. | undecidable |
| C. | sometimes decidable |
| D. | none of the mentioned |
| Answer» B. undecidable | |
| 3. |
A formal language is recursive if : |
| A. | a total turing machine exists |
| B. | a turing machine that halts for every input |
| C. | turing machine rejects if the input does not belong to the language |
| D. | all of the mentioned |
| Answer» E. | |
| 4. |
A problem is called __________ if its has an efficient algorithm for itself. |
| A. | tractable |
| B. | intractable |
| C. | computational |
| D. | none of the mentioned |
| Answer» B. intractable | |
| 5. |
An algorithm is called efficient if it runs in ____________ time on a serial computer. |
| A. | polynomial |
| B. | non polynomial |
| C. | logarithmic |
| D. | none of the mentioned |
| Answer» B. non polynomial | |
| 6. |
The problems which have no algorithm, regardless of whether or not they are accepted by a turing machine that fails to halts on some input are referred as: |
| A. | Decidable |
| B. | Undecidable |
| C. | Computable |
| D. | None of the mentioned |
| Answer» C. Computable | |
| 7. |
Decidable can be taken as a synonym to: |
| A. | recursive |
| B. | non recursive |
| C. | recognizable |
| D. | none of the mentioned |
| Answer» B. non recursive | |
| 8. |
The language accepted by a turing machine is called ____________ |
| A. | Recursive Ennumerable |
| B. | Recursive |
| C. | Recursive Ennumerable and Recursive |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 9. |
Which among the following are semi decidable? |
| A. | Empty-DFA |
| B. | Rec-NFA |
| C. | Infinite-DFA |
| D. | All of the mentioned |
| Answer» E. | |
| 10. |
Which among the following are undecidable theories? |
| A. | The first order theory of boolean algebra |
| B. | The first order theory of Euclidean geomentry |
| C. | The first order theory of hyperbolic geometry |
| D. | The first order theory of the natural number with addition, multiplication, and equality |
| Answer» E. | |
| 11. |
A language L is said to be ____________ if there is a turing machine M such that L(M)=L and M halts at every point. |
| A. | Turing acceptable |
| B. | decidable |
| C. | undecidable |
| D. | none of the mentioned |
| Answer» C. undecidable | |
| 12. |
The decision problem is the function from string to ______________ |
| A. | char |
| B. | int |
| C. | boolean |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |