Data Structures & Algorithms Multiple Choice Questions on “Branch and Bound”.
1. Branch and bound is a __________ Answer: a 2. Which of the following is not a branch and bound strategy to generate branches? 3. Which data structure is used for implementing a LIFO branch and bound strategy? 4. Which data structure is used for implementing a FIFO branch and bound strategy? Answer: b 5. Which data structure is most suitable for implementing best first branch and bound strategy? Answer: c 6. Which of the following branch and bound strategy leads to breadth first search? 7. Which of the following branch and bound strategy leads to depth first search? Answer: a 8. Both FIFO branch and bound strategy and backtracking leads to depth first search. 9. Both LIFO branch and bound strategy and backtracking leads to depth first search. Answer: a 10. Choose the correct statement from the following. Answer: c 11. Which of the following can traverse the state space tree only in DFS manner? Answer: d & Algorithms. here is
a) problem solving technique
b) data structure
c) sorting algorithm
d) type of tree
Clarification: Branch and bound is a problem solving technique generally used for solving combinatorial optimization problems. Branch and bound helps in solving them faster.
a) LIFO branch and bound
b) FIFO branch and bound
c) Lowest cost branch and bound
d) Highest cost branch and bound
Answer: d
Clarification: LIFO, FIFO and Lowest cost branch and bound are different strategies to generate branches. Lowest cost branch and bound helps us find the lowest cost path.
a) stack
b) queue
c) array
d) linked list
Answer: a
Clarification: Stack is the data structure is used for implementing LIFO branch and bound strategy. This leads to depth first search as every branch is explored until a leaf node is discovered.
a) stack
b) queue
c) array
d) linked list
Clarification: Queue is the data structure is used for implementing FIFO branch and bound strategy. This leads to breadth first search as every branch at depth is explored first before moving to the nodes at greater depth.
a) stack
b) queue
c) priority queue
d) linked list
Clarification: Priority Queue is the data structure is used for implementing best first branch and bound strategy. Dijkstra’s algorithm is an example of best first search algorithm.
a) LIFO branch and bound
b) FIFO branch and bound
c) Lowest cost branch and bound
d) Highest cost branch and bound
Answer: b
Clarification: LIFO, FIFO and Lowest cost branch and bound are different strategies to generate branches. FIFO branch and bound leads to breadth first search.
a) LIFO branch and bound
b) FIFO branch and bound
c) Lowest cost branch and bound
d) Highest cost branch and bound
Clarification: LIFO, FIFO and Lowest cost branch and bound are different strategies to generate branches. LIFO branch and bound leads to depth first search.
a) true
b) false
Answer: b
Clarification: FIFO branch and bound leads to breadth first search. Whereas backtracking leads to depth first search.
a) true
b) false
Clarification: Both backtrackings as well as branch and bound are problem solving algorithms. Both LIFO branch and bound strategy and backtracking leads to depth first search.
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
d) backtracking divides a problem into at least 2 new restricted sub problems
Clarification: Both backtracking as well as branch and bound are problem solving algorithms. Branch and bound is less efficient than backtracking. Branch and bound divides a problem into at least 2 new restricted sub problems.
a) branch and bound
b) dynamic programming
c) greedy algorithm
d) backtracking
Clarification: Both backtracking as well as branch and bound are problem solving algorithms. Branch and bound can traverse in DFS as well as BFS manner whereas backtracking only traverses in DFS manner.