UTpaper

Free mock tests & test series

Question 49Asked in UGC NET Computer Science, June 2015 (Paper II & III, Selected Questions)

Which of the following statements is true for branch - and - bound search?

  1. AUnderestimates of remaining distance may cause deviation from optimal path
  2. BOverestimates can't cause right path to be overlooked.
  3. CDynamic programming principle can be used to discard redundant partial paths.
  4. DAll of the above
Show answerHide answer

Correct answer: (C) Dynamic programming principle can be used to discard redundant partial paths.

Explanation

Branch and bound is an algorithm design paradigm for discrete and combinatorial optimization problems; it systematically enumerates candidate solutions by state space search. In branch and bound, the dynamic programming principle can be used to discard redundant partial paths.

From UGC NET Computer Science PYQ, June 2015 (Paper II & III, Selected Questions)

This is question 49 of UGC NET Computer Science PYQ, June 2015 (Paper II & III, Selected Questions). 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.