Design and Analysis of Computer Algorithms

Instructor:

                 Dr. R. Chandrasekaran
                 Ashbel Smith Professor, Computer Science
                 Ph. D., University of California, Berkeley,1967
                 Eric Jonsson School of Engineering and Computer Science
                 The University of Texas at Dallas
                 P. O. Box 830688
                 Richardson, TX 75083-0688
                 Phone: (972) 883-2032
                 E-mail: chandra@utdallas.edu

Course Objective:

Study efficient algorithms for a number of fundamental problems, learn techniques for designing algorithms using appropriate data structures, prove correctness and analyze running times of algorithms.

Course Content:

Recurrence relations, Order notation. Divide and conquer, greedy methods, dynamic programming, linear programming, and inductive algorithms. Graph algorithms: Search techniques: DFS and BFS, Minimum spanning trees, Shortest path problems, Maximum flow problems, Matching, NP-completeness, Reductions.