Description

The course covers various topics in discrete mathematics that are widely used in Computer Science. Discrete mathematics is concerned with the study of mathematical structures that are inherently discrete rather than continuous. In contrast to real numbers (and functions on real numbers) that have the property of continuity, the objects studied in discrete mathematics are often countable and discrete, such as countable finite (or infinte) sets. Discrete objects can often be enumerated or mapped to integers. The course is divided into three main areas: (1) logic and mathematical reasoning, (2) counting and combinatorial techniques, (3) basic info. on probability. You can browse the course syllabus.

Prerequisites

ICS 102 is the official prerequisites for this course. However, a background in basic mathematics (e.g. MATH 101) will be useful.

Course Objectives

1. To develop mathematical and thinking skills necessary for reading, comprehending, and constructing mathematical arguments
2. To learn the fundamental concepts and techniques of discrete mathematics needed for problem solving in computer science.

Course Learning Outcomes

After completion of this course, the student should be able to:

1. formulate and derive propositional/predicate logic expressions, and apply proving methods.
2. apply counting techniques to solve combinatorial problems.
3. comprehend graphs and trees and their mathematical properties. 

References

1. N.L. Biggs, Discrete Mathematics (revised edition), Clarendon Press, 1989.
2. Crisler, P. Fisher, and Froelich, Discrete Mathematics through Applications, 2^nd Ed., W. H. Freeman Co., 2000
3. A. Tucker, Applied Combinatorics, John Wiley, 1980.
4. R. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, 4^th Ed., Addison Wesley, 1998.
5. M. Huth, M. Ryan, Logic in Computer Science, Cambridge University Press, 2001.

Evaluation