Department of Computer Science and Engineering
CS7200: Algorithm Design and Analysis
Summer 2019 Midterm (50 pts) Prasad
Write the answers only in the space provided. Use the “blank” sides of each
page for scratch work. Be concise, precise and legible.
Suggestion: Attempt the problems in the order of your comfort-level and
familiarity. If you feel you are stuck, move onto other problems, complete them,
and then return so that you attempt all the problems.
NAME
UID
This study source was downloaded by 100000899606070 from CourseHero.com on 10-07-2025 01:35:36 GMT -05:00
https://www.coursehero.com/file/80660659/midterm-sample2pdf/
, 1) [Stable Matching Problem: 5 + 5 pts]
Consider an instance of the stable marriage problem with the priority lists:
Albert Diane Emily Fergie
Bradley Emily Diane Fergie
Charles Diane Emily Fergie
Diane Bradley Albert Charles
Emily Albert Bradley Charles
Fergie Albert Bradley Charles
(a) Is {Albert-Fergie, Bradley-Emily, Charles-Diane} a stable matching? If yes,
then provide an argument or show which pairs would you test for, for
thorough verification. If no, provide a pair that causes instability.
(b) Determine men-optimal solution if there exists a stable matching.
This study source was downloaded by 100000899606070 from CourseHero.com on 10-07-2025 01:35:36 GMT -05:00
https://www.coursehero.com/file/80660659/midterm-sample2pdf/