McqMate

Q. |
## Which of the following algorithms does Stable marriage problem uses? |

A. | gale-shapley algorithm |

B. | dijkstra’s algorithm |

C. | ford-fulkerson algorithm |

D. | prim’s algorithm |

Answer» A. gale-shapley algorithm | |

Explanation: stable marriage problem uses gale-shapley algorithm. maximum flow problem uses ford-fulkerson algorithm. |

791

0

Do you find this helpful?

7

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Which of the following problems is related to stable marriage problem?
- Stable marriage problem is an example of?
- Who formulated a straight forward backtracking scheme for stable marriage problem?
- What is the prime task of the 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.
- 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?
- 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
- The dynamic programming implementation of the maximum sum rectangle problem uses which of the following algorithm?
- You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?