Other links:

Other links:

Algorithm Design and Analysis

This course will cover approaches for analyzing and designing algorithms and data structures. Topics include- Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flows, string searching.

Study at Ashoka

Study at Ashoka