Legacy Course Catalog
C S 482 - Discrete Computational Structures
Effectivity: | 08/27/2001 - 12/14/2002 @ Purdue Calumet Traditional |
---|---|
Credits: | 3 |
Instructional Types: | Lec |
Usually Offered: | fal spr sum |
Short Title: | Intro Analysis Algor |
Description: | Finite and discrete mathematical structures relating to the theory of computers. Directed and undirected graphs and their relation to these structures. Combinatorial problems inherent in computation. Introduction to mathematical analysis of algorithmic complexity. |
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.