E0 225 - Design and Analysis of Algorithms
Review of data structures and models of computation, Basic paradigms, e.g., greedy algorithms,
divide and conquer strategies, dynamic programming, Graph algorithms, Algorithms for sorting
searching, order statistics String matching, Sequence comparisons Geometric algorithms, Probabilistic
algorithms. The classes and NP and the notion of NP-completeness.
Ramesh Hariharan and Vijay Chandru
Aho, A.V., Hopcraft J.E., and Ullman, J.D., Design and Analysis of Algorithms, Addison-Wesley, 1974.
Brassard, G., and Bratley, P., Algorithmics, theory and practices, Prentice-Hall International, 1988.
Cormen, T.H., Leiserson, C.E. and Rivest, R.L., Introduction to Algorithms, MIT Press, 1990.
Back to Courses