CSCI 423: Analysis of Algorithms
Techniques to analyze and design efficient algorithms are presented. Topics include recurrence relations, "big oh" analysis, NP completeness, set operations, heaps, graphs, and trees.
4 credit hours
Prerequisites:- CSCI 315
- MATH 200 or 436
- One semester of calculus
Page last updated: Dec. 4, 2006
