XCSC 391 - Design And Analysis of Algorithms

Institution:

DePaul University

Subject:

Description:

(Cross-listed with CSC-491) Methods of designing algorithms including divide-and-conquer, the greedy method, dynamic programming, backtracking, and NP-completeness and approximation algorithms. Emphasis on efficiency issues. PREREQUISITE(S): Advisor Consent.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.depaul.edu

Phone Number:

(312) 362-8000

Regional Accreditation:

North Central Association of Colleges and Schools

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.