Thank you so much.. you taught very well.. but please try to use your voice... it feels awkward watching a video without sound.. and if you included your voice.. it would help us understand the content even more!! cheers!
This video really helped me a lot sir! I have watched several videos regarding this topic but still couldn't understand it properly..I got this video from a website...You made it look like a simple problem! Thank you so much sir! 😇❤
ThNQ soo much... it's really helped me a lot...explanation is awesome...plzz add ur voice wid this video ...that we help us to understand the video more easily...
Watching this just hours before my exam. And I must say really an amazing step by step guide. Understood every bit even without audio :P You should consider adding audio to these guides.
Hi Yusuf ! Great work again as always :) One small doubt - Doesn't the expression k = min(dmax, DEADLINE(i)); always tend to return DEADLINE(i) only ? I mean, k = DEADLINE(i); would have done the same job. Am I missing something here ?
Basically "k" represents the deadline or maximum "time slot" that job can take to receive profit. You compare k >= 1 because 1 is the first time slot you can put a job in. You can not start a job at time or slot 0. You also wouldn't compare it to any number higher than 1 because you would have empty time slots before whatever number you are checking. (ex. if you check k >= 2, time slot 1 will be empty)
+priyanka popeta sorry but that is how i make my videos. i hope you will find one of my videos helpful. goo.gl/Z89n9o thanks for the comment and thanks for watching :-)
I found your presentation great, sir. But plz explain- dmax is already selected to be the highest deadline. So, trying to find the min between dmax and deadline(i) will always render deadline(i) as the result. Then why are we performing this redundant task?
You are a saviour to all those who want a quick and crisp explanation :D
Even mute....you are truly amazing and explanation is great!! Thank you so much :-)
welcome :-)
Thank you so much.. you taught very well.. but please try to use your voice... it feels awkward watching a video without sound.. and if you included your voice.. it would help us understand the content even more!! cheers!
short and very nice explanation many thanks sir.
waw you force me to drop a comment!!!!!you are awesome, smart, brilliant person....simple n very easy...
superb explanation thanku you today is my exam of DAA subject this video helps me lot
without any any voice u just nailed it thank u
SIMPLE AND CONCISE.
BEST EXPLANATION
Thanks!
+Abhishek Jha welcome
Explained very easily.. Thanks a lot sir
thank you soooooooo much you are such a help.. i understand from you more than my instructor
Silent Killer video:))
Awesome!!!
Wow.. you exlained it so beautifully !!! Keep up with the good work Bro!!
Best ever watched thzz kind of video thanks for making sir it helps alot.....
You are truly an amazing teacher sir! Hats off to you😊
very nice and easy way of explanation...thanks
seriously, you are dam awesome
you made it very simple
you are a very good teacher
very good and calm explanation...very easy to understand......, ty yusuf.
+srikanth katuri welcome
amazing.... crystal clear..
Peace and easily explained (y) !
Good way of teaching.. thank u
best of best ..great video ,Thank you sir u are amazing
Excellent teaching loved them sir
thanks for watching :-)
Very nice job bro. Its explanation is amazing
Cleared my doubts even after being silent
great healp..thank u so much..keep going on
Tomorrow is my class test, I forgot everything what he told. This Video's helped me much. Good Explanation. Keep it up.
Wow exellent explaining
This video really helped me a lot sir! I have watched several videos regarding this topic but still couldn't understand it properly..I got this video from a website...You made it look like a simple problem! Thank you so much sir! 😇❤
ThNQ soo much... it's really helped me a lot...explanation is awesome...plzz add ur voice wid this video ...that we help us to understand the video more easily...
I have never enjoy any algorithm tutorial as this. Keep the great work bro.
i found it very helpful .. thanks
The Best way to Explain .. Amazing Work.
nicely explained very helpful
Fantastic Explanation..Please make such videos on every topic you can..:D
Very helpful vedio. go ahead
superbly explained yusuf!!!! Will helpful in my exams for sure!!!!!!!!
like your videos very easy to understand
Thanks for your video!
awesome and thank you
great explanation.
Even in no sound you are so good 😍😍
Watching this just hours before my exam. And I must say really an amazing step by step guide. Understood every bit even without audio :P You should consider adding audio to these guides.
+Aditya Konarde thanks for watching and all the best for the exam :-)
Good explanation, thank you !
+Mohamed Ibrahim Adam welcome
Nice video,easy to understand.Good job.This is the one of the videos I m searching for.thnx n plz upload videos regarding knapsack prblm
+Vyshnavi Cheedella thanks :-)
here is the algorithm playlist
ruclips.net/p/PLG6ePePp5vvYVEjRanyndt7ZSqTzillom
Sir, Super Explanation!
+Ramakrishna Appicharla thank you :-)
great help!!!
Well explained pal
So nice..😎
u explanation was upto the mark....can you please explain how to design a algorithm for that...?
tutorial link: www.dyclassroom.com/greedy-algorithm/job-sequencing-problem-with-deadline
i hope this helps
Excellent explained
helpful video bro!!! keep it up!!!
Awesome 😀😀
thank u sooooooooo much
Thank you man....
thanks for watching and commenting :-)
have a nice day
Video was really helpful..Thanks man
+Ullas Diwakar welcome :-)
very good explanation...
+Vadla Prashanth thanks
thank you sir
nice video ! very helpful :)
+ravi relangi thanks
thanks a ton!!
+anu mishra thanks for watching and commenting :-)
THQ SO MUCH #SIR 😍
+ARBAAZ WNGCDR welcome :-)
Sir please can you provide an algorithm regarding this problem??
great explanation,
if possible please add audio to the video as it helps better concentration and better understanding. overall a great explanation...
+Animesh Jain thanks for watching and thanks for the suggestion :-)
thanks a lot
Good explanation Yusuf
+naveen dharni thanks
haii sir...explanation is good...but no audio..so it will better to listening the video...
thank u bhaiya
Hi Yusuf ! Great work again as always :)
One small doubt - Doesn't the expression
k = min(dmax, DEADLINE(i));
always tend to return DEADLINE(i) only ?
I mean,
k = DEADLINE(i);
would have done the same job. Am I missing something here ?
thank you alot sir for this tutorial
pls display full algorithm once to practise ourself
check the tutorial link: goo.gl/s0BIMM
hope this helps
Yusuf Shakeel sir
do u have any tutorials on backtracking n branch&bound algrthm
Yusuf Shakeel
sir u r making easily understandable tutorials tq
sorry not yet :-(
thanks for watching :-)
if dmax and deadline are same then which one to take minimum
sir you please also explain the code and then explain with example it will worke best
thanks
what does"k" do in the algorithm? and can someone please explain why is the condition "k>=1"??
Cool !
It should not be done in O(n^2). It should be linear if jobs are sorted based on their profits.
Can you explain for minimum profit?
Thnx
tq sir
thank u
welcome
bro please make a video on travelling sales man problem
+Yusuf Shakeel
One question,
Why are we checking whether k>=1, i didnt understand why do we take "1"
But by the way, awesome tutorial!
Basically "k" represents the deadline or maximum "time slot" that job can take to receive profit. You compare k >= 1 because 1 is the first time slot you can put a job in. You can not start a job at time or slot 0. You also wouldn't compare it to any number higher than 1 because you would have empty time slots before whatever number you are checking. (ex. if you check k >= 2, time slot 1 will be empty)
Oscar Hernandez Thanks a lot for yr explanation Oscar! :)
This is nit picking, but the initial comparison k >= 1 before k is reduced is redundant because it always returns true.
one question. so what happen to j4 and j5?
We have dmax=3 ,so we will have to take 3 slots only
Kindly add sum of subset problem using backtracking!!!!!!!!!!!!!!!!
Thank you, Buddy, You helped me................/\
welcome :-)
you're Mr. Bean bro
how come?
cuz u made it clear without having to speak. it's a compliment bro. :)
:-)
ek like iskiko muskaan lasakta hai.
har like zaroori hai.
why dont you narrate those lines... its so boring to read it by myself... like if i m reading textbook... sorry i am lazy😆
+priyanka popeta sorry but that is how i make my videos. i hope you will find one of my videos helpful.
goo.gl/Z89n9o
thanks for the comment and thanks for watching :-)
I found your presentation great, sir.
But plz explain- dmax is already selected to be the highest deadline. So, trying to find the min between dmax and deadline(i) will always render deadline(i) as the result. Then why are we performing this redundant task?