Discrete Mathematics for JNTU-H 18 Course (II - II - CSE/IT - CS401PE ) (Decode)

Rs. 230.00
Tax included. Shipping calculated at checkout.

UNIT - I The Foundations : Logic and Proofs : Propositional Logic, Applications of Propositional Logic, Propositional Equivalence, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proofs, Proof Methods and Strategy. (Chapter - 1) UNIT - II Basic Structures, Sets, Functions, Sequences, Sums, Matrices and Relations Sets, Functions, Sequences & Summations, Cardinality of Sets and Matrices Relations, Relations and Their Properties, n-ary Relations and Their Applications, Representing Relations, Closures of Relations, Equivalence Relations, Partial Orderings. (Chapter - 2) UNIT - III Algorithms, Induction and Recursion : Algorithms, The Growth of Functions, Complexity of Algorithms Induction and Recursion : Mathematical Induction, Strong Induction and Well-Ordering, Recursive Definitions and Structural Induction, Recursive Algorithms, Program Correctness. (Chapter - 3) UNIT - IV Discrete Probability and Advanced Counting Techniques : An Introduction to Discrete Probability, Probability Theory, Bayes' Theorem, Expected Value and Variance Advanced Counting Techniques : Recurrence Relations, Solving Linear Recurrence Relations, Divide-and-Conquer Algorithms and Recurrence Relations, Generating Functions, Inclusion- Exclusion, Applications of Inclusion-Exclusion. (Chapter - 4) UNIT - V Graphs : Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Representing Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path Problems, Planar Graphs, Graph Coloring. Trees : Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees. (Chapter - 5)

Pickup available at Nashik Warehouse

Usually ready in 24 hours

Check availability at other stores
Author: [Dr. H.R.Bhapkar] Pages: 192 Edition: 2022 Vendors: Technical Publications