|
|
|
Apr 29, 2024
|
|
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 C and MATH 501 with a minimum grade of C
Restriction: Course Student Attribute Restrictions exclude Bridge MSCS Program; Level Restricted to Graduate
College of Arts and Sciences
Add to Portfolio (opens a new window)
|
|
|
