## MA201

### Course Name:

Discrete Mathematics (MA201)

### Programme:

### Semester:

### Category:

### Credits (L-T-P):

### Content:

Mathematical Logic and Proofs: Propositional Logic and Applications, Operations on Propositions, Truth Tables, Tautologies & Logical Equivalence, Predicate Logic, Predicates & Quantifiers, Nested Quantifiers, Inference Rules, Proofs Methods; Set Theory: Sets/Operations, Sequences/Summations, Cardinality of Sets, Functions (Surjections, Injections); Induction and Recursion: Mathematical Induction, Strong Induction and Well-Ordering, Recursive Definitions, Structural Induction; Combinatorics: Counting, Pigeonhole Principle, Permutations/Combinations, Binomial Coefficients, Recurrence Relations, Generating Functions, Inclusion-Exclusion; Relations: n-ary Relations and Applications, Representing Relations, Closures of Relations, Equivalence Relations, Partial Orders; Group Theory: Groups, Semigroups, Monoids, Rings, Fields, Vector Spaces and Lattices; Graph Theory: Graphs and Models, Euler and Hamiltonian Paths, Trees, Tree Traversals, Spanning Trees, Graph Matching, Graph Coloring.