CS 445
Analysis of Algorithms

Credits/When Offered: 4R-0L-4C / F 1995-96

Prerequisites: CS 233 and MA 315.

Analysis of space and time requirements of standard computational and combinatorial algorithms. Computational models, average case and worst case analysis, lower bounds for algorithms, provably optimal algorithms, computational complexity, NP-complete problems, provably intractable problems, probabilistic algorithms.

Explain the notation used here.

white_icon.gif (851 bytes)Required Courses
cs_icon.gif (891 bytes)Computer Science
rhit_icon.gif (977 bytes)Rose-Hulman

09-Feb-1999 20:02:15