Legacy Course Catalog
C S 580 - Algorithm Design, Analysis And Implementation
| Effectivity: | 08/20/2001 - 05/10/2003 @ Purdue Fort Wayne Traditional |
|---|---|
| Credits: | 3 |
| Instructional Types: | Lec |
| Usually Offered: | spr |
| Short Title: | Alg Design Anly & Impl |
| Description: | 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 algorrithms, search trees, pattern matching. The polynomial complexity classes P, NP, and co-NP; intractable problems. |
| Department: | Computer Science |
| Credit By Exam: | NO |
| Repeatable Flag: | NO |
| Temporary Flag: | NO |
| Full Time Privilege Flag: | NO |
| Honors Flag: | NO |
| Variable Title Flag: | NO |
Fall 2007 *** indicates the course was still an active course and was transferred to the Banner Catalog effective Spring 2008. This course was not expired Fall 2007.
