Apr 18, 2024  
2007-2008 
    
Catalog Navigation
  Catalog Home
  Academic Calendar
  History and Statement of Purpose
  Admission and Financial Information
  Campus Life
  Academic Program and Policies
  Academic Departments and Concentrations
  Course Descriptions
  Board of Trustees
  Named Professorships
  Faculty
  Staff
  Curricular Enrichment
  Endowed Book Funds
  Honor Societies and Awards
  Graduates
  Enrollment
  Alumni Association
  Capsule Information
HELP
2007-2008 [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

CSC 331 - Design and Analysis of Algorithms

Instructor
Staff

Algorithm design strategies, including greedy, divide-and-conquer, and dynamic programming methods. Advanced data structures, including balanced search trees, graphs, heaps, and priority queues. Advanced methods of searching and sorting. Computational complexity and analysis of algorithms. NP-complete problems.

Prerequisites & Notes
Prerequisite: Computer Science 231. Prerequisite or corequisite: Mathematics 221 or permission of instructor. (Offered Fall of even numbered years.)


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)