Scribd Logo
Upload

Welcome to Scribd!

  • 292 views

    Ma8351 Discrete Mathematics

    Uploaded by

    Surya Surya
    The document outlines a course on discrete mathematics. It covers five units: logic and proofs, combinatorics, graphs, algebraic structures, and lattices and boolean algebra. The objectives are to extend students' logical and mathematical maturity, introduce basic computer science terminology, and familiarize students with concepts like combinatorics, graph theory, algebraic structures, lattices, and boolean algebra. The expected outcomes are for students to gain knowledge in logic for program testing, structure identification, counting principles, and properties of algebraic structures. The course will use two textbooks and three references.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Ma8351 Discrete Mathematics

    Uploaded by

    Surya Surya
    292 views2 pages
    The document outlines a course on discrete mathematics. It covers five units: logic and proofs, combinatorics, graphs, algebraic structures, and lattices and boolean algebra. The objectives are to extend students' logical and mathematical maturity, introduce basic computer science terminology, and familiarize students with concepts like combinatorics, graph theory, algebraic structures, lattices, and boolean algebra. The expected outcomes are for students to gain knowledge in logic for program testing, structure identification, counting principles, and properties of algebraic structures. The course will use two textbooks and three references.

    Original Description:

    Maths engineering 3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document outlines a course on discrete mathematics. It covers five units: logic and proofs, combinatorics, graphs, algebraic structures, and lattices and boolean algebra. The objectives are to extend students' logical and mathematical maturity, introduce basic computer science terminology, and familiarize students with concepts like combinatorics, graph theory, algebraic structures, lattices, and boolean algebra. The expected outcomes are for students to gain knowledge in logic for program testing, structure identification, counting principles, and properties of algebraic structures. The course will use two textbooks and three references.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    292 views2 pages

    Ma8351 Discrete Mathematics

    Uploaded by

    Surya Surya
    The document outlines a course on discrete mathematics. It covers five units: logic and proofs, combinatorics, graphs, algebraic structures, and lattices and boolean algebra. The objectives are to extend students' logical and mathematical maturity, introduce basic computer science terminology, and familiarize students with concepts like combinatorics, graph theory, algebraic structures, lattices, and boolean algebra. The expected outcomes are for students to gain knowledge in logic for program testing, structure identification, counting principles, and properties of algebraic structures. The course will use two textbooks and three references.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    www.padeepz.

    net
    MA8351 DISCRETE MATHEMATICS L T P C
    4 0 0 4
    OBJECTIVES:
     To extend student’s logical and mathematical maturity and ability to deal with abstraction.
     To introduce most of the basic terminologies used in computer science courses and
    application of ideas to solve practical problems.
     To understand the basic concepts of combinatorics and graph theory.
     To familiarize the applications of algebraic structures.
     To understand the concepts and significance of lattices and boolean algebra which are

    et
    widely used in computer science and engineering.

    UNIT I LOGIC AND PROOFS 12


    Propositional logic – Propositional equivalences - Predicates and quantifiers – Nested quantifiers –

    .n
    Rules of inference - Introduction to proofs – Proof methods and strategy.

    UNIT II COMBINATORICS 12
    Mathematical induction – Strong induction and well ordering – The basics of counting – The
    pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear

    pz
    recurrence relations – Generating functions – Inclusion and exclusion principle and its applications

    UNIT III GRAPHS 12


    Graphs and graph models – Graph terminology and special types of graphs – Matrix
    representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.
    ee
    UNIT IV ALGEBRAIC STRUCTURES 12
    Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s –
    Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and
    Fields.
    ad

    UNIT V LATTICES AND BOOLEAN ALGEBRA 12


    Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic
    systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean
    algebra.
    TOTAL: 60 PERIODS
    .p

    OUTCOMES:
    At the end of the course, students would:
     Have knowledge of the concepts needed to test the logic of a program.
     Have an understanding in identifying structures on many levels.
    w

     Be aware of a class of functions which transform a finite set into another finite set which
    relates to input and output functions in computer science.
     Be aware of the counting principles.
     Be exposed to concepts and properties of algebraic structures such as groups, rings and
    w

    fields.

    TEXTBOOKS:
    w

    1. Rosen, K.H., "Discrete Mathematics and its Applications", 7th Edition, Tata McGraw
    Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
    2. Tremblay, J.P. and Manohar.R, " Discrete Mathematical Structures with Applications to
    Computer Science", Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.

    www.padeepz.net
    www.padeepz.net

    REFERENCES:
    1. Grimaldi, R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition,
    Pearson Education Asia, Delhi, 2007.
    2. Lipschutz, S. and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata McGraw Hill
    Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.
    3. Koshy, T. "Discrete Mathematics with Applications", Elsevier Publications, 2006.

    et
    .n
    pz
    ee
    ad
    .p
    w
    w
    w

    www.padeepz.net

    You might also like