CS 529 - Advanced Algorithms for Scientific Computing

Description:
The course presents specialized algorithms and data structures for scientific computing and it a continuation of CS 528.

Prerequisites:
Prerequisite: CS 528.

Credits:
(4)

Learner Outcomes:
Upon successful completion of this course, the student will be able to:

Identify advanced data structures: B-trees, Fibonacci heaps, van Emde Boas trees, disjoint sets.
Demonstrate concern for complexity of graph matching and string matching algorithms.
Incorporate linear programming algorithms and applications.
Discuss the importance of approximation algorithms.

Learner Outcomes Approval Date:
2/17/11

Anticipated Course Offering Terms and Locations: