Design and Analysis of Algorithms

Course Description

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.

Course Objective

This course covers lessons on divide and conquer,greedy algorithm,pattern matching,dynamic programming and approximation algorithm.

Ask a Question

My Questions