 A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

 41. Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ? a. 22 / 36 b. 12 / 36 c. 14 / 36 d. 6 / 36

 42. In how many ways can 15 indistinguishable fishes be placed into 5 different ponds, so that each pond contains atleast one fish ? a. 1001 b. 3876 c. 775 d. 200

 43. Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg (v) >= n / 2 for each vertex of G (b)  | E(G) | >= 1 / 2 (n-1) (n-2) + 2 edges (c) deg (v) + deg (w) >= n for every v and w not connected by an edge a. (a) and (b) b. (b) and (c) c. (a) and (c) d. (a), (b) and (c)

 44. An all-pairs shortest-paths problem is efficiently solved using : a. Dijkstra' algorithm b. Bellman-Ford algorithm c. Kruskal algorithm d. Floyd-Warshall algorithm

 45. The travelling salesman problem can be solved in : a. Polynomial time using dynamic programming algorithm b. Polynomial time using branch-and-bound algorithm c. Exponential time using dynamic programming algorithm or branch-and-bound algorithm d. Polynomial time using backtracking algorithm

 46. Let f (n) and g(n) be asymptotically non-negative functions. Which of the following is correct? a. 0(f(n)*g(n)) = min(f(n), g(n)) b. 0(f(n)*g(n)) = max(f(n), g(n)) c. 0(f(n)+g(n)) = min(f(n), g(n)) d. 0(f(n)+g(n)) = max(f(n), g(n))

 47. Given the following equalities : E1 : nK+∈ + nK lg n = Ф(nK+∈) for all fixed K and ∈, K ≥ 0 and ∈ > 0. E2 : n32n + 6n23n = O(n32n) Which of the following is true ? a. E1 is correct and E2 is correct b. E1 is correct and E2 is not correct c. E1 is not correct and E2 is correct d. E1 is not correct and E2 is not correct