This is the course introduction for Discrete Mathematics

1. Topics
Set Theory
Logic
Mathematical Induction
Discrete Probability
Graph theory
Relations
Partially Ordered Sets and Lattices
Recurrence Relations
Propositional Logic
Predicate and Quantifiers
Logical Inference
Resolution Principles
Methods of Proof
Normal Forms
Sets, Relations, Functions
Properties of Relations, Operation on Relations
Equivalence Relations
Pigeon Hole Principle
Permutation and Combination
Generating Functions
Recurrence Relations
Lattices
Finite State Automaton
Grading Policy
30% Assignments (approx. 6-7 assignments)
25% Mid-Term Exam
25% Final Exam
20% Class Participation and Attendance
References
1. Liu C.L., Elements of Discrete Mathematics, 2nd Edition, McGraw Hill.
2. Ross & Wright, “Discrete Mathematics”, 5th Edition, Prentice Hall.
3. http://en.wikibooks.org/wiki/Discrete_Mathematics
Contact Information
Room No. 525, IT Building
Kumar_har@yahoo.com