0
Write down algorithm of job sequencing using deadlines. Solve the following Problem.

Subject: Analysis Of Algorithm

Topic: Greedy Method

Difficulty: High

Write down algorithm of job sequencing using deadlines. Solve the following Problem. N=5

(P1, P2, P3, P4, P5) = (20, 15, 10, 5, 1)

(d1, d2, d3, d4, d5) = (2, 2, 1 ,3, 3)

aoa(14) • 250  views
0  upvotes
Please log in to add an answer.

Next up

Read More Questions

If you are looking for answer to specific questions, you can search them here. We'll find the best answer for you.

Search

Study Full Subject

If you are looking for good study material, you can checkout our subjects. Hundreds of important topics are covered in them.

Know More