hw05 - CS 70 Spring 2005 Discrete Mathematics for CS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 70 Discrete Mathematics for CS Spring 2005 Clancy/Wagner HW 5 Due Thursday, February 24th Coverage: This assignment involves topics from the February 15 and 17 lectures. Administrative reminders: We will accept only unformatted text files or PDF files for homework sub- mission. Include your name, login name, section number, and partner list in your submission. Give the command submit hw5 to submit your answers to this assignment. Homework exercises: 1. (8 pts.) College admissions Consider the problem of admitting n students to k colleges. The j th college can admit up to n j students. Each student has an order of preference for the colleges, and each college has an order of preference for the students. A stable admission is an assignment of the students to the colleges where there is no “rogue couple”, that is, no situation where there is a student A who is not admitted to college a , but who prefers a to his/her college and is preferred by a to at least one of a ’s students. Describe how to use the Traditional Matching Algorithm as a subroutine to produce a stable admis-
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

hw05 - CS 70 Spring 2005 Discrete Mathematics for CS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online