MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 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. |
NPDA stands for |
| A. | Non-Deterministic Push Down Automata |
| B. | Null-Push Down Automata |
| C. | Nested Push Down Automata |
| D. | All of the mentioned |
| Answer» B. Null-Push Down Automata | |
| 2. |
The context free grammar which generates a Regular Language is termed as: |
| A. | Context Regular Grammar |
| B. | Regular Grammar |
| C. | Context Sensitive Grammar |
| D. | None of the mentioned |
| Answer» C. Context Sensitive Grammar | |
| 3. |
A null production can be referred to as: |
| A. | String |
| B. | Symbol |
| C. | Word |
| D. | All of the mentioned |
| Answer» B. Symbol | |
| 4. |
A context free grammar can be recognized bya) Push down automatab) 2 way linearly bounded automatac) Both ( |
| A. | Push down automatab) 2 way linearly bounded automatac) Both (a) and ( |
| B. | 2 way linearly bounded automata |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Which of the following automata takes queue as an auxiliary storage? |
| A. | Finite automata |
| B. | Push down automata |
| C. | Turing machine |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 6. |
If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called |
| A. | Complement |
| B. | Union |
| C. | Disjoint |
| D. | Connected |
| Answer» D. Connected | |
| 7. |
THE_CONTEXT_FREE_GRAMMAR_WHICH_GENERATES_A_REGULAR_LANGUAGE_IS_TERMED_AS:?$ |
| A. | Context Regular Grammar |
| B. | Regular Grammar |
| C. | Context Sensitive Grammar |
| D. | None of the mentioned |
| Answer» C. Context Sensitive Grammar | |
| 8. |
NPDA_stands_for$ |
| A. | Non-Deterministic Push Down Automata |
| B. | Null-Push Down Automata |
| C. | Nested Push Down Automata |
| D. | All of the mentioned |
| Answer» B. Null-Push Down Automata | |
| 9. |
A null production can be referred to as? |
| A. | String |
| B. | Symbol |
| C. | Word |
| D. | All of the mentioned |
| Answer» B. Symbol | |
| 10. |
A context free grammar can be recognized by |
| A. | Push down automata |
| B. | 2 way linearly bounded automata |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 11. |
Which of the following automata takes stack as auxiliary storage? |
| A. | Finite automata |
| B. | Push down automata |
| C. | Turing machine |
| D. | All of the mentioned |
| Answer» C. Turing machine | |
| 12. |
The closure property of context free grammar includes : |
| A. | Kleene |
| B. | Concatenation |
| C. | Union |
| D. | All of the mentioned |
| Answer» E. | |
| 13. |
A context free grammar is a ___________ |
| A. | English grammar |
| B. | Regular grammar |
| C. | Context sensitive grammar |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 14. |
Which among the following is not a part of the Context free grammar tuple? |
| A. | End symbol |
| B. | Start symbol |
| C. | Variable |
| D. | Production |
| Answer» B. Start symbol | |
| 15. |
If two sets, R and T has no elements in common i.e. R‚àö√°T=‚àö√ú, then the sets are called |
| A. | Complement |
| B. | Union |
| C. | Disjoint |
| D. | Connected |
| Answer» D. Connected | |