|Select the desired Level or Schedule Type to find available classes for the course.|
|CPSC 200 - Algorithm Analysis and Development|
This course introduces the development and analysis of algorithms. Topics include asymptotic complexity and notation, algorithm, analysis, comparison of sorting algorithms, NP Completeness, assertions, and loop and data type invariants. An introduction to program correctness is given and correctness proofs of simple programs are discussed. Recursion relationships are examined. Applications of algorithms are considered.
Schedule Types: Lecture, Final Exam
( CPSC 101 Minimum Grade of C- and CPSC 141 Minimum Grade of C- )
|Return to Previous||New Search|