Vidyalelo
Data Structure · Q135

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 135

Q135

Which of the following branch and bound strategy leads to depth first search?

A.
LIFO branch and bound
Answer
B.
FIFO branch and bound
C.
Lowest cost branch and bound
D.
Highest cost branch and bound

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board