 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.

 31. ________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution. a. Best first search b. Goal stack planning c. Alpha-beta pruning procedure d. Min-max search

 32. Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? a. Alternate optimality b. Infeasibility c. Unboundedness d. All of the above

 33. The given maximization assignment problem can be converted into a minimization problem by a. subtracting each entry in a column from the maximum value in that column b. subtracting each entry in the table from the maximum value in that table c. adding each entry in a column from the maximum value in that column d. adding maximum value of the table to each entry in the table

 34. Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18). (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) a. 40 b. 38 c. 32 d. 30

 35. Match the following: List-I List-II a. Absurd i. Clearly impossible being contrary to some evident truth. b. Ambiguous ii. Capable of more than one interpretation or meaning. c. Axiom iii. An assertion that is accepted and used without a proof. d. Conjecture iv. An opinion Preferably based on some experience or wisdom. Codes: a b c d a. i ii iii iv b. i iii iv ii c. ii iii iv i d. ii i iii iv

 36. Consider following two rules R1 and R2 in logical reasoning in Artificial Intelligence (AI): a. Only R1 is correct. b. Only R2 is correct. c. Both R1 and R2 are correct. d. Neither R1 nor R2 is correct.

 37. Consider the following AO graph. Which is the best node to expand next by AO* algorithm? a. A b. B c. C d. B and C