skip to content

2012 - 2013 Undergraduate Catalog

Course Descriptions

Computer Science:

Back to all Departments

Icon Legend

  • Prerequisites
  • General Education
  • Writing Emphasis
  • Travel Course
  • Repeatable
  • Additional Fees
Credits3
Lecture
Fall
Odd Only
COMP SCI-450

Theory of Algorithms

Design, analysis and comparison of algorithms; divide and conquer techniques, greedy method, dynamic programming and graph searching. Applications to profit maximization with constraints, graph coloring, traveling salesman problem and others.

Prerequisites
P: Comp Sci 257 and 242 and Math 202, all with at least a C grade.