COMP 4030-6030 - Design and Analysis of Algorithms

Institution:

University of Memphis

Subject:

Description:

Asymptotic behavior of programs, basic paradigms in algorithm design; greedy, divide-and-conquer, dynamic programming; analysis of efficiency and optimality of representative algorithms, including graph, pattern matching, numerical, randomized, and approximation algorithms; approaches to lower bound analysis; basic parallel algorithms. PREREQUISITE: COMP 3160. (F, Sp)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.memphis.edu

Phone Number:

(901) 678-2000

Regional Accreditation:

Southern 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.