Home / Our Books /  Engineering Books < CS/IT Branch / Discrete Mathematical Structures

More Books related to same category

Noise, Vibration and Harshness

Rs. 120

Control System Engineering

Rs. 310

Programming in Java

Rs. 290

Electromagnetics Waves

Rs. 300

Discrete Mathematical Structures

By Prof. Amber Srivastava, Dr. V B L Chaurasia

4 Ratings | 1 Reviews

Rs. 300


Specifications of Discrete Mathematical Structures

Book Details

  • 978-81-88870-12-9
  • English
  • 2019
  • Paper Back
  • -


  • Unit 1.

    Introduction: Objective, scope and outcome of the course.


    Unit 2.

    Set Theory: Definition of sets, countable and uncountable sets, Set operations, Partition of set, Cardinality (Inclusion-Exclusion & Addition Principles) Venn Diagrams, proofs of some general identities on sets.

    Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem.

    Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle.

    Theorem proving Techniques: Mathematical induction, Proof by contradiction. Composition of Functions. The Pigeonhole and Generalized Pigeonhole Principles.


    Unit 3.

    Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. 2 way predicate logic. Introduction to finite state machine Finite state machines as models of physical system equivalence machines, Finite state machines as language recognizers.


    Unit 4.

    Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices.

    Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimodal Coefficients Recurrence Relation and Generating

    Function: Introduction to Recurrence Relation and Recursive algorithms, linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions, Generating functions, Solution by method of generating functions.


    Unit 5.

    Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results.


    Unit 6.

    Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs, matching, vertex/edge covering.


Reviews of Discrete Mathematical Structures

  • 4
    Average Rating Based on 4 ratings
  • 0
  • 1
  • 0
  • 0
  • 0


04 Sep 2013


contains all topics of syllabus and solved papers of previous papers

See All >