- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Stable marriage problem is an example of...

Q. |
## Stable marriage problem is an example of? |

A. | branch and bound algorithm |

B. | backtracking algorithm |

C. | greedy algorithm |

D. | divide and conquer algorithm |

Answer» B. backtracking algorithm | |

Explanation: stable marriage problem is an example for recursive algorithm because it recursively uses backtracking algorithm to find an optimal solution. |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- 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?
- Subset sum problem is an example of NP- complete problem.
- If a problem can be broken into subproblems which are reused several times, the problem possesses property.

Login to Continue

It will take less than 2 minutes

Report MCQ