CSC 282: Design and Analysis of Efficient Algorithms

CRN:
28714
Credit Hours:
4.0
Previous Offerings:

How does one design programs and ascertain their efficiency? Divide-and-conquer techniques, string processing, graph algorithms, mathematical algorithms. Advanced data structures such as balanced tree schemes. Introduction to NP-completeness and intractable combinatorial search, optimization, and decision problems.