Course Info

XCSC 391: Design and Analysis of Algorithms

(Cross-listed with CSC-491) Methods of designing algorithms including divide-and-conquer, the greedy method, dynamic programming, backtracking, and NP-completeness and approximation algorithms. Emphasis on efficiency issues. PREREQUISITE(S): Advisor Consent.