# UGC NET COMPUTER SCIENCE SOLVED PAPERS 2017-19 - UGC NET Computer Science November 2017 Paper 3

>>>>>>>>UGC NET Computer Science November 2017 Paper 3

• A

3(x')2 + 4(y')2 = 1  • B

(x'/3)2 + (y'/4)2 = 1  • C

(3x')2 + 4(y')2 = 1  • D

1/3(x')2 + 1/4(y')2 = 1  • A

Coding error, Sampling rate and Amplification  • B

Sampling rate, Coding error and Conditioning  • C

Sampling rate, Aperture time and Coding error  • D

Aperture time, Coding error and Strobing  • Option : C
• Explanation : The three aspects of quantization, programmers generally concerned with are
1. Sampling rate
2. Aperture time
3. Coding error
So, option (C) is correct.

• A

iteration  • B

recursion  • C

the divide and conquer principle  • D

the pigeon - hole principle  • Option : D
• Explanation :
Pigeon-hole principle states that if there are n pigeons fly into m hole and n > m then atleast one hole must contain more then one pigeons. And logic of pumping lemma states that- finite state automaton can assume only a finite number of states and because there are infintely many input sequence, by the pigeon hole principle , there must be atleast one state to which the automata returns over and over again. So, option (D) is correct.

• A

use dynamic scope rules  • B

support dynamic data structures  • C

support recursion  • D

support recursion and dynamic data structures  • Option : B
• Explanation :
Heap allocation is required for the languages which support dynamic data structure. So, option (B) is correct.