Mathematics & Computer Science 332 - Analysis of Algorithms

Institution:

Dickinson College

Subject:

Description:

A study of algorithmic approaches to problem-solving and techniques for analyzing and comparing algorithms. Approaches such as divide-and-conquer, dynamic programming, and backtracking will be explored in conjunction with complex structures such as trees and graphs. Topics in computational complexity include asymptotic complexity measures, intractability, and NP-complete problems. Prerequisite: 232, MATH 211. Offered every fall. NOTE: Completion of both 251 and 332 fulfills the WR requirement.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.dickinson.edu

Phone Number:

(717) 243-5121

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.