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. |
According to Chomsky hierarchy, which of the following is adopted by Recursively Ennumerable language? |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» B. Type 1 | |
| 2. |
Which of the following is/are not true for recursively ennumerable language? |
| A. | partially decidable |
| B. | Turing acceptable |
| C. | Turing Recognizable |
| D. | None of the mentioned |
| Answer» E. | |
| 3. |
State true or false:Statement: Two track turing machine is equivalent to a standard turing machine. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 4. |
Statement 1: Multitrack Turing machine.Statement 2: Gamma is Cartesian product of a finite number of finite sets.Which among the following is the correct option? |
| A. | Statement 1 is the assertion and Statement 2 is the reason |
| B. | Statement 1 is the reason and Statement 2 is the assertion |
| C. | Statement 1 and Statement 2 are independent from each other |
| D. | None of the mentioned |
| Answer» B. Statement 1 is the reason and Statement 2 is the assertion | |
| 5. |
State true or false:Statement: We can use the finite control of turing machine to hold a finite amount of data. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 6. |
In one move a turing machine will: |
| A. | Change a state |
| B. | Write a tape symbol in the cell scanned |
| C. | Move the tape head left or right |
| D. | All of the mentioned |
| Answer» E. | |
| 7. |
WHICH_OF_THE_FOLLOWING_IS/ARE_NOT_TRUE_FOR_RECURSIVELY_ENNUMERABLE_LANGUAGE??$ |
| A. | partially decidable |
| B. | Turing acceptable |
| C. | Turing Recognizable |
| D. | None of the mentioned |
| Answer» E. | |
| 8. |
According_to_Chomsky_hierarchy,_which_of_the_following_is_adopted_by_Recursively_Ennumerable_language?$ |
| A. | Type 0 |
| B. | Type 1 |
| C. | Type 2 |
| D. | Type 3 |
| Answer» B. Type 1 | |
| 9. |
A multi track turing machine can described as a 6-tuple (Q, X, S, d, q0, F) where X represents: |
| A. | input alphabet |
| B. | tape alphabet |
| C. | shift symbols |
| D. | none of the mentioned |
| Answer» C. shift symbols | |
| 10. |
Statement 1: Multitrack Turing machine. |
| A. | |
| B. | |
| Answer» B. | |
| 11. |
Suppose we have a simple computer with control unit holding a PC with a 32 bit address + Arithmetic unit holding one double length 64 bit Arithmetic Register. The number of states the finite machine will hold: |
| A. | 2<sup>(32*64)</sup> |
| B. | 2<sup>96</sup> |
| C. | 96 |
| D. | 32 |
| Answer» C. 96 | |
| 12. |
A turing machine has ____________ number of states in a CPU. |
| A. | finite |
| B. | infinte |
| C. | May be finite |
| D. | None of the mentioned |
| Answer» B. infinte | |