Finite configurations. Topics may include counting methods, generating functions, graph theory, map coloring, block design, network flows, analysis of discrete algorithms. Pre: 311 or consent.