Algorithm Analysis and Development - CPSC 200 - A1
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.
Campus:   Prince George
Schedule Type:  Lecture
Instructional Method: On campus, face to face
|Return to Previous|