MCS 256

Discrete Calculus and Probability

Spring 2003


College catalog's course 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 121 (Calculus I) and either MCS 220 (Introduction to Analysis) or MCS 236 (Relation-Based Structures)
Encouraged: MCS-122 or MCS-132

Instructor: John Holte

Textbook

Class meetings

Course web page

MCS 256 Syllabus--Spring 2003

Calendar

Homework and collaborative learning

Homework rules

Academic honesty

Exams

Make-up policy

Grading

Participation and performance factors may modify your grade.