There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem. There are a set of courses in USC, each of them requiring a set of disjointtime intervals. For example, a course could require the time from 9amto 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given anumber K, if it's possible to take at least K courses. Since you want tostudy hard and take courses carefully, you can only take one course at anysingle point in time (i.e. any two courses you choose can't overlap). Showthat the problem is NP-complete, which means that choosing courses isindeed a difficult thing in our life. Use a reduction from the Independentset problem.

The main goal of the course selection problem is to find out whether it is possible to enrol in a…

There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem.

There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem.