The previous year question paper of Computer Science subject of National Eligibility Test (NET) University Grants Commission (UGC) is as follows:

Which of the following statement(s) is/are false?
(a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree.
(b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree.
(c) A complete graph (Kn) has a Hamilton Circuit whenever n≥3
(d) A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite.
Codes:
(A) (a) only (B) (b) and (c)
(C) (c) only (D) (d) only

Which of the following is/are not true?
(a) The set of negative integers is countable.
(b) The set of integers that are multiples of 7 is countable.
(c) The set of even integers is countable.
(d) The set of real numbers between 0 and 1/2 is countable.
(A) (a) and (c) (B) (b) and (d)
(C) (b) only (D) (d) only

Consider the graph given below:
The two distinct sets of vertices, which make the graph bipartite are:
(A) (v1, v4, v6); (v2, v3, v5, v7, v8) (B) (v1, v7, v8); (v2, v3, v5, v6)
(C) (v1, v4, v6, v7); (v2, v3, v5, v8) (D) (v1, v4, v6, v7, v8); (v2, v3, v5)

A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2, ...,n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful?
Codes:
(A) (a) and (b) (B) (b) and (c)
(C) (a) and (c) (D) (a), (b) and (c)


Which of the following arguments are not valid?
(a) “If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”.
(b) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”.
(c) If n is a real number such that n>1, then n2>1. Suppose that n2>1, then n>1.
Codes:
(A) (a) and (c) (B) (b) and (c)
(C) (a), (b) and (c) (D) (a) and (b)

UGC NET Computer Science Question Paper