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. |
State true or false:Statement: Every context free language can be generated by a grammar which contains no useless non terminals. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 2. |
Which of the following steps are wrong with respect to infiniteness problem? |
| A. | Remove useless variables |
| B. | Remove unit and epsilon production |
| C. | Create dependency graph for variables |
| D. | If there is a loop in the dependency graph the the language is finite else infinite |
| Answer» E. | |
| 3. |
Which of the following belong to the steps to prove emptiness?a) Remove useless variableb) Check if a start variable S is uselessc) Both ( |
| A. | Remove useless variableb) Check if a start variable S is uselessc) Both (a) and ( |
| B. | Check if a start variable S is useless |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
Which of the following are valid membership algorithms?a) CYK algorithmb) Exhaustive search parserc) Both ( |
| A. | CYK algorithmb) Exhaustive search parserc) Both (a) and ( |
| B. | Exhaustive search parser |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Which of the following is regular?a) a100b100b) (a+b)*-{a100b100}c) Both ( |
| A. | a100b100b) (a+b)*-{a100b100}c) Both (a) and ( |
| B. | (a+b)*-{a100b100} |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
Which of the following is not a negative property of Context free languages?a) Intersectionb) Complementc) Both ( |
| A. | Intersectionb) Complementc) Both (a) and ( |
| B. | Complement |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 7. |
WHICH_OF_THE_FOLLOWING_STEPS_ARE_WRONG_WITH_RESPECT_TO_INFINITENESS_PROBLEM??$ |
| A. | Remove useless variables |
| B. | Remove unit and epsilon production |
| C. | Create dependency graph for variables |
| D. | If there is a loop in the dependency graph the the language is finite else infinite |
| Answer» E. | |
| 8. |
Which of the following is true for CYK Algorithm? |
| A. | Triangular Table |
| B. | Circular Chart |
| C. | Linked List |
| D. | None of the mentioned |
| Answer» B. Circular Chart | |
| 9. |
Which of the following belong to the steps to prove emptiness? |
| A. | Remove useless variable |
| B. | Check if a start variable S is useless |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 10. |
Which of the following are valid membership algorithms? |
| A. | CYK algorithm |
| B. | Exhaustive search parser |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 11. |
Which of the following can be used to prove a language is not context free? |
| A. | Ardens theorem |
| B. | Power Construction method |
| C. | Regular Closure |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 12. |
Which of the following is not context free? |
| A. | {w: nA=nB=nC} |
| B. | {a*b*c*} |
| C. | {a<sup>100</sup>b<sup>100</sup>} |
| D. | All of the mentioned |
| Answer» E. | |
| 13. |
Which of the following is regular? |
| A. | a<sup>100</sup>b<sup>100</sup> |
| B. | (a+b)*-{a<sup>100</sup>b<sup>100</sup>} |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 14. |
The intersection of context free language and regular language is _________ |
| A. | regular language |
| B. | context free language |
| C. | context sensitive language |
| D. | non of the mentioned |
| Answer» C. context sensitive language | |
| 15. |
Which of the following is not a negative property of Context free languages? |
| A. | Intersection |
| B. | Complement |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |