Logic, Prepositional Equivalences, Predicates and Quantifiers. Integers, division in integers and Algorithms. Methods of proof: Rules of inference, Fallacies, Rules of inference for quantified statements, Methods of proving theorems, the halting problems. Mathematical Induction, Recursively Defined functions, Recursive Algorithms, Recurrence Relations, Solving Recurrence Relations, Relations & their Properties. Equivalence Relations, Partial ordering and Total ordering, Hasse diagrams, lattices. Basic Counting Principles. Permutation and Combination. Pigeonhole Principle.

This course has been formulated to teach the student how to deal with discrete values, i.e., the techniques which depend on integers. Moreover this course teaches them different ways and techniques used for proofs of theorems, prepositions and lemmas.

View Now

View Now

View Now

View Now

View Now

View Now

View Now

View Now

View Now

Book Title : Discrete Mathematics and its Application

Author : Kenneth H. Rosen

Edition :

Publisher : McGraw-Hill, 6th Edition, 2007

Book Title : Discrete Mathematical Structures

Author : B. Kolman, Robert C. Busby and S.C. Ross

Edition :

Publisher : Prentice-Hall of India, New Delhi, 5th Edition, 2008

No Information Yet