Combinatorics and Graph Theory

Course Type: 
CS
Code: 
4280
Level: 
Undergraduate
Credit Hours: 
4
Schedule Type: 
Lecture
Description: 

Permutations, combinatorics, generating functions, recurrence relations, and Polya's theory of counting; methods, results, and algorithms of graph theory, with emphasis on graphs as mathematical models applicable to organizational and industrial situations.

Prerequisites: 

Undergraduate level MTH 2310 Minimum Grade of D and (Undergraduate level CS 1160 Minimum Grade of D or Undergraduate level CS 1180 Minimum Grade of D or Undergraduate level CEG 2170 Minimum Grade of D)

Restrictions: 
May not be enrolled in one of the following Degrees: Intending Egr & CS. Must be enrolled in one of the following Colleges: College of Egr & Computer Sci.