Discrete mathematics is sometimes called finite mathematics. It is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity. Most of the objects studied in finite mathematics are countable sets, such as the integers. Discrete mathematics has got many interesting applications to computer science. Concepts and notations from discrete mathematics are used to study or express objects or problems in computer algorithms and
Upon completion of this course, the student should be able to: