COSC 528 - Design and Analysis of Algorithms

3 Credits

Prerequisite(s): COSC 504 and COSC 522 This course includes discussion of design and analysis of basic computer algorithms based on the following techniques: divide-and-conquer, greedy, dynamic programming, tree and graph traversals, backtracking, and branch-and-bound method. Applications to problems, such as sorting and searching, traveling salesman, knapsack, graph coloring, set union-and-find, matrix multiplication, and scheduling. Use of advanced data structures appropriate for different techniques and problems. Use of mathematical tools, such as big-oh notation and recurrence relations in the analysis of algorithms to NP-completeness and discussion of P=NP question.