This course aims to introduce the fundamental concepts of the design and analysis of computer algorithms;
stressing analytical approaches. Asymptotics, recursion relations and solution methods will be discussed, using
examples from among the classical algorithms of computer science. Parallel algorithms and difficult problems are
3.Recursion relations, solution methods
4.Divide and Conquer methods (Quicksort and related
5.Greedy algorithms (Graph algorithms)
6.Heaps and trees
8..Introduction to NP completeness
Additional material will be made available.
Note that some course notes and texts are available
free on several Web sites.