ICS 253 Discrete Structures I Fall 2007			Information & computer Sciences Department
Home	What's New	Assignments	Quizzes	Exams	Topics	GQs	Links

Description

The course covers various topics in discrete mathematics that are widely used in Computer Science. Discrete mathematics deals with (finite or infinite) objects that are disconnected like books, tables, integers, graphs, and trees. The course is divided into three main areas:  logic and mathematical reasoning, counting and combinatorial techniques, and graphs and trees.  Here is the course syllabus.

Prerequisites

ICS102 is the official prerequisites for this course. However, a background in discrete mathematics (in MATH 101), data structures, and probability will be very helpful.

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. N. 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