BAMU SY IT syllabus

BAMU · Second Year B.E./B.Tech Information Technology · NEP 2020

Discrete Mathematics

PCCT-3 · Semester III · 2 credits · CIA 20 + SEE 30

All notes for this subject
  1. Module 1: Set Theory; Logic; Relations; Functions

    10 hours

    Sets, power sets, cardinality and inclusion–exclusion; propositional logic, truth tables, predicates and quantifiers, proofs and mathematical induction; relations, digraphs, relation matrices, equivalence relations, transitive closure, partial orders and Hasse diagrams; types and composition of functions, invertible functions and the pigeonhole principle.

    Examined in the 30-mark end-semester paper

  2. Module 2: Counting Principles; Generating Functions; Recurrence Relations

    10 hours

    Rules of sum and product, permutations and combinations, binomial coefficients and identities, and generating permutations; discrete numeric functions and generating functions; linear recurrence relations with constant coefficients, their homogeneous, particular and total solutions, and solution by generating functions.

    Examined in the 30-mark end-semester paper

  3. Module 3: Graphs; Trees; Algebraic Structures

    10 hours

    Multigraphs and weighted graphs, paths and circuits, Dijkstra's algorithm, Eulerian and Hamiltonian paths, planar graphs and graph colouring; rooted trees, prefix codes, spanning trees and cut sets; semigroups, monoids, groups, homomorphisms, normal subgroups, rings, integral domains and fields.

    Examined in the 30-mark end-semester paper

    • Graphs, paths and circuits
    • Euler and Hamiltonian paths
    • Graph colouring and planar graphs
    • Minimum spanning trees and shortest paths
    • Trees, spanning trees and cut sets
    • Groups, monoids and semigroups
    • Rings and fields
    • Group codes and homomorphism

Module contents are summarised from the official BAMU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Marathwada University (BAMU).