Department of Computer Science and Engineering
CS7200: Algorithm Design and Analysis
Fall 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.
NAME
UID
This study source was downloaded by 100000899606070 from CourseHero.com on 10-07-2025 01:38:23 GMT -05:00
https://www.coursehero.com/file/80660628/midterm-sample1pdf/
, 1) [Stable Marriage Problem 3 pts + 6 pts + 6 pts]
Consider an instance of the stable marriage problem with men M = {m1, m2,
m3}, women W = {w1, w2, w3} and the priority lists:
m1: w2, w1, w3; m2: w3, w2, w1; m3: w1, w3, w2;
w1: m2, m1, m3; w2: m3, m2, m1; w3: m1, m3, m2.
(a) How many perfect matchings are possible?
(b) Is the following mapping stable?
w1-m1, w2-m2, w3-m3
(c) Determine a women-optimal solution if one exists.
This study source was downloaded by 100000899606070 from CourseHero.com on 10-07-2025 01:38:23 GMT -05:00
https://www.coursehero.com/file/80660628/midterm-sample1pdf/