CIS 431 - AlgorithmsandDataStructures

Institution:

Shepherd University

Subject:

Description:

The topics of this course include basic tools for algorithm analysis including asymptotic notations, lower and upper bounds, and recursive relations; advanced data structures; analysis of recursive algorithms; analysis of algorithms for searching and sorting; analysis of graph and geometric algorithms; analysis of numerical algorithms; study of NPcomplete problems; and study of parallel algorithms. Prerequisite: CIS 321, MATH 307, and MATH 314.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.SHEPHERD.EDU

Phone Number:

(304) 876-5000

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.