An advanced course in discrete mathematics (see Mathematics 251) with emphasis on counting and finite structures. Counting techniques will include generalized binomial coefficients, inclusion/exclusion, generating functions, partitions and Stirling numbers, and Polya counting. Structures studied will be drawn from: graphs and digraphs, networks, designs, posets and lattices, possibly with applications to the physical and social sciences. The theory will be developed with an emphasis on problem solving and independent work. Evaluation will be based primarily on performance on problem sets and exams. Prerequisites: Mathematics 211, 251 and permission of instructor. This is a quantitative/formal reasoning course.