Concept of Greedy Algorithms Explained - Video Lecture

Prof.Abhiram Ranade and Prof.Sunder Vishwanathan, Department of Computer Science and Engineering, IIT Bombay explained the concept of Greedy Algorithms in Design and Analysis of Algorithms. Feel free to ask your doubts and please contribute your views here...



[video=youtube;EcT-Jt5WStw]https://www.youtube.com/watch?v=EcT-Jt5WStw&feature=player_embedded[/video]


[video=youtube;L1PvJO_1f84]https://www.youtube.com/watch?v=L1PvJO_1f84&feature=player_embedded[/video]


[video=youtube;srOghUgUZAQ]https://www.youtube.com/watch?v=srOghUgUZAQ&feature=player_embedded[/video]


[video=youtube;kjgsmpZqfSg]https://www.youtube.com/watch?v=kjgsmpZqfSg&feature=player_embedded[/video]

Replies

You are reading an archived discussion.

Related Posts

Prof.Sunder Vishwanathan, Department of Computer Science and Engineering, IIT Bombay explained the concept of Pattern Matching in Design and Analysis of Algorithms. Feel free to ask your doubts and please...
Prof.Sunder Vishwanathan, Department of Computer Science and Engineering, IIT Bombay explained the concepts of Combinational Search and Optimization in Design and Analysis of Algorithms. Feel free to ask your doubts...
Prof.Abhiram Ranade, Department of Computer Science and Engineering, IIT Bombay explained the concept of Dynamic Programming in Design and Analysis of Algorithms. Feel free to ask your doubts and please...
Prof.Abhiram Ranade, Department of Computer Science and Engineering, IIT Bombay explained the concept of Longest Common Subsequences in Design and Analysis of Algorithms. Feel free to ask your doubts and...
Prof.Abhiram Ranade, Department of Computer Science and Engineering, IIT Bombay explained the concept of Matric Chain Multiplication in Design and Analysis of Algorithms. Feel free to ask your doubts and...