- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following problems is relat...

Q. |
## Which of the following problems is related to stable marriage problem? |

A. | choice of school by students |

B. | n-queen problem |

C. | arranging data in a database |

D. | knapsack problem |

Answer» A. choice of school by students | |

Explanation: choice of school by students is the most related example in the given set of options since both school and students will have a preference list. |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following algorithms does Stable marriage problem uses?
- 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
- Which of the following problems is equivalent to the 0-1 Knapsack problem?
- Which of the following problems can be solved using the longest subsequence problem?

Login to Continue

It will take less than 2 minutes

Report MCQ