UGC NET Previous Year Papers
Computer Science – Paper II
1. Which of the following does not define a tree?
(A) A tree is a connected acyclic graph.
(B) A tree is a connected graph with n-1 edges where ’n’ is the number of vertices in the graph.
(C) A tree is an acyclic graph with n-1 edges where ’n’ is the number of vertices in the graph.
(D) A tree is a graph with no cycles.
2. The complexity of Kruskal’s minimum spanning tree algorithm on a graph with ‘n’ nodes and ‘e’ edges is :
(B) O(n log n)
(C) O(e log n)
3. If a code is t-error correcting, the minimum Hamming distance is equal to:
4. The set of positive integers under the operation of ordinary multiplication is:
(A) not a monoid
(B) not a group
(C) a group
(D) an Abelian group
5. In a set of 8 positive integers, there always exists a pair of numbers having the same remainder when divided by:
6. An example of a tautology is:
(A) x v y
(B) x v (~y)
(C) x v (~x)
7. Among the logic families RTL, TTL, ECL and CMOS, the fastest family is:
8. The octal equivalent of the hexadecimal number FF is:
9. The characteristic equation of a T flip flop is given by:
10. The idempotent law in Boolean algebra says that: