CS 427 - Algorithm Analysis

Description:
Topics will include basic algorithmic analysis, algorithmic strategies, fundamental computing algorithms, basic computability, the complexity classes P and NP, and advanced algorithmic analysis. Course will be offered every year. Course will not have an established scheduling pattern.

Prerequisites:
Prerequisites: CS 302 and a grade of C or higher in MATH 330, and admission to computer science major.

Credits: (4)

Learner Outcomes:
Upon successful completion of this course, the student will be able to:

Define basic categories of algorithmic analysis and algorithmic strategies
Formulate and apply fundamental computing algorithms to solve specific tasks
Formulate Mathematical analysis of recursive algorithms, heterogeneous recurrences and the Master Theorem
Formulate and apply Brute-force, Exhaustive search, Depth-First and Breadth-First Search and Decrease-and-conquer algorithms
Formulate and apply the complexity classes P and NP to specific tasks
Formulate and apply advanced algorithmic analysis.

Learner Outcomes Approval Date:
4/5/18