McqMate

Q. |
## Can stable marriage cannot be solved using branch and bound algorithm. |

A. | true |

B. | false |

Answer» B. false | |

Explanation: stable marriage problem can be solved using branch and bound approach because branch and bound follows backtracking scheme with a limitation factor. |

1.2k

0

Do you find this helpful?

9

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the efficiency of Gale-Shapley algorithm used in stable marriage problem?
- The 0-1 Knapsack problem can be solved using Greedy algorithm.
- Problems that cannot be solved by any algorithm are called?
- In what time can the Hamiltonian path problem can be solved using dynamic programming?
- You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- Stable marriage problem is an example of?
- Which of the following algorithms does Stable marriage problem uses?
- Who formulated a straight forward backtracking scheme for stable marriage problem?
- What is the prime task of the stable marriage problem?