CSC 401 - Analysis of Algorithms

Institution:

Gallaudet University

Subject:

Description:

Fundamental data structures and algorithms are reviewed: arrays, pointers, trees, and recursion. Sorting techniques such as quicksort, radix sort, heapsort, and mergesort are analyzed in relation to their computational complexity and memory requirements. Searching methods, including binary, balanced trees, hashing, radix, and external areanalyzed for computational complexity and memory requirements. String processing, pattern matching, cryptology, simple closed path, convex, hall, depth-first and breadth-first searches, connectivity, polynomial, Gaussian, and curve fitting algorithms will be applied to basic data sets. Prerequisite: CSC 150

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.gallaudet.edu

Phone Number:

(202) 651-5000

Regional Accreditation:

Middle States 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.