Design & Analysis of Algorithms
Students will apply combinatorial mathematics, studied throughout the course, to the application of complexity theory, searching and sorting, and techniques of algorithm design (including greedy, divide and conquer, dynamic programming, and backtracking methods) in designing algorithms to solve problems. Upon completion of this course, the student will be able to design algorithms applying these techniques and be able to analyze the efficiency of these algorithms. Prerequisite: IST 246, MTH 250. Offered alternate spring terms.