## MA6566 DM Notes

Anna University Regulation 2013 CSE MA6566 DM Notes for all 5 units are provided below. Download link for CSE 5th SEM MA6566 Discrete Mathematics Handwritten Lecture Notes are listed down for students to make perfect utilization and score maximum marks with our study materials.

### MA6566 DISCRETE MATHEMATICS L T P C 3104

#### 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 9+3
Propositional Logic – Propositional equivalences – Predicates and Quantifiers – Nested Quantifiers – Rules of inference – Introduction to proofs – Proof methods and strategy.
UNIT II COMBINATORICS 9+3
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 9+3
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 9+3
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 9+3
Partial ordering – Posets – Lattices as posets – Properties of lattices – Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.
TOTAL (L: 45+T:15): 60 PERIODS

If you require any other notes/study materials, you can comment in the below section.