Nov 11, 2024  
Undergraduate Bulletin 2010-2011 
    
  Bulletin Home
  Chancellor’s Message
  Part 1: IPFW Profile
  Part 2: General Education Requirements
  Part 3: TransferIN.net: Indiana Core Transfer Library
  Part 4: Colleges, Schools & Divisions
  Part 5: Program Descriptions
  Part 6: Course Descriptions
  Part 7: Services
  Part 8: Regulations, Policies, Rights, & Responsibilities
  Part 9: Directory
  Colleges, Schools & Divisions
  Departments
  Academic Programs
  Academic Calendar
  Campus Map
  Previous IPFW Bulletins
  Part 3: TransferIN.net: Indiana Core Transfer Library
HELP
Undergraduate Bulletin 2010-2011 [Archived Catalog]

CS 58000 - Algorithm Design, Analysis, and Implementation

Basic techniques for designing and analyzing algorithms: dynamic programming, divide and conquer, balancing. Upper and lower bounds on time and space costs, worst case and expected cost measures. A selection of applications such as disjoint set union/find, graph algorithms, search trees, pattern matching. The polynomial complexity classes P, NP, and co-NP; intractable problems.

Preparation for Course
P: CS 48600 or consent of instructor.

Cr. 3.
Dual Level Course
Dual Level, Undergraduate-Graduate