Differentiate backtracking and Bunch and Bound.
Subject Algorithm Design
NU Year Set: 2.(c) Marks: 4 Year: 2010

[1] It is used to find all possible solutions available to the problem.
[2] It traverse tree by DFS(Depth First Search).
[3] It realizes that it has made a bad choice & undoes the last choice by backing up.
[4] It search the state space tree until it found a solution.
[5] It involves feasibility function.

[1] It is used to solve optimization problem.
[2] It may traverse the tree in any manner, DFS or BFS.
[3] It realizes that it already has a better optimal solution that the pre-solution leads to so it abandons that pre-solution.
[4] It completely searches the state space tree to get optimal solution.
[5] It involves bounding function.

Read more on Brainly.in - https://brainly.in/question/3162482#readmore

Login to post your comment.