This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 50 marks CS 601 Quiz 1 8:30-9:30, 26/8/9 You have about one minute per mark. Keep this in mind while deciding how long you need to write. Crisp answers will receive more credit. You need not repeat anything proved in the book or in class (just state as much), unless the question explicitly asks exactly that. Problem 1: [20 marks] At the beginning of every semester, we need to allocate TAs to courses. For each course c , we are given the number of TAs n c that are needed. For each TA we are given the set of courses for which he/she can serve as a TA. For each TA we are given the year (MTech1 or MTech 2), and the hostel (1 through 13). Also for each course, c we are given an additional number s c which denotes the number of TAs that are required to be from MTech2. Finally it is known that the total number of TAs T and total number needed N = P c n c satisfy the following: N T N + 13. Because the number of TAs could be larger than what is required by the courses, some TAs will not be assigned to any course. However, it is deemed desirable that at most 1 TA from each hostel be unassigned. Give an algorithm to nd a TA allocation (whenever possible) by expressing this as an instance of an appropriate version of the max ow problem. Do not describe the max ow algorithm, but do state the total time required for the TA allocation.do state the total time required for the TA allocation....
View Full Document
- Summer '09
- Algorithms, Trigraph, Grammatical number, independent set, Perfect graph