NOTICE : Campus-wide Power Outage - Thursday August 28, 2014 from 6:00 am to 4:00 pm. Click 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

Prerequisites:
  • CSCI 315
  • MATH 212 or 436

Page last updated: December 4, 2006