CS 545 - Data Structures and Algorithms

Unit(s): 4

Asymptotic analysis of algorithms. Solving recurrence relations. In-depth discussion of algorithms for sorting and searching, trees, skip lists, heaps, hash tables, disjoint sets, graphs, self-balancing trees, and string matching. Covers dynamic programming and NP completeness.

Prerequisite: CS 514 with a minimum grade of B and MATH 501 with a minimum grade of B
Restriction: Course Student Attribute Restricted to Bridge MSCS Program; Level Restricted to Graduate
College of Arts and Sciences