JNTUH Discrete Mathematics syllabus CS 2-2 Sem R18 CS401PC

Unit-1 The Foundations: Logic and Proofs

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-2 Basic Structures

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-3 Algorithms, Induction and Recursion

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-4 Discrete Probability and Advanced Counting Techniques

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-5 Graphs

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

 

TEXT BOOK:

1. Discrete Mathematics and its Applications with Combinatorics and Graph Theory- Kenneth H Rosen, 7th Edition, TMH.

 

REFERENCES BOOKS:

1. Discrete Mathematical Structures with Applications to Computer Science-J.P. Tremblay and R. Manohar, TMH,

2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe L. Mott, Abraham Kandel, Teodore P. Baker, 2nd ed, Pearson Education.

3. Discrete Mathematics- Richard Johnsonbaugh, 7Th Edn., Pearson Education.

4. Discrete Mathematics with Graph Theory- Edgar G. Goodaire, Michael M. Parmenter.

5. Discrete and Combinatorial Mathematics - an applied introduction: Ralph.P. Grimald, 5th edition, Pearson Education.

 

Course Outcomes:

  • Ability to understand and construct precise mathematical proofs
  • Ability to use logic and set theory to formulate precise statements
  • Ability to analyze and solve counting problems on finite and discrete structures
  • Ability to describe and manipulate sequences
  • Ability to apply graph theory in solving computing problems