MA-6566 DISCRETE MATHAMATICS

General info: MA6566     DISCRETE   MATHEMATICS University – Anna university, Tamil nadu, India Marks: UNIT 1 to 5 – 9+3 each unit  Period - TOTAL (L:45+T:15): 60 PERIODS  OBJECTIVES: To extend student’s Logical and Mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems. UNIT I  -  LOGIC AND PROOFS Propositional Logic – Propositional equivalences - Predicates and Quantifiers – Nested Quantifiers – Rules of inference - Introduction to proofs – Proof methods and   strategy.  UNIT II –COMBINATORICS 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. UNIT III -  GRAPHS Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths UNIT IV   -  ALGEBRAIC STRUCTURES Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.   UNIT V -  LATTICES AND BOOLEAN ALGEBRA Partial ordering – Po sets – Lattices as po sets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra. TEXT BOOKS:       Kenneth H.Rosen, "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 Com  General info: MA6566     DISCRETE   MATHEMATICS University – Anna university, Tamil nadu, India Marks: UNIT 1 to 5 – 9+3 each unit  Period - TOTAL (L:45+T:15): 60 PERIODS  OBJECTIVES: To extend student’s Logical and Mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems. UNIT I  -  LOGIC AND PROOFS Propositional Logic – Propositional equivalences - Predicates and Quantifiers – Nested Quantifiers – Rules of inference - Introduction to proofs – Proof methods and   strategy.  UNIT II –COMBINATORICS 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. UNIT III -  GRAPHS Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths UNIT IV   -  ALGEBRAIC STRUCTURES Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.   UNIT V -  LATTICES AND BOOLEAN ALGEBRA Partial ordering – Po sets – Lattices as po sets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra. TEXT BOOKS: 1.    Kenneth H.Rosen, "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. REFERENCES: 1.     Ralph.P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition, Pearson Education Asia, Delhi, 2007. 2)    Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications, 2006. 3)     Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata Mc Graw  Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010. Notes from studentfocus.com: Unit-1, Unit-2, Unit-3, Unit-4, Unit-5. Notes from me: CLICK HERE  puter Science", Tata Mc Graw Hill Pub. Co. Ltd, New  Delhi, 30th Reprint, 2011. REFERENCES: 1.     Ralph.P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition, Pearson Education Asia, Delhi, 2007. 2)    Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications, 2006. 3)     Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata Mc Graw  Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010. Notes from studentfocus.com: Unit-1, Unit-2, Unit-3, Unit-4, Unit-5. Notes from me: CLICK HERE To extend student’s Logical and Mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.

UNIT I  -  LOGIC AND PROOFS Propositional Logic – Propositional equivalences - Predicates and Quantifiers – Nested Quantifiers – Rules of inference - Introduction to proofs – Proof methods and strategy.

UNIT II –COMBINATORICS 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.

UNIT III -  GRAPHS Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths

UNIT IV   -  ALGEBRAIC STRUCTURES Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V -  LATTICES AND BOOLEAN ALGEBRA Partial ordering – Po sets – Lattices as po sets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

TEXT BOOKS: 1)    Kenneth H.Rosen, "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.

REFERENCES: 1.     Ralph.P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition, Pearson Education Asia, Delhi, 2007. 2)    Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications, 2006. 3)     Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata Mc Graw  Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.

Notes from studentfocus.com: Unit-1, Unit-2, Unit-3, Unit-4, Unit-5. Notes from me: CLICK HERE