Design and Analysis of Algorithms

IIT Bombay , Prof.Abhiram G Ranade Ajit A Diwan Sundar Viswanathan

Asymptotic Notation


Lecture Description

No Lecture Description Found

Course Description

Overview – Framework for Algorithms Analysis – Asymptotic Notation – Algorithm Design Techniques:Basics – Divide And Conquer – Median Finding,Surfing Lower Bounds,Closest Pair – Greedy Algorithms – Pattern Matching -Combinational Search and Optimization – Dynamic Programming – Longest Common Sub sequences – Matric Chain Multiplication – Scheduling with Startup and Holding Costs – Bipartite Maximum Matching – Lower Bounds for Sorting – Element Distinctness Lower Bounds-NP – Completeness -Motivation – Approximation Algorithms – Approximation Algorithms for NP

SEE ALLAdd a note
Add your Comment


FreeVideoLectures Provides you complete information about best courses online, Video tutorials, helps you in building a career !!

Learn More About us All rights reserved.

Setup Menus in Admin Panel