# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

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

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Stable marriage problem is an example of?

Branch and bound algorithm | |

Backtracking algorithm | |

Greedy 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.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which of the following algorithms does Stable marriage problem uses?

Gale-Shapley algorithm | |

Dijkstra's algorithm | |

Ford-Fulkerson algorithm | |

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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

An optimal solution satisfying men's preferences is said to be?

Man optimal | |

Woman optimal | |

Pair optimal | |

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 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

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.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

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

True | |

False |

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.