Question: Consider the following scheduling problem. You are given a list of final exams F 1 , . . . , F k to be scheduled,

Consider the following scheduling problem. You are given a list of final exams F1, . . . , Fk to be scheduled, and a list of students S1, . . . , Sl. Each student is taking some specified subset of these exams. You must schedule these exams into slots so that no student is required to take two exams in the same slot. The problem is to determine if such a schedule exists that uses only h slots. Formulate this problem as a language and show that this language is NP-complete.

Step by Step Solution

3.54 Rating (154 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

This problem can be formulated as a language as follows Given a list of final exams F1 Fk and a list ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Introduction theory computation Questions!