CS 3414 - Design and Analysis of Algorithms

Institution:

Polytechnic Institute of New York University

Subject:

Description:

This course covers the fundamental principles of the design and analysis of algorithms. Topics include asymptotic notation, recurrences, randomized algorithms, sorting and selection, balanced binary search trees, augmented data structures, advanced data structures, algorithms on strings, graph algorithms, geometric algorithms, greedy algorithms, dynamic programming, and NP completeness. Prerequisites: CS 2134 (C- or better) and MA 2312/2322.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Multiple

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.poly.edu

Phone Number:

(718) 260-3100

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.