UGC NET Previous Year Papers

Computer Science Paper II

December 2010

1.   The number of integers between 1 and 250 that are divisible by 2, 5 and 7 is

(A) 2      

(B) 3

(C) 5      

(D) 8

Ans: (B)


2. An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are

(A) all of even degree

(B) all of odd degree

(C) of any degree       

(D) even in number

Ans: (A)


3. A partially ordered set is said to be a lattice if every two elements in the set have

(A) a unique least upper bound

(B) a unique greatest lower bound

(C) both (A) and (B)

(D) none of the above

Ans: (C)


4. The minimum number of edges in a connected graph with ‘n’ vertices is equal to

(A) n (n–1) 

(B) \frac{n (n-1)}{2}/ugc-net-previous-year-papers-computer-science-paper-ii-dec-2010

(C) n2                

(D) n–1

Ans: (D)


5. Consider the problem of connecting 19 lamps to a single electric outlet by using extension cords each of which has four outlets. The number of extension cords required is

(A) 4                  

(B) 5

(C) 6                  

(D) 7

Ans: (C)


6. The decimal number equivalent of (4057.06)8 is

(A) 2095.75                  

(B) 2095.075

(C) 2095.937               

(D) 2095.0937

Ans: (D)




(A) A⊕B

(B) AʘB

(C) (A⊕B)ʘA

(D) (AʘB) ⊕ A

Ans: (B)


8. An astable multivibrator has

(A) one stable state

(B) two stable states

(C) no stable states

(D) none of these

Ans: (C)


9. 12-bit 2’s complement of –73.75 is

(A) 01001001.1100

(B) 11001001.1100

(C) 10110110.0100

(D) 10110110.1100

Ans: (C)


10. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is

(A) 0011110                 

(B) 0101110

(C) 0010110                

(D) 0011100

Ans: (A)


Pages: 1 2 3 4 5