1E


2E

Whether the given set A of tasks is independent

Task scheduling is the processor of scheduled to be done in the single time. Here, deadline for each work is strictly defined and a penalty is paid by the task if it is not completed in the scheduled time.

The property 2 of lemma of task scheduling says that for set of tasks there is where the set of number of tasks whose deadline is t.

So the number of tasks in the set is deadline to ‘’, and it is always less than or equal to the deadline.

The set is independent, if all the tasks are in the set A , that can be completed before the deadline of their completion. And the number of tasks in is.

And, if all tasks in are as

Since includes all the tasks in the task set and it takes unit time for each task so it can be determined in time which is the deadline for the task completion.

Hence the property of task scheduling tasks of task set A forcan determine that the tasks can be completed in time so A is an independent set.

Chegg Rip, Introduction to Algorithms, 3rd Edition. [RipVer 0.1] (index)