**we will update the important questions and topics soon ..here we have listed the repeated questions asked in AU question Papers**

MA2265 DISCRETE MATHEMATICS
AIM
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 inductions-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 and
applications.

UNIT III GRAPHS

Graphs and graph models-Graph terminology and special types of graphs-Representing
graphs and graph isomorphism -connectivity-Euler and Hamilton paths

UNIT IV ALGEBRAIC STRUCTURES

Algebraic systems-Semi groups and monoids-Groups-Subgroups and homomorphisms-
Cosets and Lagrange’s theorem- Ring & Fields (Definitions and examples)

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

Previous
Next Post »