This was seriously the most succinct and clearest explanation of dynamic programming I have ever seen. I wish I would've seen this years ago in university.
In the recursion tree example where we call ks(7,4) two times, both times it has different weight - 7 and 3. So if we first call it and get the less weight first we lose best solution because table is not NULL anymore and we can't call it again. Am I wrong?
Dynamic programming = Use subproblems and combine them into a solution. If the optimal solution is given as for example the minimal weight add subproblems with minimal weight. That's the hole story really.
Prof. Ranade is an excellent professor, and does well to relate to his audience despite the unusual nature of lecturing to a camera with a crew present. US campuses should follow this example for as a college student, I find this a better alternative to learning as you can pause and rework concepts with the text before continuing; saving lecture for advanced topics. I would think professors would prefer more conceptual questions as opposed to 'what is X' questions.
very good lecture but u think it will be better if doctor complete tree
actually that what i do to understand
thanks at all
khaledMohammedRagheb 1 week ago
I can't believe dynamic programming is simply backtracking with memory, and that this eliminates so many branches.
someman7 1 week ago
Thank you, this is very useful.
Frankster85 3 weeks ago
This was seriously the most succinct and clearest explanation of dynamic programming I have ever seen. I wish I would've seen this years ago in university.
mydisc4 1 month ago
Great lecture! What's the name of the prof.?
Darweesh84 1 month ago
This has been flagged as spam show
Excellent explained.. Thanks a lot.
BuciTheBu 1 month ago
Excellent exposition. Thanks!
shjescaresme 2 months ago
Surprise at 14:15
mag3ontherun 2 months ago
Surprise !!
ihavetoes26 2 months ago
thank you so much sir !!! tht was excellent !!
vsindhuja 2 months ago
Very helpful, thank you very much.
NakedShooter 2 months ago
wonderfully explained. thanks from egypt.
TheCortex89 3 months ago
wonderfully explained. thanks from egypt.
TheCortex89 3 months ago
There is a small mistake at 36:44 it should be KS(C-W[i], i+1) in the fourth line
93020108280 3 months ago 3
Wonderfully explained
praskuma 3 months ago
At 37:25 there is a minor typographical mistake. In the fourth line it should be KS(C - w[i], i+1).
xplorencheerz 4 months ago
@xplorencheerz I do believe the first instance of the typo is 36:46.
The46thShowroom 4 months ago
awesome video i finally understood the dynamic programming
glouist 4 months ago
Excellent video.
TheShafaet 4 months ago
whoa!! I understood nice and clear !
jbragadeesh 5 months ago
This has been flagged as spam show
awesome ... can't believe it was so easy ...
khandubunty 5 months ago
Awesome explanation...perfectly understood..
rama815 6 months ago
This has been flagged as spam show
Collection of few dynamic programming question frequently asked in interviews
anandtechblog.blogspot.com/2011/01/amazon-question-dynamic-programming.html
algoforyou 8 months ago
super like...awesome...didnt knw teachers at our college suck sooooooooooo much...awesome aweosme awesome.. :) love u iit
ridhi1904 8 months ago 2
really gr8...!!!!!!
thanx sir:_)
prakjain 9 months ago
Really good stuff, makes this subject sound really easy when it isn't. Thumbs up!
chessmani 9 months ago
or, you could just get a truck and take all the objects... =D
VasilKuzevski 10 months ago
mind = blown...
firewing75 10 months ago
awesome explanation Prof:)
thank you so much..
ramya101188 11 months ago
In the recursion tree example where we call ks(7,4) two times, both times it has different weight - 7 and 3. So if we first call it and get the less weight first we lose best solution because table is not NULL anymore and we can't call it again. Am I wrong?
9v1d0 11 months ago
Fantastic Lecture. I wish I would have enrolled for some courses from him during my IIT days.
tnegi2004 1 year ago
superb lecture.
quantamflux222 1 year ago
i didnt get it. u suc at teachin
bobsonenzo 1 year ago
does ever lecturer make his own intro music ? :P
bytedildo 1 year ago
i think there is a mistake @36:45
should this not be
...=ks(c-w[i], i+1)
also would you be able to elaborate on how to extract the chosen values from the table?
thesashman 1 year ago 5
Dear Professor Ranade, I'm from Taiwan.
Thank you so much!
This is such a nice lecture that I became your fan immediately after I watched this!
It would be nice if I could have all the sheets you used in all your lectures <3
ikukochyan 1 year ago
nice lecture, with clarity
TheBlisssmile 1 year ago
Thank you Prof. Ranade!
You succeeded in teaching me, where my own prof. failed.
mulpacha 1 year ago 2
Dynamic programming = Use subproblems and combine them into a solution. If the optimal solution is given as for example the minimal weight add subproblems with minimal weight. That's the hole story really.
labonka 1 year ago
very good lecture
you explain the topic (which is a complex topic) in a very easy to understand way
well done !
nyny99ful 1 year ago
I just watched the whole lecture and I must say I'm really impressed by the way you teach, professor!
haampie 1 year ago
Lol @ 14:20,
3. Surprise!!
haampie 1 year ago
Thanx for the vid, but...
Isn't there any other way to write and show, other than wasting so many paper sheets like that?
Arlekean 1 year ago
Crystal clear...good job!!
DarkHalycon 1 year ago
Excellent Lecture. Hats Off!!!
baskerville1234 1 year ago
Comment removed
baskerville1234 1 year ago
awesome
stooray1 1 year ago
amazing.
dsiddharth 1 year ago
First time get the clear idea for DP problem. Thank you very much.
BlankPoint69 1 year ago
beautifully dumbed down ... very clear and crisp
pnatesh 1 year ago
prof ranade .....man u are a genius .....u explain so well .....hats off
neerajharikrishnan03 1 year ago
Prof. Ranade is an excellent professor, and does well to relate to his audience despite the unusual nature of lecturing to a camera with a crew present. US campuses should follow this example for as a college student, I find this a better alternative to learning as you can pause and rework concepts with the text before continuing; saving lecture for advanced topics. I would think professors would prefer more conceptual questions as opposed to 'what is X' questions.
AyanZ0 1 year ago 2
This is the first sane description of dynamic programming I've seen. Thank you very much Prof Ranade. I've struggled with this subject for years.
jacklebot 2 years ago 33
@jacklebot I couldnt agree more!
Awesome lecture
NazzyNaslundFan 6 months ago in playlist Computer Sc - Design & Analysis of Algorithms
Thank you Prof, Ranade :)
EverGodZoro 2 years ago
Anyone know where the next lecture of this is?
aznstyles408 2 years ago
@aznstyles408
Search for Design and Analysis of Algorithms (# of lecture)
ie : "Design and Analysis of Algorithms 20"
AyanZ0 1 year ago
I would have laughed more at 14:30 if he had have written "3. ???? 4. PROFIT!"
TheRealFallenDemon 2 years ago
he didn't do the bottom up approach
helis4life 2 years ago
my this video doesnt show?
SiAlice 2 years ago
i believe that is an error in the algorithm, in the linbe before the last return, he sugest
Table(c-w[i],i+1)=KS(c,i+1)
but this doesn't work, if we change that line to
Table(c-w[i],i+1)=KS(c-w[i],i+1)
the algorithm works fine
fofiux 2 years ago 6
right
pavankpbhat 2 years ago 2
@fofiux you are right
amanaggarwalgogo 1 year ago
Superb
khoj4u 2 years ago
superb lecture.
rsaini1 3 years ago 15
This is a really nice video. The professor explains it step by step, and summarizes in the end.
I'm doing a paper on this subject, so if anyone has got some literature to recommend me, or just plain advice, please send me a message.
volimsir 3 years ago 3
Dr. Ranade is god person. I really touch his feet and really really great fan of his delivery of lectures.
I must say the whole world. Learn from IITian's (INDIANS) like professor Ranade. How to teach.
His teching methodology make me bind for three hours which any bollywood film do not (Strange).
Thanks sir for all your effort and thanks to all the team behind these.
haryiips07 3 years ago
prof ranade is the best!!!
zzzalota 3 years ago 2
nice lecture... i like it :)
imshubham 3 years ago