UGC NET: Computer Science Paper 3 (2012 December)

11. The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity? (n and m are no. of nodes and edges respectively)

a. Bellman Ford algorithm              1. O (m log n)

b. Kruskals algorithm                      2. O (n3)

c. Floyd Warshall algorithm            3. O(mn)

d. Topological sorting                     4. O(n + m)

Codes:

    a b c d

(A) 3 1 2 4

(B) 2 4 3 1

(C) 3 4 1 2

(D) 2 1 3 4

Answer: (A)



12. Let V1 = 2I – J + K and V2 = I + J – K, then the angle between V1 & V2 and a vector perpendicular to both V1 & V2 shall be:

(A) 90০ and (–2I + J – 3K)

(B) 60০ and (2I + J + 3K)

(C) 90০ and (2I + J – 3K)

(D) 90০ and (–2I – J + 3K)

Answer: (D)

Answer: (C)

Answer: (C)



15. In classful addressing, an IP address 123.23.156.4 belongs to ______ class format.

(A) A

(B) B

(C) C

(D) D

Answer: (A)



16. The Mandelbrot set used for the construction of beautiful images is based on the following transformation:

xn + 1= x2n+ z

Here,

(A) Both x & z are real numbers.

(B) Both x & z are complex numbers.

(C) x is real & z is complex.

(D) x is complex & z is real.

Answer: (B)



17. Which of the following permutations can be obtained in the output using a stack of size 3 elements assuming that input, sequence is 1, 2, 3, 4, 5?

(A) 3, 2, 1, 5, 4

(B) 5, 4, 3, 2, 1

(C) 3, 4, 5, 2, 1

(D) 3, 4, 5, 1, 2

Answer: (C)



18. In a Linear Programming Problem, suppose there are 3 basic variables and 2 non-basic variables, then the possible numbers of basic solutions are

(A) 6

(B) 8

(C) 10

(D) 12

Answer: (C)

Answer: (C)

Answer: (C)



Next Questions: {1} - {2} - {3} - {4}