Program Features
Course and Admission Requirements
Degree Comprehensive Examination
Program Objectives and Student Outcomes
Degree Plan
Computer Algorithms
Topics:
1. Divide and conquer. 2. Dynamic programming. 3. Computational Geometry: Covex hull, Nearest neighbors, Voronoi diagrams. 4. NP-complete problems. 5. Network flow. 6. Matching. 7. Approximation algorithms. 8. Randomized algorithms.
Books:
1. Alsuwaiyel, M. H., Algorithms: Design Techniques and Analysis, World Scientific Publishers, 1999. 2. Cormen, T. H., Leiserson, C. E. and Rivest, R. L. Introduction to Algorithms, MIT Press, Cambridge, 1992.
Courses
ICS 353, ICS 553
