CSCI 160 - Algorithms

Institution:

Clark University

Subject:

Description:

Emphasizes how the design of algorithms is supported by advanced data structures such as sets, trees, and graphs. Applications to searching and sorting are discussed. Topics include: design and analysis of algorithms, general trees, balanced trees, priority queues, hash tables, merge-sort, quick-sort, radix sorting and searching, and elementary graph algorithms. Programming projects are assigned for the laboratory component.

Credits:

1.00

Credit Hours:

Prerequisites:

Prerequisites for this course require a grade of C or better in CSCI 121 and MATH 114.

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture/Lab

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.clarku.edu

Phone Number:

(508) 793-7711

Regional Accreditation:

New England Association of Schools and Colleges

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.