Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, and parallel computing.
This course covers lessons on divide and conquer,greedy algorithm,pattern matching,dynamic programming and approximation algorithm.
Ask a Question
e-book enables you to access interactive reading material to strengthen the skills learned in the sessions.
Online Lab enables you to practice the application of concepts you have learnt in the sessions in the virtual environment.
Tutorials enables you to get easy learning with clear, crisp, and to-the-point content on a wide range of technical and non-technical subjects without any preconditions and impediments.