The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+2 votes

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 (326k points) | 125 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 (9.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.
Activity selection problem using dynamic programming can be the answer

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

29,017 questions
36,844 answers
34,721 users