• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

UGC NET CS 2017 Jan - II

Question 1

Consider a sequence F00 defined as : F00(0) = 1, F00(1) = 1 F00(n) = 10 ∗ F00(n – 1) + 100 F00(n – 2) for n ≥ 2 Then what shall be the set of values of the sequence F00 ?
  • (1, 110, 1200)
  • (1, 110, 600, 1200)
  • (1, 2, 55, 110, 600, 1200)
  • (1, 55, 110, 600, 1200)

Question 2

Match the following : 2
  • (1)
  • (2)
  • (3)
  • (4)

Question 3

The functions mapping R into R are defined as : f(x) = x3 – 4x, g(x) = 1/(x2 + 1) and h(x) = x4. Then find the value of the following composite functions : hog(x) and hogof(x)
  • (x2 + 1)4 and [(x3 – 4x)2 + 1]4
  • (x2 + 1)4 and [(x3 – 4x)2 + 1]-4
  • (x2 + 1)-4 and [(x3 – 4x)2 + 1]4
  • (x2 + 1)-4 and [(x3 – 4x)2 + 1]-4

Question 4

How many multiples of 6 are there between the following pairs of numbers ? 0 and 100 and –6 and 34

  • 16 and 6

  • 17 and 6

  • 17 and 7

  • 16 and 7

Question 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 ?
  • deg(v) ≥n/2 for each vertex v.
  • |E(G)| ≥1/2(n – 1) (n – 2) + 2
  • deg (v) + deg(w) ≥ n whenever v and w are not connected by an edge
  • All of the above

Question 6

In propositional logic if (P → Q) ∧ (R → S) and (P ∨ R) are two premises such that (P → Q) ∧ (R → S) P ∨ R Y Y is the premise :
  • P ∨ R
  • P ∨ S
  • Q ∨ R
  • Q ∨ S

Question 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 ____.
  • Race condition
  • Saturation
  • Delay
  • High impedance

Question 8

Convert the octal number 0.4051 into its equivalent decimal number.
  • 0.5100098
  • 0.2096
  • 0.52
  • 0.4192

Question 9

The hexadecimal equivalent of the octal number 2357 is :
  • 2EE
  • 2FF
  • 4EF
  • 4FE

Question 10

Which of the following cannot be passed to a function in C++ ?
  • Constant
  • Structure
  • Array
  • Header file

There are 49 questions to complete.

Last Updated :
Take a part in the ongoing discussion