Course 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.
Spring 2024
Instructors
Meeting Patterns
Classes Start:
January 8, 2024
Classes End:
April 23, 2024
Location:
02225 SAS Hall
Class Days:
M W F
Class Start Time:
10:40am
Class End Time:
11:30am
Class Type:
Lecture
Credits:
3.00
Restrictions:
Prerequisite: Grade of C or better in either MA 225 or CSC 226 Computer Science Majors
