|
School Tool » »
|
|
Name of course :
|
Introduction to Combinatorics
|
|
Description :
|
Basic principles of counting: addition and multiplication principles, generating functions, recursive methods, inclusion-exclusion, pigeonhole principle; basic concepts of graph theory: graphs, digraphs, connectedness, trees; additional topics from:Polya theory of counting, Ramsey theory; combinatorial optimization - matching and covering, minimum spanning trees, minimum distance, maximum flow; sieves; mobius inversion; partitions; Gaussian numbers and q-analogues; bijections and involutions; partially ordered sets.
|
|
Prerequisites :
|
MA 242 or CSC (MA) 224, and proficiency in a programming language
|
|
Corequisites :
|
|
|
Comments :
|
|
|
Average user rating :
|
|
|
Average GPA of classes in course :
|
3.4
|
|
Std. dev. of classes in course :
|
|
|
Percentile within all courses :
|
67%
|
|
Percentile within department courses :
|
58%
|
|
|
Spring 2010
|
|
|
|
Spring 2006
|
|
|
|
Spring 2005
|
|
|
|
Sum I 2004
|
|
|
|
Spring 2004
|
|
|
|
Spring 2002
|
|
|
