## Solved Questions Paper-2 UGC-NET Computer Science January 2017

1. | Consider a sequence F00 defined as: Then what shall be the set of values of the sequence F00? | ||||||||||

A. | (1, 110, 1200) | ||||||||||

B. | (1, 110, 600, 1200) | ||||||||||

C. | (1, 2, 55, 110, 600, 1200) | ||||||||||

D. | (1, 55, 110, 600, 1200) | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

2. | Match the following:
Codes: a b c d | ||||||||||

A. | i ii iii iv | ||||||||||

B. | i iii iv ii | ||||||||||

C. | ii iii iv i | ||||||||||

D. | ii i iii iv | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

3. | The functions mapping R into R are defined as: f(x) = x ^{3}-4x, g(x)=1/(x^{2}+1) and h(x)=x^{4}
Then find the value of the following composite functions:hog(x) and hogof(x) | ||||||||||

A. | (A) (x^{2}+1)^{4} and [(x^{3}-4x)^{2}+1]^{4}
| ||||||||||

B. | (x^{2}+1)^{4} and [(x^{3}-4x)2+1]^{-4}
| ||||||||||

C. | (x^{2}+1)^{-4} and [(x^{3}-4x)^{2}+1]^{4}
| ||||||||||

D. | (x^{2}+1)^{?4} and [(x^{3}-4x)^{2}+1]^{-4} | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

4. | How many multiples of 6 are there between the following pairs of numbers? 0 and 100 and -6 and 34 | ||||||||||

A. | 16 and 6 | ||||||||||

B. | 17 and 6 | ||||||||||

C. | 17 and 7 | ||||||||||

D. | 16 and 7 | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

5. | Consider a Hamiltonian Graph G with no loops or parallel edges and with |V(G)|=n?3. Then which of the following is true? | ||||||||||

A. | deg(v) ? n/2 for each vertex v. | ||||||||||

B. | |E(G)| ? 1/2(n-1)(n-2)+2 | ||||||||||

C. | deg(v)+deg(w) ? n whenever v and w are not connected by an edge. | ||||||||||

D. | All of the above | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

6. | In propositional logic if (P?Q)?(R?S) and (P?R) are two premises such that Y is the premise: | ||||||||||

A. | P?R | ||||||||||

B. | P?S | ||||||||||

C. | Q?R | ||||||||||

D. | Q?S | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

7. | ECL is the fastest of all logic families. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ............... | ||||||||||

A. | Race condition | ||||||||||

B. | Saturation | ||||||||||

C. | Delay | ||||||||||

D. | High impedance | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

8. | A binary 3-bit down counter uses J-K flip-flops, FFi with inputs Ji, Ki and outputs Qi, i=0,1,2 respectively. The minimized expression for the input from following, is I. J0=K0=0 II. J0=K0=1 III. J1=K1=Q0 IV. J1=K1=Q'0 V. J2=K2=Q1Q0 Vl. J2=K2=Q'1Q'0 | ||||||||||

A. | I, III, V | ||||||||||

B. | I, IV, VI | ||||||||||

C. | II, III, V | ||||||||||

D. | II, IV, VI | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

9. | Convert the octal number 0.4051 into its equivalent decimal number. | ||||||||||

A. | 0.5100098 | ||||||||||

B. | 0.2096 | ||||||||||

C. | 0.52 | ||||||||||

D. | 0.4192 | ||||||||||

View/Hide Ans | |||||||||||

Explanation | |||||||||||

10. | The hexadecimal equivalent of the octal number 2357 is: | ||||||||||

A. | 2EE | ||||||||||

B. | 2FF | ||||||||||

C. | 4EF | ||||||||||

D. | 4FE | ||||||||||

View/Hide Ans | |||||||||||

Explanation |

Author Does Not claim of any answer these answers are as per expert opinion