# UGC NET COMPUTER SCIENCE SOLVED PAPERS 2014-16 - UGC NET Computer Science Paper 3 July 2016

>>>>>>>>UGC NET Computer Science Paper 3 July 2016

• A

Application oriented features  • B

Efficiency and Readability  • C

Software development  • D

Hardware maintenance cost  • 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.

• 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.

• A

L1 is regular and L2* is not regular  • B

L1 is not regular and L2* is regular  • C

Both L1 and L2* are regular languages  • D

Both L1 and L2* are not regular languages  • 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.

• A

64 Kbps  • B

32 Mbps  • C

32 Kbps  • D

64 MbpS  • 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.