Prerequisites: CSCI 311, MATH 317 and classified graduate standing.
Catalog Description: Algorithms from many areas of computer science will be analyzed. Topics include algorithm design techniques (such as divide-and-conquer, greedy algorithms, dynamic programming, and others), mathematical and empirical analysis of algorithms and NP-completeness. Formerly CSCI 356.
Course Objectives:
The objectives are for the student to:
augment their "tool box" of algorithm design techniques
learn how to analyze the efficiency of algorithms
learn about the intrinsic complexity of certain computational problems
Course Outcomes:
Students shall be able to:
1. analyze program efficiency (including recursive programs)
2. identify, classify and design programs of the following types:
divide and conquer
greedy method
dynamic programming
basic traversal, sort and search
3. classify and design determistic/non-deterministic algorithms
4. discuss issues concerning P/NP (satisfiability, intractability)
5. illustrate that a problem is NP-Complete (reducibility)
Class/Laboratory schedule: N/A
Accreditation Category Content:
Course for Master's program only
College of Engineering, Computer
Science, & Construction Management
California State University, Chico
Chico, CA 95929-0003
530-898-5963 webmaster@ecst.csuchico.edu
