CSC 338 - Algorithm Design

Institution:

National University

Subject:

Description:

(Prerequisite: CSC 335) Techniques of designing efficient computer algorithms, proving correctness, and analyzing time complexity. General topics include asymptotic behavior, solution to recurrence relations, algorithm design techniques such as divide-and-conquer, dynamic programming, and greedy algorithms applied to sorting, searching and graphs. An introduction to the theory of parallel and distributed algorithms.

Credits:

4.50

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.nu.edu

Phone Number:

(800) 628-8648

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Other academic year

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.