1. Suppose you are given a set of tasks with specific start and finish time. Provide...

  

Transcribed Image Text:

1. Suppose you are given a set of tasks with specific start and finish time. Provide a formal definition to the Interval Scheduling Problem where you need to pick the most number of tasks without any (time) overlaps or conflicts. (1) 2. Prove that the greedy choice of Earliest Finish Time provides an optimal solution for such interval scheduling problem (using definition from 1). (5) 3. Lets assume that these tasks were also assigned different weights which denotes the importance of the corresponding task. Now, if you were to find the subset of mutually compatible tasks that provides the maximum cumulative weights, describe whether the same greedy choice of Earliest Finish Time will work or not? If it does not, then what method can be feasible, briefly explain why. (4) 1. Suppose you are given a set of tasks with specific start and finish time. Provide a formal definition to the Interval Scheduling Problem where you need to pick the most number of tasks without any (time) overlaps or conflicts. (1) 2. Prove that the greedy choice of Earliest Finish Time provides an optimal solution for such interval scheduling problem (using definition from 1). (5) 3. Lets assume that these tasks were also assigned different weights which denotes the importance of the corresponding task. Now, if you were to find the subset of mutually compatible tasks that provides the maximum cumulative weights, describe whether the same greedy choice of Earliest Finish Time will work or not? If it does not, then what method can be feasible, briefly explain why. (4)

Answer rating: 100% (QA)

1 When there are many tasks the individual needs to make a schedule He should follow the following n... View the full answer