Propositional Logic – Propositional equivalences – Predicates and Quantifiers – Nested Quantifiers – Rules of inference – Introduction to proofs – Proof methods and strategy.
Mathematical induction – Strong induction and well ordering – The basics of counting – The pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating functions – Inclusion and exclusion principle and its applications.
Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.
Algebraic systems – Semi groups and monoids – Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definition and examples of Rings and Fields
Partial ordering – Posets – Lattices as posets – Properties of lattices – Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.
Reference Book:
1.Grimaldi.R.P., “Discrete and Combinatorial Mathematics: An Applied Introductionâ€,5th Edition, Pearson Education Asia, Delhi, 2014. 2.Lipschutz.S and Mark Lipson, “Discrete Mathematicsâ€, Schaum’s Outlines Tata McGraw Hill Pub. Co. Ltd., New Delhi, 3rd Edition,2010 3.Koshy.T, “Discrete Mathematics with Applicationsâ€, Elsevier Publications, 2006. 4.Balakrishnan, V.K.,†Introductory Discrete Mathematicsâ€, Dover Publications Inc, New York, 2010. 5.Norman L Biggs, â€Discrete Mathematicsâ€, Oxford University press, Oxford, 2nd Edition, 2003.
Text Book:
1.Rosen.K.H, "Discrete Mathematics and its Applications", 7th Edition, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011. 2.Tremblay J.P. and Manohar, R, "Discrete Mathematical Structures with Applications to Computer Science", Tata Mc Graw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.
