Search Results
CS 458 Data Structures and Algorithms II 3.0 Credits
This course covers the amortized analysis of algorithms and data structures; Fibonacci heaps; graph algorithms for maximizing network flow and computing minimum all pairs shortest paths; string matching algorithms; NP-Completeness and approximation algorithms.
Repeat Status: Not repeatable for credit
Prerequisites: CS 457 [Min Grade: D]