Portland-State-University 2017-2018 Bulletin

CS 350 Algorithms and Complexity

Techniques for the design and analysis of algorithms. Case studies of existing algorithms (sorting, searching, graph algorithms, dynamic programming, matrix multiplication, fast Fourier transform.) NP-Completeness.

Credits

4

Prerequisite

CS 250, 251, 311.
  • Up one level
  • 300