JNTUK B.Tech 2-1(R23) Discrete Mathematics and Graph Theory (DM & GT) Material PDF Download for all 5 units is now available. The candidates who are looking for easy material can download from here.
Here you can find free JNTUK R23 materials, lab manuals, previous year papers, important questions, e-books ext. for all latest updates on jntu materials stay with us.
UNIT–I: Mathematical Logic
Propositional Calculus: Statements and Notations, Connectives, Well Formed Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law, Tautological Implications, Normal Forms, Theory of Inference for Statement Calculus, Consistency of Premises, Indirect Method ofProof, Predicate Calculus: Predicates, Predicative Logic, Statement Functions, Variables and Quantifiers, Free and Bound Variables, Inference Theory for Predicate Calculus
UNIT-II: Set Theory
Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties, Operations, Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial Ordering, Hasse Diagrams, Functions: Bijective, Composition, Inverse, Permutation, and Recursive Functions, Lattice and its Properties
UNIT-III: Combinatorics and Recurrence Relations
Basis of Counting, Permutations, Permutations with Repetitions, Circular and Restricted Permutations, Combinations, Restricted Combinations, Binomial and Multinomial Coefficients and Theorems.
Recurrence Relations:
Generating Functions, Function of Sequences, Partial Fractions, Calculating Coefficient of Generating Functions, Recurrence Relations, Formulation as Recurrence Relations, Solving Recurrence Relations by Substitution and Generating Functions, Method of Characteristic Roots, Solving In-homogeneous Recurrence Relations
UNIT–III Download Here
UNIT-IV: Graph Theory
Basic Concepts, Graph Theory and its Applications, Subgraphs, Graph Representations: Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and Hamiltonian Graphs
UNIT–IV Download Here
UNIT-V: Multi Graphs
Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem, Graph Colouring and Covering, Chromatic Number, Spanning Trees, Prim’s and Kruskal’s Algorithms, BFS and DFS Spanning Trees.
UNIT–V Download Here