Это видео недоступно.
Сожалеем об этом.
Greedy Method Job Sequencing with Deadline
HTML-код
- Опубликовано: 2 авг 2024
- Greedy Method Job Sequencing with Deadline
Watch More Videos at:
www.tutorialspoint.com/videot...
Lecture By: Mr. Arnab Chakraborty, Tutorials Point India Private Limited.
Nicely Explained.
I hope you've noticed that tutorialspoint is misspelled in the coat.
@@gayathrib8610feasible solution and optimal solution is different?
thank you sir for clearing my doubts regarding this topic
Cleared the concept. Thanks:)
One of the best explanations
Nicely Explained.
Thank YOu Sir!!
u have understood it. unbelievable
No difference between my lecturer and you !
U have explained in a very well mannered way sir. Understood everything. We need more teachers like u
Osum explain
The algorithm is written from sahni book
Osm
you said no jobs can run in parallel, but why 1,3
because, one job requires only one unit of time. So 1 and 3 can be done in sequence, as max deadline is still 2 ... I think you should watch the video again
sir your name ??
Chanchal Jamdoo
if 1,3 is possible in parallel then why not 2,4 not possible. You guy's just copy paste and not even explaining anything. IS it true?
in case of 1,3: the deadline is 2 for both cases. that means, suppose today is january 1 and both jobs should be completed before january 3(because deadline is 2 so jan 1+jan 2=jan 3). we can do job 1 in january 2 and job 3 in january 3.
In case of 2,4 : it's saying that we have to complete both jobs in january 2(the deadline is JAN 2) which is not possible because each job takes minimum of 1 day to complete(it is a given).
@@ManishKarki still not clear
You don't have an understanding nor can u do something for someone, what u can do is bitch about people who r working hard for a cause.
why there is not (2,4)
he will not reply. I think he just copy paste everything
Bcoz we can't write processing as(1,1)
Are you bengali sir ?? rashugolla khaabe ??
lol
Neeye asho😊