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:

Define correctness of algorithms, analyze recursive and non-recursive algorithms; analyze probabilistically randomized algorithms; use amortized analysis of algorithms
Recognize matroids to assess the correctness of greedy algorithms.
Demonstrate divide-and-conquer, dynamic programming, greedy algorithms; demonstrate sorting, sorting in linear time, median and order statistics.
Construct algorithms using the following data structures: universal hashing, open addressing, probing methods, double hashing, perfect hashing, disjoint sets, augmented data structures, randomly built binary trees.
Select elements of randomized algorithms in problem solving.

Learner Outcomes Approval Date:
1/22/21

Anticipated Course Offering Terms and Locations:
Fall Locations Ellensburg