Apr 19, 2024  
2014-2015 Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home
  Mission and Traditions
  Admission of Students
  The Campus
  Student Life
  Financial Information
  Financial Aid
  Institutional Advancement
  Academic Program
  Liberal Studies Curriculum
  Departments and Programs
  Courses
  Board of Trustees
  Administrative Officers
  Faculty
  Academic Calendars
  Campus Maps
HELP
2014-2015 Undergraduate Catalog [Archived Catalog]

CS 417 - Advanced Algorithms and Their Complexity

Covers basic algorithmic techniques including greedy, divide and conquer, network flow, approximation, and randomized algorithms. Additional topics include: algorithm analysis, proving correctness, complexity classes, computational intractability, and extending the limits of tractability. A variety of applications including network optimization, scheduling, and bioinformatics will be considered.

Prerequisites: CS 211, MA 208

Full course