Question

Algorithms Problem:

Q1. Consider the following real world scenario where the study of algorithms exists a list of patients that are in dire need of a new kidney. Each patient has a blood type that must be matched exactly with an available donor kidney OR the donor kidney must be of type O-positive. In many cases, people have a loved one in need of a kidney and are willing to donate, but fail to match the required blood type. That kidney could still be donated, but would go to a different patient on the list. At one time you may have multiple people all willing to donate at once, so a small subset of kidneys may become available. But these kidney's need to be matched to patients in a compatible way. Since this is a serious issue with people's lives on saves lives. There sum of money) to develop an the line, hospital administrators have hired you (with a very large algorithm that matches kidney donors to kidney receivers in a compatible way. Describe your approach to solving this problem. Also state how this problem computer can be represented in a

Answer 1

Ansuen 1. START type :Cif A data is available) READ A kidney Donan Pakients no 1 Repeat fnom i=o to f CPabients Reuitype matches pona typethen Donate pabents 3. Repaat fnon ieo to 1 Repeat fnon j zo to nodonons. CPatientsti).ReOuixed type mat ches Pora fi] typo) TF Patients Li,Dond C 3 then ponate, Perove 4-STOP