Design and Analysis of Algorithms

Advanced asymptotic analysis of algorithms utilizing mathematical modeling with an emphasis on efficient methods for searching, sorting, trees, and graphs. Classic algorithm design techniques such as greedy, divide and conquer, dynamic programming, backtracking, and randomized algorithms will be investigated and analyzed. Study of the classification of the computational difficulty of problems: i.e. NP, intractable, and unsolvable.