MNIT Jaipur Syllabus Information Technology Discrete Structures
Logic: Introduction to Logic, Propositional Logic and Predicate Logic
Propositional Logic: Elements of Propositional Logic, Truth Table, Connectives, Construction of
Proposition, Converse and Contrapositive, Reasoning with Propositions, Identities of Propositions and
Dual, Use of Identities, Implications, Reasoning with Propositions, Proof of Identities, Proof of
Predicate Logic: Well Formed Formula (Wff) of Predicate Logic, Predicate, Quantification,
Constructing Formulas, Reasoning with Predicate Logic, Quantifiers and Connectives.
Set and Functions: Sets, relations, functions, operations, and equivalence Relations, relation of
partial order, partitions, binary relations, Equivalence relations. Recursion, Proof by Induction
Number-theoretic algorithms: Greatest Common Divisor, Chinese Remainder Theorem, Primality
testing, polynomial representation of binary number, Galois fields, primitive roots, discrete logarithms.
1. Kolman B., Busby R: Discrete Mathematical Structures for Compute Science, PHI.
2. Liu: Introduction to Discrete Mathemetics, McGraw-Hill.
3. Graham, Knuth, Pratshnik : Concrete Mathematics.
4. Grimaldi: Discrete Mathematical Structures.
5. Grossman P, Discrete Mathematics for Computing, Macmillan 1995
6. Ross KA & Wright CRB, Discrete Mathematics, Prentice-Hall 1999
7. Johnsonbaugh R, Discrete Mathematics, Macmillan.
8. Wiitala, Discrete Mathematics, McGraw Hill.
9. Biggs N L, Discrete Mathematics, Oxford.
10. Truss J, Discrete Mathematics for Computer Scientists, Addison Wesley.