Read our cookies policy and privacy statement for more information.
×Louisville, Kentucky
This course covers the interrelationship between algorithmic statements, data structures,and computational complexity of computer programs. Algorithms are presented for a number of computer science and engineering applications including graph problems,string matching, dynamic programming, transitive closure, and convolution. The properties of NP-complete problems are introduced
Units: 3.0