King Fahd University of Petroleum & Minerals
Information & Computer Science Department
ICS 252 Discrete Structures
Instructor:
Name |
Dr. Sultan Almuhammadi |
Office |
Building 22 - Room 320 |
Phone |
860-1625 |
|
sultanm@ccse.kfupm.edu.sa |
Catalog Description: Combinatorics: permutations, combinations, pigeon-hole principle, counting techniques. Recurrence Relations, generating functions. Graphs. Introduction to computation models: languages, grammars and machines. Chomsky hierarchy.
Course Textbook: Discrete Mathematics and Its Applications (Fifth Edition)
Author: Kenneth H. Rosen
Publisher: McGraw-Hill International
Grading Policy:
Homework and Quizzes 20%
Major Exam – I 25%
Major Exam – II 25%
Final 30%
Topics (tentative plan):
· Review on Logic and Sets (Chapter 1) 2 weeks
· Counting Techniques (Chapter 4 and 5) 3 weeks
· Recurrence Relations (Chapter 6) 2 weeks
· Relations and Functions (Chapter 7 and 1) 2 weeks
· Graphs and Trees (Chapters 8 and 9) 3 weeks
· Modeling Computations (Chapter 11) 3 weeks
Guidelines: