# Stable Marriage Problem Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 1
Stable marriage problem is an example of?
 A Branch and bound algorithm B Backtracking algorithm C Greedy algorithm D 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.

 Question 2
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

Question 2 Explanation:
Stable marriage problem uses Gale-Shapley algorithm. Maximum flow problem uses Ford-Fulkerson algorithm. Prim's algorithm involves minimum spanning tree.

 Question 3
An optimal solution satisfying men's preferences is said to be?
 A Man optimal B Woman optimal C Pair optimal D Best optimal

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.

 Question 4
When a free man proposes to an available woman, which of the following happens?
 A She will think and decide B She will reject C She will replace her current mate D 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.

 Question 5
If there are n couples who would prefer each other to their actual marriage partners, then the assignment is said to be unstable.
 A True B False