CSCI 423 Analysis of Algorithms

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.

Credits

4 credit hours.

Prerequisite

CSCI 315, MATH 212 and 436.

Offered

Offered spring.

General Education Category

Gen. Ed. Advanced Quantatitive/Scientific Reasoning.