Nirmala V , Pandikani M Discrete Mathematics 2025 | 10.81 MB
Title: DISCRETE MATHEMATICS
Author: NA.VIKRAMAN
Description:
Unit I
Logic: Propositional equivalence, predicates and quantifiers, Methods of proofs, proof strategy, sequences and summation, mathematical induction, recursive definitions and structural induction, program correctness.
Counting: The basics of counting, the pigeonhole principle, permutations and combinations, recurrence relations, solving recurrence relations, generating functions, inclusion-exclusion principle, application of inclusion-exclusion.
Unit II
Relations: Relations and their properties, n-array relations and their applications, representing relations, closure of relations, equivalence of relations, partial orderings.
Graph theory: Introduction to graphs, graph terminology, representing graphs and graph isomorphism, connectivity, Euler and Hamilton paths, planar graphs, graph coloring, introduction to trees, application of trees.
Unit III
Group theory: Groups, subgroups, generators and evaluation of powers, cosets and Lagrange’s theorem, permutation groups and Burnside’s theorem, isomorphism, automorphisms, homomorphism and normal subgroups, rings, integral domains and fields.
Unit IV
Lattice theory: Lattices and algebras systems, principles of duality, basic properties of algebraic systems defined by lattices, distributive and complimented lattices, Boolean lattices and Boolean algebras, uniqueness of finite Boolean expressions, prepositional calculus. Coding theory: Coding of binary information and error detection, decoding and error correction.
Unit I
Logic: Propositional equivalence, predicates and quantifiers, Methods of proofs, proof strategy, sequences and summation, mathematical induction, recursive definitions and structural induction, program correctness.
Counting: The basics of counting, the pigeonhole principle, permutations and combinations, recurrence relations, solving recurrence relations, generating functions, inclusion-exclusion principle, application of inclusion-exclusion.
Unit II
Relations: Relations and their properties, n-array relations and their applications, representing relations, closure of relations, equivalence of relations, partial orderings.
Graph theory: Introduction to graphs, graph terminology, representing graphs and graph isomorphism, connectivity, Euler and Hamilton paths, planar graphs, graph coloring, introduction to trees, application of trees.
Unit III
Group theory: Groups, subgroups, generators and evaluation of powers, cosets and Lagrange’s theorem, permutation groups and Burnside’s theorem, isomorphism, automorphisms, homomorphism and normal subgroups, rings, integral domains and fields.
Unit IV
Lattice theory: Lattices and algebras systems, principles of duality, basic properties of algebraic systems defined by lattices, distributive and complimented lattices, Boolean lattices and Boolean algebras, uniqueness of finite Boolean expressions, prepositional calculus. Coding theory: Coding of binary information and error detection, decoding and error correction.
DOWNLOAD:
rapidgator.net/file/032c5bf5dcdb3c4efa7cb15cf0b72262/Nirmala_V._Pandikani_M.._Discrete_Mathematics_2025.rar
nitroflare.com/view/B9E5EFBB60DF977/Nirmala_V._Pandikani_M.._Discrete_Mathematics_2025.rar
