CS 522 Data Structures and Algorithms II 3.0 Credits
Discussion of algorithm design techniques, augmented data structures including Binomial and Fibonacci heaps and Splay tree; Amortized analysis of data structures, topics in pattern and string matching, network flow problem, matching in bipartite graphs, and topics in complexity theory including reduction and NP-completeness, and approximation algorithms.
Repeat Status: Not repeatable for credit
Prerequisites: CS 521 [Min Grade: C]