Undergraduate Catalog 2012-2013
CSC 382 Analysis of Algorithms
4 hours; 4 credits
Algorithm development, including running time analysis and correctness arguments. Topics include: asymptotic notation and complexity analysis; use of mathematical techniques to determine the computational complexity of algorithms such as sorting and searching. The course provides an introduction and analysis of elementary graph algorithms and programming techniques such as greedy, backtracking, and dynamic programming. Projects will be assigned to correlate the computational complexity and real-time execution time of the algorithms.
Up one level
Click arrowheads to expand or collapse contents