Attention students, faculty and staff: Parking procedures for Fall 2016. Click here for details.

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.
4 credit hours

  • CSCI 315
  • MATH 212 or 436

Page last updated: Wednesday, November 22, 2006