MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 16 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 following denotion belongs to which type of language:G=(V, T, P, S) |
| A. | Regular grammar |
| B. | Context free grammar |
| C. | Context Sensitive grammar |
| D. | All of the mentioned |
| Answer» C. Context Sensitive grammar | |
| 2. |
abb*c denotes which of the following? |
| A. | {abnc|n=0} |
| B. | {abnc|n=1} |
| C. | {anbc|n=0} |
| D. | {abcn|n>0} |
| Answer» C. {anbc|n=0} | |
| 3. |
Which of the following strings is not generated by the given grammar:S->SaSbS|e |
| A. | aabb |
| B. | abab |
| C. | abaabb |
| D. | None of the mentioned |
| Answer» E. | |
| 4. |
Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4.a) (a+b+ab+ba+aa+bb+aba+bab+abab+baba)*b) (bbbb+aaa |
| A. | (a+b+ab+ba+aa+bb+aba+bab+abab+baba)*b) (bbbb+aaaa)*c) ((a+b)(a+b)(a+b)(a+ |
| B. | (bbbb+aaaa)* |
| C. | ((a+b)(a+b)(a+b)(a+b))* |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Which of the following strings do not belong the given regular expression?(a)*(a+cba) |
| A. | aa |
| B. | aaa |
| C. | acba |
| D. | acbacba |
| Answer» E. | |
| 6. |
A language is accepted by a push down automata if it is:a) regularb) context freec) both ( |
| A. | regularb) context freec) both (a) and ( |
| B. | context free |
| C. | both (a) and (b) |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 7. |
Which of the following is analogous to the following?:NFA and NPDA |
| A. | Regular language and Context Free language |
| B. | Regular language and Context Sensitive language |
| C. | Context free language and Context Sensitive language |
| D. | None of the mentioned |
| Answer» B. Regular language and Context Sensitive language | |
| 8. |
THE_FOLLOWING_DENOTION_BELONGS_TO_WHICH_TYPE_OF_LANGUAGE:?$ |
| A. | |
| B. | Regular grammar |
| C. | Context free grammar |
| D. | Context Sensitive grammar |
| Answer» C. Context free grammar | |
| 9. |
ABB*C_DENOTES_WHICH_OF_THE_FOLLOWING??$ |
| A. | {abnc|n=0} |
| B. | {abnc|n=1} |
| C. | {anbc|n=0} |
| D. | {abcn|n>0} |
| Answer» C. {anbc|n=0} | |
| 10. |
Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4. |
| A. | (a+b+ab+ba+aa+bb+aba+bab+abab+baba)* |
| B. | (bbbb+aaaa)* |
| C. | ((a+b)(a+b)(a+b)(a+b))* |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 11. |
Which of the following strings do not belong the given regular expression? |
| A. | *(a+cba) |
| B. | aa |
| C. | aaa |
| D. | acba |
| Answer» E. | |
| 12. |
Which of the following is an incorrect regular expression identity? |
| A. | R+f=R |
| B. | eR=e |
| C. | Rf=f |
| D. | None of the mentioned |
| Answer» C. Rf=f | |
| 13. |
A language is accepted by a push down automata if it is: |
| A. | regular |
| B. | context free |
| C. | both (a) and (b) |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 14. |
Which of the following relates to Chomsky hierarchy? |
| A. | Regular<CFL<CSL<Unrestricted |
| B. | CFL<CSL<Unrestricted<Regular |
| C. | CSL<Unrestricted<CF<Regular |
| D. | None of the mentioned |
| Answer» B. CFL<CSL<Unrestricted<Regular | |
| 15. |
Let T={p, q, r, s, t}. The number of strings in S* of length 4 such that no symbols can be repeated. |
| A. | 120 |
| B. | 625 |
| C. | 360 |
| D. | 36 |
| Answer» C. 360 | |
| 16. |
Which of the following is analogous to the following? |
| A. | |
| B. | Regular language and Context Free language |
| C. | Regular language and Context Sensitive language |
| Answer» B. Regular language and Context Free language | |