Discrete Mathematics Based Syllabus for B.Tech 5th sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.<\/p>\n
The detailed syllabus for Discrete Mathematics B.Tech (R13) fifthsem is as follows<\/p>\n
OBJECTIVES:<\/strong> UNIT I : LOGIC AND PROOFS<\/strong> \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0[9+3 hours] UNIT II : COMBINATORICS<\/strong>\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0[9+3 hours] UNIT III : GRAPHS \u00a0 \u00a0<\/strong>\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0[9+3 hours]
\nTo extend student\u2019s Logical and Mathematical maturity and ability to deal with abstraction and to\u00a0introduce most of the basic terminologies used in computer science courses and application of ideas\u00a0to solve practical problems.<\/p>\n
\nPropositional Logic \u2013 Propositional equivalences – Predicates and Quantifiers \u2013 Nested Quantifiers \u2013\u00a0Rules of inference – Introduction to proofs \u2013 Proof methods and strategy.<\/p>\n
\nMathematical induction \u2013 Strong induction and well ordering \u2013 The basics of counting \u2013 The\u00a0pigeonhole principle \u2013 Permutations and combinations \u2013 Recurrence relations \u2013 Solving linear\u00a0recurrence relations \u2013 Generating functions \u2013 Inclusion and exclusion principle and its applications.<\/p>\n
\nGraphs and graph models \u2013 Graph terminology and special types of graphs \u2013 Matrix representation of\u00a0graphs and graph isomorphism \u2013 Connectivity \u2013 Euler and Hamilton paths.<\/p>\n