Which of the following represents the stable matching produced by the Gale-Shapley algorithm when Group P makes the proposals?  

Consider three students (A, B, C) matching with three mentors (X, Y, Z). Their preference lists are as follows: Students (Group P): A: Y, X, Z B: X, Y, Z C: X, Z, Y Mentors (Group R): X: B, C, A Y: C, A, B Z: A, B, C Current Matching M: (A, Z) (B, Y) (C, X) Question: Which of the following pairs is unstable with respect to the matching M?

To prove stability, we consider a pair p-r NOT matched in M. If p never proposed to r, what can we conclude?

True or False: The Gale-Shapley algorithm always produces the same stable matching, regardless of which side proposes.

What is the stable matching problem?

Consider the following preferences: Companies: A: 1 > 2 > 3 B: 2 > 3 > 1 C: 3 > 1 > 2 Candidates: 1: B > C > A 2: C > A > B 3: A > B > C How many stable matchings exist for this instance?

Why might a stable matching NOT exist in the Stable Roommate Problem?

What is the term for converting a superclass reference to a subclass reference?

Which of the following are valid components of a try-catch-finally block? (Select all that apply)

High cohesion and loose coupling are desirable characteristics of a well-designed object-oriented system.