MCS 256: Discrete Calculus and Probability
Spring 2010
Announcement(s):
Catalog description:
This course presents methods used in the analysis of discrete
structures, approximately paralleling the analysis of continuous
structures via calculus. Topics include summation techniques,
enumerative combinatorics (principles of counting), discrete
probability, recurrence relations, generating functions, and
asymptotics. This subject matter is particularly relevant in computer
science and in probability and statistics.
Prerequisites: MCS 119 or MCS 121 (Calculus I) and
either MCS 220 (Introduction to Analysis) or MCS 236 (Graph Theory)
Encouraged: MCS-122 (Calculus II)
Instructor
John Holte
holte@gac.edu