CSC 8301
Design and Analysis of Algorithms
3 Credits Format: lecture Level: graduate
Description: Fundamental strategies for algorithm design; mathematical and empirical techniques for analysis of nonrecursive and recursive algorithms, with applications such as sorting, searching, string processing and graphs; NP-complete problems and approximation algorithms.
Textbooks:
- Introduction to the Design and Analysis of Algorithms, 2nd Edition, Levitin, Addison Wesley
Objectives: No objective data is available.
Coordinator: Dr. Anany Levitin
Prerequisites: None
Required For:
- M.S. in Computer Science
Elective For:
- M.S. in Software Engineering