[PDF] MA6566 Discrete Mathematics (DM) 2013 Regulation Syllabus, Notes, 2 Marks, Question Banks/Important Questions and Previous years Question Papers for Anna University Students

Last updated on Sep 4, 2023
Discrete Mathematics
Syllabus
MA6566 Discrete Mathematics
  • 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 – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.
Study Materials

Notes

1NotesDownload

Question Banks/Important Questions

1QBankDownload

2 Marks

12 MarksDownload

Previous years Question Papers

1MayJune 2016Download
2AprilMay 2015Download
3NovDec 2014Download
4MayJune 2014Download
Tags: AU2013MA6566

We use Cookies

We use cookies to improve your browsing experience on our website, to analyze our website traffic, and to understand where our visitors are coming from. For more please visit our cookie policy.