CMPSC 463Design and Analysis of Algorithms
Recurrences, algorithms design techniques, searching, sorting, selection, graph algorithms, NP-completeness, approximation algorithms, local optimization algorithms. CMPSC 463 Design and Analysis of Algorithms (3) The primary goals of this course are (1) to provide the students with fundamental techniques for designing and analyzing algorithms, and (2) to introduce some techniques for dealing with inherently intractable problems.This is a required course in the BS COMP program.
Prerequisites
None listed in the catalog.
Where it sits in degree plans
Suggested plans most often put it in Year 3 · Fall (2 programs).
Required in (2)
- Computer Science, B.S. (Abington)
- Computer Science, B.S. (Capital)
Courses that list CMPSC 463 as a prerequisite (1)
- CMPSC 432 Exploratory Data Mining