UGC NET CS Dec 2018

UGC NET JRF Computer Science · 2018 · with answers and explanations

questions
7
Total marks
14
Duration
180 minutes
Negative marking
No

Subjects: Computer Science

Question 1

Computer Science · 2 marks

The host is connected to a department network which is a part of a university network. The university network, in turn, is part of the internet. The largest network, in which the Ethernet address of the host is unique, is

  1. A.The university network
  2. D.The department network
  3. C.The subnet to which the host belongs
  4. B.The Internet

Correct answer: D

Explanation: Ethernet (MAC) addresses are unique within a LAN segment, which corresponds to the department network.

Question 2

Computer Science · 2 marks

Which of the following problem is decidable for recursive language (L)?

  1. D.Is L = Sigma*?
  2. C.Is L = R, where R is given regular set?
  3. B.Is w in L, where w is a string?
  4. A.Is L = empty set?

Correct answer: B

Explanation: Membership testing (whether a string w belongs to recursive language L) is decidable. Emptiness, equivalence with regular sets, and universality are undecidable for recursive languages.

Question 3

Computer Science · 2 marks

In Linux operating system environment, the command used to print a file is

  1. D.pr
  2. C.ptr
  3. B.lpr
  4. A.print

Correct answer: B

Explanation: In Linux, 'lpr' (line printer remote) is the command used to submit files for printing.

Question 4

Computer Science · 2 marks

In mathematical logic, which of the following are statements? (i) There will be snow in January (ii) What is the time now? (iii) Today is Sunday (iv) You must study Discrete Mathematics

  1. C.(i) and (iii)
  2. D.(ii) and (iv)
  3. B.(i) and (ii)
  4. A.(iii) and (iv)

Correct answer: C

Explanation: In logic, a statement (proposition) must be declarative and have a definite truth value. (i) and (iii) are declarative. (ii) is a question and (iv) is a command.

Question 5

Computer Science · 2 marks

Suppose that everyone in a group of N people wants to communicate secretly with (N-1) other people using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is

  1. D.(N-1)^2
  2. C.N(N-1)/2
  3. B.N(N-1)
  4. A.2N

Correct answer: C

Explanation: Each pair of people needs a unique symmetric key. The number of pairs is C(N,2) = N(N-1)/2.

Question 6

Computer Science · 2 marks

The second smallest of n elements can be found with how many comparisons in worst case?

  1. D.3n/2
  2. C.lg n
  3. B.n - 1
  4. A.n + ceil(lg n) - 2

Correct answer: A

Explanation: Finding the minimum takes n-1 comparisons. The second smallest must have lost only to the minimum, and at most ceil(lg n) elements lost to the minimum in a tournament, requiring ceil(lg n)-1 more comparisons. Total = n + ceil(lg n) - 2.

Question 7

Computer Science · 2 marks

The clustering index is defined on the fields which are of type

  1. D.Non-key and non-ordering
  2. C.Non-key and ordering
  3. B.Key and non-ordering
  4. A.Key and ordering

Correct answer: C

Explanation: A clustering index is defined on a non-key field that is the ordering field of the file. It groups records with the same value together.

View all papers — UGC NET JRF Computer Science

Practice this paper with a timer

Attempt it online, get scored instantly, and see which subjects are costing you marks.

Start practising free