JNTUH B.Tech - R18 - Discrete Mathematics Notes/Study Materials [All Units]
Download Here
JNTUH B.Tech - R18 - Discrete Mathematics - Short and Long Questions [Unit Wise]
Download Here
JNTUH B.Tech - R18 - Discrete Mathematics Question/Objective Bits [Unit Wise]
Download Here
JNTUH B.Tech - R18 - Discrete Mathematics Notes/Study Materials [Unit Wise]
Syllabus :
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.
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.
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
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
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
Download Here
JNTUH B.Tech - R18 - Discrete Mathematics - Short and Long Questions [Unit Wise]
Download Here
JNTUH B.Tech - R18 - Discrete Mathematics Question/Objective Bits [Unit Wise]
Download Here
JNTUH B.Tech - R18 - Discrete Mathematics Notes/Study Materials [Unit Wise]
| Unit 1 : The Foundations: Logic and Proofs: |
| Unit 2 : |
| Unit 3 : Algorithms, Induction and Recursion |
| Unit 4 : Discrete Probability and Advanced Counting Techniques |
| Unit 5 : Graphs and Trees |
Syllabus :
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.
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.
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
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
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
Last edited: