MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
If = {a, b, c, d, e, f} then number of strings in of length 4 such that no symbol is used more than once in a string is |
| A. | 35 |
| B. | 360 |
| C. | 49 |
| D. | 720 |
| Answer» C. 49 | |
| 2. |
Let L denotes the language generated by the grammar S OSO/00. Which of the following is true? |
| A. | L = O |
| B. | L is regular but not O |
| C. | L is context free but not regular |
| D. | L is not context free |
| Answer» C. L is context free but not regular | |
| 3. |
An FSM with __________ |
| A. | M can be transformed to Numeral relabeling its states |
| B. | M can be transformed to N, merely relabeling its edges |
| C. | Both of the mentioned |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing m words, each of length n . |
| A. | m x 2<sup>n</sup> |
| B. | 2<sup>mn</sup> |
| C. | 2<sup>(m+n)</sup> |
| D. | all of the mentioned |
| Answer» C. 2<sup>(m+n)</sup> | |