Job Sequencing Problem with Deadline | Greedy Method | DAA | Lec-39 | Bhanu Priya
Вставка
- Опубліковано 23 січ 2025
- Design & Analysis of Algorithms ( DAA )
Greedy method : Job sequencing problem with deadline explained with examples
Class Notes ( pdf )
website : education4u.in/
Complete DAA Course Playlist :
• Algorithm introduction...
Amazing
Words cannot describe ur teaching 👏👏
Class Notes ( pdf )
website : education4u.in/
i cleared many backlogs by seeing uh r vedios mam...tq so much..❤
Bro algorithm pseudocode loney rayala?
@@pravallika5f462 may be
@@pravallika5f462 ledu pseudo code algorithm seperate ga raayali
Paid Haa broo
@@vamshireddy8740
why the minimum of dmax and deadline[i] ????
Videos are superb and understandable, but Please adjust your camera ma'am or adjust your papers accordingly.
Mam Why we want to take k=min(dm ,di) , we can directly take k=di; Could u pls tell mam?
Same question 🤔
Thanks a lot mam...
minimize lecture time and give clear explanation . While watching I felt may be u don't have a clear idea
ua-cam.com/video/sPAqQ5mOv08/v-deo.html
Correct
U done great job and I love ur voice
Nice .🎉
what is time complexity ?
O(n2)
How to find time complexity for this
O(n^2) how it is come for this method
Mam advanced algorithms &design and algorithms are same
what is the use of look at a2 a1 a3
Where is tree vertex spiliting
please share python implementation of above algorithm
Thank you
Ag Bai pen change krt bsnya peksha lavkar lavkar explain kr ki baii
Madam your Concept are not clear 😕
thx
are you tamilian?
Very bad explain
So much confusioning mam
WORST EXPLANATION EVER