COSC 327 - Analysis of Algorithms

Lecture Hour(s): 3
Lab Hour(s): 0
Credit Hour(s): 3

This course teaches elementary techniques for designing and analyzing algorithms to solve problems in a computationally efficient way. It also enables students to analyze time and space requirements of algorithms and decide which algorithm best suits the problem at hand. Topics cover mathematical preliminaries, introduction to models of computation, analysis of well-known sorting and search algorithms, graph algorithms, programming techniques such as recursion, dynamic and greedy algorithms, and an introduction to P and NP class problems.

Prerequisite(s): COSC 261 and MATH 250.