MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 859 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 851. |
WHICH_AMONG_THE_FOLLOWING_IS_A_CORRECT_OPTION_IN_FORMAT_FOR_REPRESENTING_SYMBOL_AND_EXPRESSION_IN_BACKUS_NORMAL_FORM??$ |
| A. | <symbol> ->expression |
| B. | <symbol>::=_expression_ |
| C. | <symbol>=<expression> |
| D. | all of the mentioned |
| Answer» C. <symbol>=<expression> | |
| 852. |
Which of the following is true for Valiants algorithm? |
| A. | an extension of CYK |
| B. | deals with efficient multiplication algorithms |
| C. | matrices with 0-1 entries |
| D. | all of the mentioned |
| Answer» E. | |
| 853. |
The __________ running time of CYK is O(n3 .|G|? |
| A. | |
| B. | worst |
| C. | best |
| Answer» B. worst | |
| 854. |
The standard version of CYK algorithm operates only on context free grammars in the following form: |
| A. | Greibach Normal form |
| B. | Chomsky Normal form |
| C. | Backus Naur form |
| D. | All of the mentioned |
| Answer» C. Backus Naur form | |
| 855. |
Which among the following can parse a context free grammar? |
| A. | top down parser |
| B. | bottom up parser |
| C. | CYK algorithm |
| D. | all of the mentioned |
| Answer» E. | |
| 856. |
Which of the following grammars is similar to Floyd Normal form? |
| A. | Backus Naur Form |
| B. | Kuroda Normal Form |
| C. | Greibach Normal Form |
| D. | Chomsky Normal Form |
| Answer» B. Kuroda Normal Form | |
| 857. |
Given a grammar in GNF and a derivable string in the grammar with the length n, any ___________will halt at depth n. |
| A. | top-down parser |
| B. | bottom-up parser |
| C. | multitape turing machine |
| D. | none of the mentioned |
| Answer» B. bottom-up parser | |
| 858. |
Which of the following can generate Unrestricted grammars? |
| A. | Pentonnen Normal form |
| B. | Floyd Normal form |
| C. | Greibach Normal form |
| D. | None of the mentioned |
| Answer» B. Floyd Normal form | |
| 859. |
Every Kuroda Normal form grammar generates ___________ |
| A. | Context free grammar |
| B. | Context sensitive grammar |
| C. | Unrestricted grammar |
| D. | None of the mentioned |
| Answer» C. Unrestricted grammar | |