SUK SY CSE syllabus

SUK · Second Year B.Tech. Computer Science and Engineering · NEP 2020

Discrete Mathematical Structures

CSE2101 · Semester III · 3 credits · ISE 10 + mid-semester 30 + ESE 60

  1. Unit 1: Mathematical Logic

    7 hours

    Statements and notation, connectives, statement formulas and truth tables, well-formed formulas, tautologies, equivalence of formulas, the duality law, tautological implications, functionally complete sets of connectives, other connectives and normal forms.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

  2. Unit 2: Set Theory

    5 hours

    Basic concepts and operations on sets; ordered pairs and n-tuples; the Cartesian product.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

  3. Unit 3: Relations and Ordering

    6 hours

    Relations and the properties of binary relations; matrix and graph representations; partitions and coverings; equivalence relations; composition of relations; posets and Hasse diagrams; functions, their types and composition.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

  4. Unit 4: Algebraic Systems

    7 hours

    Algebraic systems: examples and general properties; semigroups and monoids; groups, subgroups and homomorphisms.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

  5. Unit 5: Lattices and Boolean Algebra

    7 hours

    Lattices as partially ordered sets and as algebraic systems; special lattices; Boolean algebra, Boolean functions and their representation and minimisation.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Chains, antichains and sublattices
    • Boolean algebra and Boolean rings
    • Karnaugh maps
  6. Unit 6: Graph Theory

    7 hours

    Basic concepts of graphs; paths, reachability and connectedness; matrix representations of graphs; storage representation and manipulation of graphs; PERT and related techniques.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

Unit contents are summarised from the official SUK syllabus . AiCanCode.org is not affiliated with Shivaji University, Kolhapur.