Added: 3 years ago
From: nptelhrd
Views: 62,532
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:
see all

All Comments (69)

Sign In or Sign Up now to post a comment!
  • very good lecture but u think it will be better if doctor complete tree

    actually that what i do to understand

    thanks at all

  • I can't believe dynamic programming is simply backtracking with memory, and that this eliminates so many branches.

  • Thank you, this is very useful.

  • 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.

  • Great lecture! What's the name of the prof.?

  • Excellent exposition. Thanks!

  • Surprise at 14:15

  • Surprise !!

  • thank you so much sir !!! tht was excellent !!

  • Very helpful, thank you very much.

  • wonderfully explained. thanks from egypt.

  • wonderfully explained. thanks from egypt.

  • There is a small mistake at 36:44 it should be KS(C-W[i], i+1) in the fourth line

  • Wonderfully explained

  • At 37:25 there is a minor typographical mistake. In the fourth line it should be KS(C - w[i], i+1).

  • @xplorencheerz I do believe the first instance of the typo is 36:46.

  • awesome video i finally understood the dynamic programming

  • Excellent video. 

  • whoa!! I understood nice and clear !

  • Awesome explanation...perfectly understood..

  • super like...awesome...didnt knw teachers at our college suck sooooooooooo much...awesome aweosme awesome.. :) love u iit

  • really gr8...!!!!!!

    thanx sir:_)

    

  • Really good stuff, makes this subject sound really easy when it isn't. Thumbs up!

  • or, you could just get a truck and take all the objects... =D

  • mind = blown...

  • awesome explanation Prof:)

    thank you so much..

  • 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?

  • Fantastic Lecture. I wish I would have enrolled for some courses from him during my IIT days.

  • superb lecture.

  • i didnt get it. u suc at teachin

  • does ever lecturer make his own intro music ? :P

  • 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?

  • 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

  • nice lecture, with clarity

  • Thank you Prof. Ranade!

    You succeeded in teaching me, where my own prof. failed.

  • 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.

  • very good lecture

    you explain the topic (which is a complex topic) in a very easy to understand way

    well done !

  • I just watched the whole lecture and I must say I'm really impressed by the way you teach, professor!

  • Lol @ 14:20,

    3. Surprise!!

  • Thanx for the vid, but...

    Isn't there any other way to write and show, other than wasting so many paper sheets like that?

  • Crystal clear...good job!!

  • Excellent Lecture. Hats Off!!!

  • Comment removed

  • awesome

  • amazing.

  • First time get the clear idea for DP problem. Thank you very much.

  • beautifully dumbed down ... very clear and crisp

  • prof ranade .....man u are a genius .....u explain so well .....hats off

  • 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.

  • 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 I couldnt agree more!

    Awesome lecture

  • Thank you Prof, Ranade :)

  • Anyone know where the next lecture of this is?

  • @aznstyles408

    Search for Design and Analysis of Algorithms (# of lecture)

    ie : "Design and Analysis of Algorithms 20"

  • I would have laughed more at 14:30 if he had have written "3. ???? 4. PROFIT!"

  • he didn't do the bottom up approach

  • my this video doesnt show?

  • 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

  • right

  • @fofiux you are right

  • Superb

  • superb lecture.

  • 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.

  • 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.

  • prof ranade is the best!!!

  • nice lecture... i like it :)

Loading...
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more