Credit Hours: 3 Prerequisite: MAT 275 or CSC 133. Techniques for counting configurations of objects. Recurrence relations; principle of inclusion-exclusion; graphs, trees, and circuits. Additional topics chosen from Polya’s Theorem, generating functions, and network flows.