CSSE 310 - Design and Analysis of Algorithms

Institution:

Seattle University

Subject:

Description:

Advanced data structures (e.g. sets, graphs, priority queues) and their application; algorithm analysis and design techniques, such as divide and conquer, greedy methods, branch and bound, etc. Asymptotic analysis of algorithms and introduction to computability theory. Prerequisites: a C (2.00) or better in CSSE 250 and either MATH 310 or a C (2.00) or better in CSSE 210.

Credits:

5.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.seattleu.edu

Phone Number:

(206) 296-6000

Regional Accreditation:

Northwest Commission on Colleges and Universities

Calendar System:

Quarter

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.