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. |
Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*? |
| A. | String with substring 00 |
| B. | string with at most two 0’s |
| C. | string containg at least two 0’s |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 2. |
Given the language L = {ab, aa, baa}, which of the following strings are in L*? |
| A. | abaabaaabaa |
| B. | aaaabaaaa |
| C. | baaaaabaaaab |
| D. | baaaaabaa |
| Answer» D. baaaaabaa | |
| 3. |
Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1* |
| A. | € |
| B. | a* |
| C. | All of the mentioned |
| D. | None of the mentioned |
| Answer» B. a* | |