ADUni.org 2001
Algorithms: Sorting, Searching & data Structures, Red-Black Trees. Graph Algorithms: Topological Sorting, Prim’s algorithm, DFS, BFS, Kruskal’s algorithms, and shortest path. Geometric algorithms: Graham & Jarvis; Dynamic Programming. Parsing. Greedy algorithms, NP Completeness etc...
University of Washington, Spring 2004
MIT Spring'05 Streaming and Downloadable
Analysis of Algorithms; All Sorting techniques; Recurrences; Divide and Conquer: Strassen, Fibonacci, Polynomial Multiplication; Heaps and Hashing; Dynamic Programming; Graph Algorithms; number theoretic algorithms; amortized analysis;Shortest paths; Catching and parallel computing etc....
University of Florida
Design and analysis of algorithms. Methodologies include: divide and conquer, dynamic programming and greedy strategies. Applications include: sorting, ordering and searching, graph and geometric algorithms, mathematical matching algorithms such as number theory, algebra and linear algebra algorithms.
