CPSC 450 - Design & Analysis-Comp Algorim

Institution:

Gonzaga University

Subject:

COMPUTER SCIENCE

Description:

An advanced study of computer algorithms not covered in CPSC 223 along with principles and techniques of computational complexity. Topics could include dynamic programming, B-trees, minimum spanning trees, the Floyd-Warshall algorithm, various string matching algorithms, computational geometry, Np-completeness and reducibility. Spring odd years.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.gonzaga.edu

Phone Number:

(509) 328-4220

Regional Accreditation:

Northwest Commission on Colleges and Universities

Calendar System:

Semester

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.