MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The reorganizing capability of NDFA and DFA is? |
| A. | May be different |
| B. | Must be different |
| C. | Must be same |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 2. |
How many minimum states are required to find whether a string has odd number of 0 s or not? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 3. |
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least? |
| A. | N<sup>2</sup> |
| B. | 2<sup>N</sup> |
| C. | 2N |
| D. | N! |
| Answer» D. N! | |