CPSC 406 - Algorithm Analysis

Institution:

University of Massachusetts Global (formerly Brandman University)

Subject:

Description:

Prerequisites, Math 250, CPSC 350. Students study ideas and techniques useful for designing and analyzing data structures and algorithms. In particular, the analytic tools needed for analyzing upper bounds for algorithms and lower bounds for problems will be covered. Problem areas include sorting, graph-based problems, dynamic programming, combinatorial algorithms, computational geometry, encryption, parallel and distributed models, and NP-completeness. (Offered as needed.) 3 credits.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.brandman.edu/

Phone Number:

(949) 341-9800

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Trimester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.