DEPARTMENT of
INFORMATION
TECHNOLOGIES
INTERNATIONAL
BURCH
UNIVERSITY
MTH 201
Discrete Mathematics
2011-2012 Fall Term
Azizah Ibrahim
[email protected]
Class Schedule
Class Schedule: Monday 9:00-12:00,
 Office Hour:Open Door Policy

Course Objectives




Introduce the fundamental topics and techniques
in discrete and combinatorial reasoning
Introduce wide variety application of Discrete
mathematics in Computer Science
Apply theory and techniques from discrete
methods, combinatorial and graph theory in the
applications of computer science.
Establish knowledge and understanding of data
structures ,theory of computer languages and the
analysis of algorithms using the theory and
technique from discrete mathematics.
Textbooks
1. Grimaldi, R. (2004) Discrete and
Combinatorial
Mathematics: An Applied
Introduction .New
York :Addison Wesley
Pub.Co.Inc. 5th edition
2. Kenneth H. Rosen (2003) Discrete Mathematics
and its Applications : Mc Graw Hill. 5th edition
Brief Contents

CHAPTER 1: FUNDAMENTALS OF LOGIC

CHAPTER 2: FUNDAMENTALS PRINCIPLES OF COUNTING

CHAPTER 3: SET THEORY



CHAPTER 4: MATHEMATICAL INDUCTION
CHAPTER 5: PROPERTIES OF INTEGERS
CHAPTER 6: RELATIONS AND FUNCTIONS

CHAPTER 7: LANGUAGES: FINITE STATE MACHINES

CHAPTER 8: GRAPH THEORY
Grading
Midterm
Final
Project
Attendance/Quiz
30%
40%
20%
10%