CS 412 - Algorithm Analysis

Description: A formal algorithmic language. Measures of complexity for the time and space. Worst-case, average-case, and best-case analysis. Lower and upper bounds of algorithms (techniques include comparison trees, adversary arguments, and reduction). P and NP classes. NP-hardness and NP-completeness. Introduction to parallel computational models and algorithms.

Prerequisites: CS 310 and 340
Credit Hours: 3

Class Hrs./Week:

Lab Hrs./Week:

Hardware: None

Software: None
To Top of Page