Legacy Course Catalog
C S 332 - Algorithms
Effectivity: | 08/27/2001 - Fall 2007 *** @ Purdue Calumet Traditional |
---|---|
Credits: | 3 |
Instructional Types: | Lec |
Usually Offered: | fal spr sum |
Short Title: | Algorithms |
Description: | An algorithm is a procedure for solving a problem in a finite number of steps. Algorithms, along with data structures, form the fundamental building blocks of computer programs. The types of algorithms discussed will include sorting, searching, probabilistic, graph, and geometric algorithms. The following algorithm techniques are covered: backtracking, divide and conquer, branch and bound, greedy method, and dynamic programming. |
Department: | Mathematics, Computer Science&Statistics |
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.