King Fahd University of Petroleum & Minerals - Home Page Information & computer Sciences Department

ICS 252

Discrete Structures II

Winter 2006

Home

What's New

Assignments

Quizzes

Exams

Problems

 Links

 

Instructor:

  Ebrahim Malalla

Office:

   Bldg 22 (124-8), ICS - KFUPM

Phone:

  860-3819

E-mail:

   malalla@ccse.kfupm.edu.sa

Office Hours:

   SMW 10 – 11, and whenever you catch me.

 

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 five main areas:  combinatorics, probability, recurrence relations, graph theory, and models of Computations. Here is the course syllabus.

 

Prerequisites

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

 

 

Textbook

 

The official textbook is

Kenneth H. Rosen, Discrete Mathematics and Its Applications, 5th Ed., McGraw-Hill, 2003.

The official website of the book contains many useful resources.

  

References

1.       N.L. Biggs, Discrete Mathematics (revised edition), Clarendon Press, 1989.

2.       Crisler, N., Fisher, P. and Froelich, Discrete Mathematics through Applications, 2nd 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, 4th Ed., Addison Wesley, 1998.

 

Evaluation

Assignments/Quizzes

15%

Major Exam I*          Thu Mar 16th

25%

Major Exam II*         Thu Apr 20th

25%

Final Exam*

35%

*  These exams are not comprehensive except the final exams.