GATE CSE
First time here? Checkout the FAQ!
x
0 votes
87 views

Your final exams are over and you are catching up on watching sports on TV. You have a schedule of interesting matches coming up all over the world during the next week. You hate to start or stop watching a match midway, so your aim is to watch as many complete matches as possible during the week.
Suppose there are $n$ such matches scheduled during the coming week and you know the starting and finishing time for each match.

Develop an algorithm based on dynamic programming to compute the maximum number of complete matches you can watch next week. Analyze the worse-case complexity of your algorithm.

asked in Algorithms by Veteran (281k points)   | 87 views

1 Answer

0 votes

arjun sir, i need ur favour,so that i may solve the problem

Is this problem a bit similar to NON-PRE-EMPTIVE SJF:

where start time of match is same as ARRIVAL TIME of process.

end time of match is same as COMPLETION TIME of process.

  time duration of match is same as BURST TIME  of process.

hate to start & stop is same as non-pre-emption.smiley

 

answered by Boss (8.8k points)  
Yes, it is same. But only issue is we have a fixed time limit within which to finish all the jobs- which is usually not there in process scheduling problem.
ok
Activity selection problem using dynamic programming can be the answer


Top Users Mar 2017
  1. rude

    4272 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2244 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1338 Points

  8. Akriti sood

    1246 Points

  9. Bikram

    1246 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,452 questions
26,771 answers
60,972 comments
22,985 users