CS 4280 - Combinatorics and Graph Theory

Credit Hour(s): 4

Course 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.

Prerequisite(s): 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)

Enrollment Restrictions: May not be enrolled in one of the following degrees: Intending Egr & CS, Pre_Degree. Must be enrolled in one of the following colleges: College of Egr & Computer Sci.

Course Level: Undergraduate
Schedule Type(s): Lecture

Grade Mode: Standard
An additional fee is associated with this course.