- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Can stable marriage cannot be solved usi...

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

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- 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?
- Which of the following problems is related to stable marriage problem?
- 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

Login to Continue

It will take less than 2 minutes

Report MCQ