MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In regular expressions, the operator ‘*’ stands for$ |
| A. | Concatenation |
| B. | Selection |
| C. | Iteration |
| D. | Addition |
| Answer» D. Addition | |
| 2. |
The relation between NFA-accepted languages and DFA accepted languages is |
| A. | > |
| B. | < |
| C. | = |
| D. | <= |
| Answer» D. <= | |
| 3. |
For any DFA state {qi,qj…qm} If some qj is a final state in the NFA Then {qi,qj…qm}, is a final state in the DFA.True or False$ |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
The behaviour of a NFA can be stimulated by DFA |
| A. | Always |
| B. | Sometimes |
| C. | Never |
| D. | Depends on NFA |
| Answer» B. Sometimes | |
| 5. |
Regular expression a/b denotes the set |
| A. | {a} |
| B. | {€,a,b} |
| C. | {a,b} |
| D. | {ab} |
| Answer» D. {ab} | |
| 6. |
Find the wrong statement? |
| A. | The language accepted by finite automata are the languages denoted by regular expression |
| B. | Every DFA has a regular expression denoting its language |
| C. | For a regular expression r, there does not exists NDFA with L® ant transit that accept |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 7. |
Can a DFA simulate NDFA |
| A. | No |
| B. | Yes |
| C. | Sometimes |
| D. | Depends on NDFA |
| Answer» C. Sometimes | |