Design & Analysis of Algorithms
Students will apply combinatorial mathematics,ystudied throughout the course, to the applicationyof complexity theory, searching and sorting, andytechniques of algorithm design (including greedy,ydivide and conquer, dynamic programming, andybacktracking methods) in designing algorithms toysolve problems. Upon completion of this course,ythe student will be able to design algorithmsyapplying these techniques and be able to analyzeythe efficiency of these algorithms. Prerequisite:yIST 246, MTH 250. Offered alternate spring terms.