- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the prime task of the stable mar...

Q. |
## What is the prime task of the stable marriage problem? |

A. | to provide man optimal solution |

B. | to provide woman optimal solution |

C. | to determine stability of marriage |

D. | to use backtracking approach |

Answer» C. to determine stability of marriage | |

Explanation: the prime task of stable marriage problem is to determine stability of marriage (i.e) finding a man and a woman who prefer each other to others. |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- Which of the following problems is related to stable marriage problem?
- What is the efficiency of Gale-Shapley algorithm used in stable marriage problem?
- Can stable marriage cannot be solved using branch and bound algorithm.
- 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
- Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
- If a problem can be broken into subproblems which are reused several times, the problem possesses property.
- 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