Algorithm

Question 1

We are given 9 tasks T1, T2.... T9. The execution of each task requires one unit of time. We can execute one task at a time. Each task Ti has a profit Pi and a deadline di Profit Pi is earned if the task is completed before the end of the dith unit of time.

Task     T1  T2	 T3  T4  T5  T6	 T7 T8  T9
Profit   15  20	 30  18  18  10	 23 16  25
Deadline 7   2 	 5   3 	 4   5 	 2  7   3

What is the maximum profit earned?

A
147
B
165
C
167
D
175
AlgorithmGreedy-AlgorithmGATE 2005
Question 1 Explanation: 
We will now add the profits of the tasks we have put in the array.
30+25+23+20+18+16+15 = 147
There is 1 question to complete.

Access subject wise (1000+) question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content