CS 375 - Design & Analysis of Algorithm

Credits: 4

Analysis of common algorithms for processing strings, trees, graphs and networks. Comparison of sorting and searching algorithms. Algorithm design strategies: divide and conquer, dynamic, greedy, back tracking, branch and bound. Introduction to NP-completeness. Required activity includes student presentations. Prerequisites: Either CS 240 or CS 310, MATH 227 and MATH 314 or MATH 330, CS 301 (may be taken concurrently). (All prerequisites must have a grade of C- or better). Offered every semester.