IST 314 - Design and Analysis of Algorithms (3)

Prerequisites: IST 246  and MTH 250 .
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.

Print-Friendly Page (opens a new window)