BAMU · Second Year B.E./B.Tech Computer Science and Engineering · NEP 2020
Discrete Mathematics
PCCT-3 · Semester III · 2 credits · CIA 20 + SEE 30
Module 1: Set Theory, Logic, Relations and Functions
10 hoursSets, set operations, power sets, finite, infinite and uncountable sets and inclusion–exclusion; propositional logic, truth tables, predicates and quantifiers, proofs and induction; relations, digraphs, equivalence relations, closures and partial orders with Hasse diagrams; functions and the pigeonhole principle.
Examined in the 30-mark end-semester paper
- Set theory and set operations
- Inclusion–exclusion principle
- Countable and uncountable sets
- Propositional logic and equivalences
- Predicate logic and quantifiers
- Mathematical induction
- Relations and their properties
- Partial orders, Hasse diagrams and lattices
Module 2: Counting Principles, Numeric Functions and Recurrence Relations
10 hoursRules of sum and product, permutations and combinations, binomial coefficients and identities, generalised permutations and combinations and algorithms to generate them; discrete numeric functions and generating functions; linear recurrence relations with constant coefficients and their homogeneous, particular and total solutions.
Examined in the 30-mark end-semester paper
- Permutations and combinations
- Discrete numeric functions
- Generating functions
- Recurrence relations and their solution
Module 3: Graphs, Trees and Algebraic Structures
10 hoursGraph terminology, multigraphs and weighted graphs, Dijkstra's shortest path, Euler and Hamilton paths, planar graphs and colouring; rooted trees, prefix codes, spanning trees and cut sets; algebraic systems, semigroups, monoids, groups, homomorphisms and normal subgroups, rings, integral domains and fields.
Examined in the 30-mark end-semester paper
Module contents are summarised from the official BAMU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Marathwada University (BAMU).