Q83
Choose the correct statement from the following.
A.
branch and bound is more efficient than backtracking
B.
branch and bound is not suitable where a greedy algorithm is not applicable
C.
branch and bound divides a problem into at least 2 new restricted sub problems
AnswerD.
backtracking divides a problem into at least 2 new restricted sub problems
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board