Which of the following is false regarding the evaluation of computer programming languages ?
| A. | Application oriented features |
| B. | Efficiency and Readability |
| C. | Software development |
| D. | Hardware maintenance cost |
|
Option: D Explanation : Click on Discuss to view users comments. |
| A. |
The family of regular languages is closed under symmetric difference but not closed under nor.
|
| B. |
The family of regular languages is closed under nor but not closed under symmetric difference.
|
| C. | The family of regular languages are closed under both symmetric difference and nor. |
| D. |
The family of regular languages are not closed under both symmetric difference and nor.
|
|
Option: C Explanation : Click on Discuss to view users comments. |
The regular expression for the complement of the language L = {anbm|n ≥ 4, m ≤ 3} is :
| A. | (λ + a + aa + aaa) b* + a* bbbb* + (a + b)* ba(a + b)* |
| B. | (λ + a + aa + aaa) b* + a* bbbbb* + (a + b)* ab(a + b)* |
| C. | (λ + a + aa + aaa) + a* bbbbb* + (a + b)* ab(a + b)* |
| D. | (λ + a + aa + aaa)b* + a* bbbbb* + (a + b)* ba(a + b)* |
|
Option: D Explanation : Click on Discuss to view users comments. |
| A. | L1 is regular and L*2 is not regular |
| B. | L1 is not regular and L*2 is regular |
| C. | Both L1 and L*2 are regular languages |
| D. | Both L1 and L*2 are not regular languages |
|
Option: B Explanation : Click on Discuss to view users comments. |
