Stable Marriage Problem Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
Stable marriage problem is an example of?
Branch and bound algorithm
Divide and conquer algorithm
Question 1 Explanation:
Stable marriage problem is an example for recursive algorithm because it recursively uses backtracking algorithm to find an optimal solution.
Which of the following algorithms does Stable marriage problem uses?
Question 2 Explanation:
Stable marriage problem uses Gale-Shapley algorithm. Maximum flow problem uses Ford-Fulkerson algorithm. Prim's algorithm involves minimum spanning tree.
An optimal solution satisfying men's preferences is said to be?
Question 3 Explanation:
An optimal solution satisfying men's preferences are said to be man optimal. An optimal solution satisfying woman's preferences are said to be woman optimal.
When a free man proposes to an available woman, which of the following happens?
She will think and decide
She will reject
She will replace her current mate
She will accept
Question 4 Explanation:
When a man proposes to an available woman, she will accept his proposal irrespective of his position on his preference list.
If there are n couples who would prefer each other to their actual marriage partners, then the assignment is said to be unstable.
Question 5 Explanation:
If there are n couples such that a man and a woman are not married, and if they prefer each other to their actual partners, the assignment is unstable.
There are 5 questions to complete.