In Discrete Mathematics, you will learn to understand many topics that relate to both Mathematics and Computer Science.  Such topics include:

• Perform set operations and show the relationships between number systems.
• Evaluate, compose, compare, and contrast functions, relations, recursion and algorithms.
• Assess the validity of logical expressions.
• Apply the basic combinatorics formulas to counting problems.
• Compare and contrast algorithm complexity for common algorithms.
• Construct and explain some basic proofs.
• Perform proofs using induction.
• Apply the concept of graphs, trees, paths, and circuits to real world situations.
• Represent networks and relationships through the use of graphs and trees.
• Perform and evaluate search problems and sorting algorithms.
• Examine the mathematical contributions made by people from diverse cultures throughout history.
• Articulate a solution to mathematical problems.
• Apply appropriate technology to the solution of mathematical problems.

Below is an explanation of the icons that you will discover as you navigate the world of Discrete Mathematics on the World Wide Web.  All of the information for the Discrete Mathematics website has been provided courtesy of Sylvia Sorkin.

Introductory Information contains course policies of some instructors.

Practice Lecture Notes links you to exams which Sylvia Sorkin has used in past semesters. Your instructor's lecture notes will be different, but these are still very helpful.

To go back to ELMO, click on left arrow.

Page written and maintained by Donna Tupper.
Page last updated September, 2005