Question

Consider the following activities. Solve the problem of activity-selection problem.

Answer 1

The algorithm for ativity selection problem:

• Sort the activities according to their finishing time
• Select the first activity from the sorted array and print it.
• Do following for remaining activities in the sorted array.
• .a) If the start time of this activity is greater than the finish time of previously selected activity then select this activity and print it.

The solution to above problem:

step 1: sort the activities according to their finish time

i	2	3	1	5	4	6
si	1	3	0	5	5	8
fi	2	4	6	7	9	9

Step 2: select the first activity and print it

output : 2

Step 3: si(activity(3)) > fi(activity(2)

output: 2,3 and repeat the steps,

si(activity(1)) < fi(activity(3))

output: 2,3

si(activity(5))>fi(activity(3))

output : 2,3,5

finally si(activity(6))>fi(activity(5))

so output: 2,3,5,6

so ,the activities that are selected are 2,3,5,6