Scribd Logo
Upload

Welcome to Scribd!

  • 61 views

    Syll DM

    Uploaded by

    aditvas
    This document outlines the syllabus for a Discrete Mathematics course with 9 modules covering topics like natural numbers, set theory, functions, counting principles, group theory, graph theory, and generating functions. The course is coordinated by faculty from IIT Kanpur and aims to provide foundational knowledge in discrete structures through 57 total lectures.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Syll DM

    Uploaded by

    aditvas
    61 views2 pages
    This document outlines the syllabus for a Discrete Mathematics course with 9 modules covering topics like natural numbers, set theory, functions, counting principles, group theory, graph theory, and generating functions. The course is coordinated by faculty from IIT Kanpur and aims to provide foundational knowledge in discrete structures through 57 total lectures.

    Original Title

    syll_dm

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines the syllabus for a Discrete Mathematics course with 9 modules covering topics like natural numbers, set theory, functions, counting principles, group theory, graph theory, and generating functions. The course is coordinated by faculty from IIT Kanpur and aims to provide foundational knowledge in discrete structures through 57 total lectures.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    61 views2 pages

    Syll DM

    Uploaded by

    aditvas
    This document outlines the syllabus for a Discrete Mathematics course with 9 modules covering topics like natural numbers, set theory, functions, counting principles, group theory, graph theory, and generating functions. The course is coordinated by faculty from IIT Kanpur and aims to provide foundational knowledge in discrete structures through 57 total lectures.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    NPTEL Syllabus

    Discrete Mathematics - Web course


    COURSE OUTLINE Module 1: Natural Numbers & Principle of Mathematical Induction, Module 2: Set Theory Module 3: Functions Module 4: Basic Counting Principles Module 5: Advanced Counting. Module 6: Group Theory Module 7: Group Action, Orbit Stabilizer Theorem and its applications Module 8: Recurrence Relations, Generating Functions Module 9: Basic Graph Theory COURSE DETAIL Module No. Topic/s Lectures Coordinators: Dr. N. Nilakantan Department of Mathematics and Statistics IIT Kanpur Prof. A.K. Lal Department of MathematicsIIT Kanpur

    NPTEL
    http://nptel.iitm.ac.in

    Mathematics

    Natural Numbers: Well Ordering Principle, Principle of Mathematical Induction

    Set Theory: Ordered Sets, Relations, Equivalence Relations and Partitions, Modular Arithmetic.

    Functions: Functions, Composition of Functions, oneone, onto and Inverse of a function.

    Basic Counting Principles: Number of one-one, Permutation, Combinations, Number of onto functions, Partitions and Stirling Numbers of Second kind.

    Advanced Counting: Pigeon-hole Principle, InclusionExclusion Principle, Putting Balls into boxes, Round Table Configurations, Counting using Lattice Paths, Catalan Numbers.

    Group Theory:Groups, Subgroups, Cyclic Groups, Characterisation of Cyclic Groups, Lagranges Theorem, Normal Subgroups, Homomorphism and the first Isomorphism theorem of groups, Symmetric Group till definition of Alternating Group.

    Group Action, Orbit Stabilizer Theorem and its applications to Polyas Counting Principle and Polyas Inventory Problems.

    Recurrence Relations, Generating Functions, Using generating functions to prove results related to certain binomial coefficients.

    Basic Graph Theory: Graphs, Trees, Characterisation of Trees, Rooted Trees.

    References: 1. D. I. A. Cohen, Basic Techniques of Combinatorial Theory, John Wiley and Sons, New York, 1978. 2. G. E. Martin, Counting: The Art of Enumerative Combinatorics, UTM, Springer, 2001. 3. R. Merris, Combinatorics, 2th edition, Wiley-Interscience, 2003. 4. H. S. Wilf, Generatingfunctionology, Academic Press, 1990. 5. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik, Concrete Mathematics: A Foundation for Computer Science (2nd ed.), 1994. 6. J. A. Gallian, Contemporary Abstract Algebra (4th ed.), Narosa Publication, New Delhi, 1998. 7. R. A. Brualdi, Introductory Combinatorics (5th ed.), Prentice Hall, 2009.
    A joint venture by IISc and IITs, funded by MHRD, Govt of India http://nptel.iitm.ac.in

    You might also like