Search Results

MATH 378. Discrete Mathematics. 3 Hours.

PR: MATH 283. Permutations, combinations, binominal theorem, inclusion- exclusion formula, recurrence relations, generating functions, elementary graph theory (connectivity, paths, circuits, trees, vertex and edge coloring, graph algorithms) matching theory, and discrete optimization. (Equiv. to CS 426.).