Discrete mathematics concerns processes that consist of a sequence of individual steps.  This distinguishes it from calculus, which studies continuously changing processes.  While the ideas of calculus were fundamental to the science and technology of the industrial revolution, the ideas of discrete mathematics underlie the science and technology specific to the computer age.

-Susanna S. Epp in the Preface to her text "Discrete
Mathematics with Applications"-

To Develop The Ability:

• to think abstractly;
• to construct valid arguments;
• to use both direct and indirect arguments in constructing proofs;
• to employ recursive thinking;
• to verify generalizations by mathematical induction;
• to recognize, verify, and apply various properties of functions and relations;
• to recognize, verify, and apply various properties of graphs and trees;
• to employ a variety of representations for functions, relations, graphs, and trees;
• to recognize when discrete mathematical structures are (are not) isomorphic, and verify the isomorphic (nonisomorphic) nature of the relationship.

Text:
Epp, Susanna S., "Discrete Mathematics with Applications,"  Second Edition, Brooks/Cole, 1995.

Instructor:
Don C. Cathcart
dccathcart@salisbury.edu
Office:  HS 140
Office Hours:  11:00-11:50 MWF; 1:00-2:00 TR  (or by appt.)