CSCI 445 - Design and Analysis of Algorithms

3 Credits
In this course the student will study algorithms that are core to the Computer Science field as well as an in-depth analysis of each type of algorithms. .Selected algorithms may include graph based algorithms, divide and conquer, linear programming, dynamic programming, and computational geometry. Students will also analyze algorithms in order to be able to identify NP-hard problems.

Prerequisite(s): CSCI 280 and CSCI 312
Course Learning Outcomes:
1. Apply basic and advanced algorithms to solve problems.
2. Analyze how to implement programmatically selected algorithms.
3. Evaluate basic computational geometry algorithms.
4. Apply an understanding of algorithmic analysis and apply it to selected algorithms.
5. Utilize security tools and methodologies to address security requirements in the design phase of a software development project that identifies threats and reduces the attack surface of the system under development.