PREVIOUS YEAR SOLVED PAPERS - July 2016 Paper 3
21. Which of the following is false regarding the evaluation of computer programming languages ?
- Option : D
- Explanation : Efficiency and Readability, Application oriented features and Software development are regarding to the evaluation of computer programming languages. But Hardware maintenance costis not regrading to the evaluation of computer programming languages. So, option (D) is correct.
- 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.
23. The regular expression for the complement of the language L = {anbm|n ≥ 4, m ≤ 3} is:
- Option : D
- Explanation : The complement of the language L = {anbm|n ≥ 4, m ≤ 3} is L` = {anbm|n < 4} U {anbm|m > 3}: L` = Universal set - L. L` = Universal set - {anbm|n ≥ 4, m ≤ 3} = (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)* ba(a + b)* Option (D) is giving freedom on constraints on number of a's and number of b's. So, option (D) is correct.
- Option : B
- Explanation : L1 = {0i1j| gcd (i, j) = 1}: There are infinite pair having gcd 1. We can't design FA for such language. That's why L1 is not regular. L2 is any subset of 0*, we can construct FA for any subset of single alphabet. That's why L2 is regular. So, option (B) is correct.
- Option : C
- Explanation : Transmission rate = frame rate * no of bits in a slot. Frame rate = 4000 frames per second # of bits in a slot = 8 bit TDM = 4000 * 8 bps = 32 Kbps. So, option (C) is correct.
