sc JNTUA B.TECH R 20 2-3 Syllabus For Discrete mathematics & graph theory PDF 2022 – Cynohub

Blog

JNTUA B.TECH R 20 2-3 Syllabus For Discrete mathematics & graph theory PDF 2022

Uncategorized

JNTUA B.TECH R 20 2-3 Syllabus For Discrete mathematics & graph theory PDF 2022

Get Complete Lecture Notes for Discrete mathematics & graph theory on Cynohub APP

Download the APP Now! ( Click Here )

You will be able to find information about Discrete mathematics & graph theory along with its Course Objectives and Course outcomes and also a list of textbook and reference books in this blog.You will get to learn a lot of new stuff and resolve a lot of questions you may have regarding Discrete mathematics & graph theory after reading this blog. Discrete mathematics & graph theory has 5 units altogether and you will be able to find notes for every unit on the CynoHub app. Discrete mathematics & graph theory can be learnt easily as long as you have a well planned study schedule and practice all the previous question papers, which are also available on the CynoHub app.

All of the Topic and subtopics related to Discrete mathematics & graph theory are mentioned below in detail. If you are having a hard time understanding Discrete mathematics & graph theory or any other Engineering Subject of any semester or year then please watch the video lectures on the official CynoHub app as it has detailed explanations of each and every topic making your engineering experience easy and fun.

Discrete mathematics & graph theory Unit One

Mathematical Logic

Introduction, Statements and Notation, Connectives, Well-formed formulas, Tautology, Duality law, Equivalence, Implication, Normal Forms, Functionally complete set of connectives, Inference Theory of Statement Calculus, Predicate Calculus, Inference theory of Predicate Calculus.

Discrete mathematics & graph theory Unit Two

Set theory

Basic Concepts of Set Theory, Relations and Ordering, The Principle of Inclusion-Exclusion, Pigeon hole principle and its application,Functions composition of functions, Inverse Functions, Recursive Functions, Lattices and its properties. Algebraic structures: Algebraic systems-Examples and General Properties, Semi groups and Monoids, groups, sub groups, homomorphism, Isomorphism.

Get Complete Lecture Notes for Discrete mathematics & graph theory on Cynohub APP

Download the APP Now! ( Click Here )

Discrete mathematics & graph theory Unit Three

Elementary Combinatorics

Basics of Counting, Combinations and Permutations, Enumeration of Combinations and Permutations, Enumerating Combinations and Permutations with Repetitions, Enumerating Permutations with Constrained Repetitions, Binomial Coefficients, The Binomial and Multinomial Theorems.

Discrete mathematics & graph theory Unit Four

Recurrence Relations

Generating Functions of Sequences, Calculating Coefficients of Generating Functions, Recurrence relations, Solving Recurrence Relations by Substitution and Generating functions, The Method of Characteristic roots, Solutions of Inhomogeneous Recurrence Relations.

Discrete mathematics & graph theory Unit Five

Graphs

Basic Concepts, Isomorphism and Subgraphs, Trees and their Properties, Spanning Trees, Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multigraphs and Euler Circuits, Hamiltonian Graphs, Chromatic Numbers, The Four Color Problem

Discrete mathematics & graph theory Course Objectives

Introduce the concepts of mathematical logic and gain knowledge in sets, relations and functions and Solve problems using counting techniques and combinatorics and to introduce generating functions and recurrence relations. Use Graph Theory for solving real world problems

Discrete mathematics & graph theory Course Outcomes

After completion of the course, students will be able to•Apply mathematicallogic to solve problems. •Understand the concepts and perform the operations related to sets, relations and functions. •Gain the conceptual background needed and identify structures of algebraic nature.•Apply basic counting techniques to solve combinatorial problems. •Formulate problems and solve recurrence relations. •Apply Graph Theory in solving computer science problems

Discrete mathematics & graph theory Text Books

1.Joe L. Mott, Abraham Kandel and Theodore P. Baker, Discrete Mathematics for Computer Scientists & Mathematicians, 2nd Edition, Pearson Education. 2.J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw Hill, 2002.

Discrete mathematics & graph theory Reference Books

1.Kenneth H. Rosen, Discrete Mathematics and its Applications with Combinatorics and Graph Theory, 7th Edition, McGraw Hill Education (India) Private Limited.2.Graph Theory with Applications to Engineering and Computer SciencebyNarsinghDeo.

Scoring Marks in Discrete mathematics & graph theory

Scoring a really good grade in Discrete mathematics & graph theory is a difficult task indeed and CynoHub is here to help!. Please watch the video below and find out how to get 1st rank in your B.tech examinations . This video will also inform students on how to score high grades in Discrete mathematics & graph theory. There are a lot of reasons for getting a bad score in your Discrete mathematics & graph theory exam and this video will help you rectify your mistakes and help you improve your grades.

Information about JNTUA B.Tech R 20 Discrete mathematics & graph theory was provided in detail in this article. To know more about the syllabus of other Engineering Subjects of JNTUH check out the official CynoHub application. Click below to download the CynoHub application.

Get Complete Lecture Notes for Discrete mathematics & graph theory on Cynohub APP

Download the APP Now! ( Click Here )

Comments (2)

  1. Vennela devi

    I need complete material on disecert mathmatics with graph theory and please any vedios on this subject please plz plz send to my email..R20 syallabus and 2-1 semister

  2. M.Bhaskar

    Please send all important and. Answers

Leave a Reply to Vennela devi Cancel reply

Your email address will not be published. Required fields are marked *