NOTICE : Nov. 28 - Holiday office and power outage closures. Click for details.
Techniques for designing algorithms and analyzing their efficiency are covered. Topics include "big-oh" analysis, divide-and-conquer, greedy method, efficient sorting and searching, graph algorithms, dynamic programming, and NP-completeness.
4 credit hours
- CSCI 315
- MATH 212 or 436
Page last updated: December 4, 2006