2. We have are given n processes P., P. We would like schedule every process Pi

Question

2. We have are given n processes P., P. We would like schedule every process Pi to a time internal [si, fi], where si is the start time and fi is the finish time. We are given a set of constraints of the following two types: (a) Process Pi has to finish before process P, begins (that is, f, S s,) (b) Process P has to finish before process P, finishes (that is, fi S f,) Design an efficient algorithm that chooses intervals [s,, , i = 1, , n, subject to the given constraints, or reports that it is impossible to satisfy all the given constraints. What is the running time of your algorithm?

Explanation / Answer

Algorithm:

Running time of the algorithm:

O(nlogn)

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.