Javascript is currently not supported, or is disabled by this browser. Please enable Javascript for full functionality.

B.S. in Actuarial Science

Otterbein University Course Catalogs

2010-2011 Undergraduate Catalog 
    
    Nov 10, 2024  
HELP
2010-2011 Undergraduate Catalog [Archived Catalog]

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

COMP 415 - COMPLEXITY OF ALGORITHMS

Hours: 4
Lecture and Laboratory

Analysis of algorithm complexity; time and space analysis of algorithms, asymptotic (big-Oh) notation, and time-space tradeoffs in comparative analysis. Problem-solving strategies introduced by selected example, including greedy, divide-and-conquer, dynamic programming, and backtracking strategies. The concept of computational complexity is discussed by way of the theory of NP-completeness.
Prerequisites: COMP 205, MATH 165, and MATH 170.


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Catalog Navigation
  Catalog Home
  The University and the Community
  The Academic Program
  Admission
  Registration
  Tuition and Financial Assistance
  Campus Life
  Continuing Studies
  Directory
  Departments
  Academic Program Requirements
  Courses
  Off-Campus Programs
   
All catalogs © 2024 Otterbein University.
Powered by Modern Campus Catalog™.