CS 5353 - Analysis of Algorithms

Institution:

University of Tulsa

Subject:

Description:

Design and analysis of efficient algorithms. Design techniques including recursion, divide-and-conquer, and dynamic programming. Applications include sorting, searching, dynamic structures, path finding, fast multiplication. Non-deterministic algorithms. Computationally hard problems. NP-completeness. Prerequisites: CS 2123, 3013.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.utulsa.edu

Phone Number:

(918) 631-2000

Regional Accreditation:

North Central Association of Colleges and Schools

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.