KBCNMU SY AI & DS syllabus

KBCNMU · Second Year B.E. Artificial Intelligence & Data Science · NEP 2020

Discrete Mathematics

AIDS-301 · Semester III · 3 credits · ISE 40 + ESE 60

  1. Unit 1: Set, Relation and Function

    9 hours

    Operations and laws of sets, Cartesian products, Cantor's diagonal argument, the power set theorem and the Schröder–Bernstein theorem; binary, partial-order and equivalence relations; bijective, inverse and composite functions.

    Examined in the 60-mark end-semester paper

  2. Unit 2: Mathematical Induction and Counting

    9 hours

    The well-ordering principle, recursive definitions and induction; the division algorithm, primes, GCD by the Euclidean algorithm and the fundamental theorem of arithmetic; inclusion–exclusion, the pigeonhole principle, permutations and combinations; number systems and conversion.

    Examined in the 60-mark end-semester paper

  3. Unit 3: Propositional Logic

    9 hours

    Syntax and semantics, validity and satisfiability, connectives and truth tables; logical equivalence, implication, rules of inference and quantifiers; proof methods — direct, by contradiction, by contraposition, and of necessity and sufficiency.

    Examined in the 60-mark end-semester paper

    • Propositions and truth tables
    • Logical equivalences and normal forms
    • Rules of inference and valid arguments
    • Predicates and quantifiers
    • Methods of proof
  4. Unit 4: Algebraic Structures and Morphism

    9 hours

    Algebraic structures with one binary operation — semigroups, monoids and groups — and with two — rings, integral domains and fields; Boolean algebra and Boolean rings, duality, Boolean functions in disjunctive and conjunctive normal form.

    Examined in the 60-mark end-semester paper

  5. Unit 5: Graphs and Trees

    9 hours

    Graph properties — degree, connectivity, paths, cycles, subgraphs and isomorphism; Eulerian and Hamiltonian walks, colouring and planar graphs, perfect graphs; Dijkstra's shortest path; rooted and weighted trees, prefix codes, and Kruskal's and Prim's minimum spanning trees.

    Examined in the 60-mark end-semester paper

Unit contents are summarised from the official KBCNMU syllabus . AiCanCode.org is not affiliated with Kavayitri Bahinabai Chaudhari North Maharashtra University (KBCNMU).