Vidyalelo
Data Structure · Q50

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 50

Q50

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

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

Answer: Option B

Solution

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