CS 528 - Advanced Data Structures and Algorithms

Description:
This course is a detailed introduction to advanced algorithms and data structures used in the computational science MS program.

Prerequisites:
Prerequisites: CS 301 and MATH 330.

Credits:
(4)

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

Analyze algorithms.
Demonstrate divide-and-conquer, randomized, sorting, dynamic programming, and greedy algorithms.
Build algorithms using the following data structures: hash tables, binary search trees, red- black trees.
Incorporate elements of NP-completeness in problem solving.

Learner Outcomes Approval Date:
2/17/11

Anticipated Course Offering Terms and Locations: