Engineering Questions with Answers - Multiple Choice Questions

Home » MCQs » Chemical Engineering » Branch and Bound MCQ’s

# Branch and Bound MCQ’s

Branch and bound is a __________

a) problem solving technique

b) data structure

c) sorting algorithm

d) type of tree

**
View Answer**

Answer: a

Explanation: Branch and bound is a problem solving technique generally used for solving combinatorial optimization problems. Branch and bound helps in solving them faster.

Which of the following is not a branch and bound strategy to generate branches?

a) LIFO branch and bound

b) FIFO branch and bound

c) Lowest cost branch and bound

d) Highest cost branch and bound

**
View Answer**

Explanation: 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.

Which data structure is used for implementing a LIFO branch and bound strategy?

a) stack

b) queue

c) array

d) linked list

**
View Answer**

Answer: a

Explanation: 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.

Which data structure is used for implementing a FIFO branch and bound strategy?

a) stack

b) queue

c) array

d) linked list

**
View Answer**

Answer: b

Explanation: 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.

Which data structure is most suitable for implementing best first branch and bound strategy?

a) stack

b) queue

c) priority queue

d) linked list

**
View Answer**

Answer: c

Explanation: 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.

Which of the following branch and bound strategy 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

**
View Answer**

Answer: b

Explanation: LIFO, FIFO and Lowest cost branch and bound are different strategies to generate branches. FIFO branch and bound leads to breadth first search.

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

a) LIFO branch and bound

b) FIFO branch and bound

c) Lowest cost branch and bound

d) Highest cost branch and bound

**
View Answer**

Answer: a

Explanation: LIFO, FIFO and Lowest cost branch and bound are different strategies to generate branches. LIFO branch and bound leads to depth first search.

Both FIFO branch and bound strategy and backtracking leads to depth first search.

a) true

b) false

**
View Answer**

Answer: b

Explanation: FIFO branch and bound leads to breadth first search. Whereas backtracking leads to depth first search.

Both LIFO branch and bound strategy and backtracking leads to depth first search.

a) true

b) false

**
View Answer**

Answer: a

Explanation: 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.

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

d) backtracking divides a problem into at least 2 new restricted sub problems

**
View Answer**

Answer: c

Explanation: 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.

Which of the following can traverse the state space tree only in DFS manner?

a) branch and bound

b) dynamic programming

c) greedy algorithm

d) backtracking

**
View Answer**

Answer: d

Explanation: 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.