MA6566 Discrete Mathematics previous year question papers
B.E-Computer science engineering,third year 5th semester MA6566 Discrete Mathematics previous year question papers for the regulation 2013.
(NOTE:This is the only website,where you can download the previous year Anna university question papers in PDF format with good quality and with out any water marks.You can download the files in a single click and no more Re-directs)
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 – Posets – Lattices as posets – Properties of lattices – Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.
MA6566 Discrete Mathematics previous year question papers for the regulation 2013
MA6566 Discrete Mathematics Nov/Dec 2017 question paper download
MA6566 Discrete Mathematics Apr/May 2017 question paper download