Answer Happy

Automatic Course Assignment [Keywords: General Purpose; Max Number: 4]
o This is an extension to the previous project, but it could be an independent project if the
number of members is the minimum.
o You are required to assign the TAs to the courses to teach during a semester.
o Assume you have a ranked list of courses to teach for each TA. Also, for each course, you
have a ranked list of TAs sorted based on their skill to teach that particular course.
o Your algorithm should assign each TA to teach one course such that each course should
have the best possible TA in the assignment.
▪ Example: assume we have two courses {304, 207}, and two TAs {A, B}
▪ A and B both prefer to teach 304 than 207.
▪ Nevertheless, A is more skillful to teach both 304 and 207 than B.
▪ Then the assignment should be (A,304) (B,207)
o Analyze your algorithm, proving, showing that each course will have the best possible TA
to teach a particular course based on their skill.
o Then, add the option for your algorithm to make multiple TAs teach a single course, and
one TA could teach multiple courses
In this case, each course will have a maximum number of TAs, and each TA will
have a maximum number of courses.