Discrete Mathematics for SPPU 19 Course (SE - I - Comp.- 210241) FOR END SEM EXAM – 2020 Edition

by H.R. Bhapkar

Counting The Basics of Counting, rule of Sum and Product, Permutations and Combinations, Binomia l Coefficients and Identities, Generalized Permutations and Combinations, A lgorithms for generating Permutations and Combinations. Graph Graph Terminology and Special Types of Graphs, Represent ing Graphs nd Graph Isomorphism, Connectivity, Euler and Hamilton Paths, the handshaking lemma, Single source shortest path- Dijkstra's Algorithm, Planar Graphs, Graph Colouring. Introduction, propert ies of trees, Binary search tree, tree traversal, decisicon tree, prefix codes and Huffman coding, cut sets, Spanning Trees and Minimum Spanning Tree, Kruskal's and Prim's algorithms, The Max flow-Min Cut Theorem (Transport network). Algebraic Structures and Coding The structure of algebra, Algebraic Systems, Semi Groups, Monoids, Groups, Homomorphism and Normal Subgroups, and Congruence relations, Rings, Integral Domains and Fields, Coding theory, Polynomial Rings and polynomial Codes, Galois Theory -Field Theory and Group Theory.

Kindle Edition

Published October 6, 2020