AMS 301, Finite Mathematics Structures

Catalog Description: Introduction to graph theory and combinatorial analysis. The emphasis is on solving applied problems rather than on theorems and proofs. Techniques used in problem solving will include generating functions, recurrence relations, and network flows. This course develops the type of mathematical thinking that is fundamental to computer science and operations research.

Prerequisites: AMS 210 or MAT 210 or AMS 361 or MAT303.

3 credits

Text: Applied Combinatorics, by Alan Tucker, 5th edition, John Wiley & Sons

Fall 2008 Sections
301.1, Alan Tucker, TuTh 11:20 am-12:40 pm, Physics P118, AMS 301.1 Webpage
301.2 Esther Arkin, MW 2:20-3:40 pm, Physics P118, AMS 301.2 Webpage

Spring 2009 Sections
301.1, Xiangmin Jiao, TuTh 9:50-11:10 am, Room: S B Union 123, COURSE WEBSITE
210.2, TBA, TuTh 2:20-3:40 pm, Melville E4330, COURSE WEBSITE

AMS 301 IS ALSO OFFERED DURING SUMMER SCHOOL. CHECK THE SUMMER SCHOOL BULLETIN FOR TIMES.