During the internship season m tech companies are looking to hire CS undergrads, each company has k number of available positions. There are also n CS undergrads, each interested in joining one of the companies. After all the interviews each company has rankings of students in order of preference, and each student has a ranking of companies in order of preference. We can assume that there are more internship slots available than the number of students. (This means that at the end not all slots will be filled.) Describe an algorithm that finds a stable assignment of students to companies. That is, each student will get assigned to one company and the resulting matching is stable. In your answer make sure to follow the guidelines of solving an algorithmic problem, as described above.
During the internship season m tech companies are looking to hire CS undergrads, each company has k number of available positions. There are also n CS undergrads, each interested in joining one of the companies. After all the interviews each company has rankings of students in order of preference, and each student has a ranking of companies in order of preference. We can assume that there are more internship slots available than the number of students. (This means that at the end not all slots will be filled.) Describe an algorithm that finds a stable assignment of students to companies. That is, each student will get assigned to one company and the resulting matching is stable. In your answer make sure to follow the guidelines of solving an algorithmic problem, as described above.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education