CS 210 - design And Analysis of Algorithms

Institution:

Skidmore College

Subject:

Description:

A study of techniques used to design algorithms that are efficient in terms of the time and memory required during execution. The course will also cover the techniques used to evaluate an algorithm's efficiency. Topics include advanced sorting techniques, advanced data structures, dynamic programming, greedy algorithms, amortized analysis, and graph algorithms. Prerequisites: MC115 or MC215 and CS206, and MA111, or both MA108 and 109, or equivalent. The Department

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.skidmore.edu/

Phone Number:

(518) 580-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.