CS 4713 - Analysis Of Algorithms

Institution:

Arkansas State University-Main Campus

Subject:

Computer Science

Description:

Analysis of space and time requirements of algorithms. Worst case and average case studies. Greedy algorithms and divide and conquer algorithms. Tractable and intractable algorithms. Prerequisites, CS 3113 and MATH 2214. Fall, odd.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www2.astate.edu

Phone Number:

(870) 972-2100

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.