UTpaper

Free mock tests & test series

Question 115Asked in CIL MT Systems, 26 Mar 2017 (12:30 PM)

Which of the following problem cannot be solved using greedy approach?

  1. A0-1 knapsack
  2. BJob scheduling
  3. CMinimum spanning tree
  4. DHuffman code
Show answerHide answer

Correct answer: (A) 0-1 knapsack

From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)

This is question 115 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.