RTMNU · Second Year B.Tech Artificial Intelligence & Data Science · NEP 2020
Discrete Mathematics and Graph Theory
BMD3T12 · Semester III · 2 credits · College 30 + university 70
A 2-credit multidisciplinary-minor (MDM-I) course of the programme.
Unit 1: Set Theory, Relations and Functions
8 hoursOrdered pairs and n-tuples, types of relations, composite relations, transitive closure, partially ordered sets and Hasse diagrams; functions, their composition and types, and characteristic functions.
Examined in the 70-mark end-semester paper
- Sets, set operations and identities
- Relations and their properties
- Closures of relations
- Partial orders and Hasse diagrams
- Functions: injective, surjective and bijective
Unit 2: Fuzzy Sets and Fuzzy Logic
7 hoursFuzzy sets and systems, crisp sets, operations on and properties of fuzzy sets, the relation between crisp and fuzzy sets, with programming examples.
Examined in the 70-mark end-semester paper
- Fuzzy sets and fuzzy logic
- Fuzzy sets and membership functions
- Crisp and fuzzy sets: operations and properties
- Fuzzy relations
Unit 3: Group Theory and Algebraic Structures
7 hoursBinary operations; groupoids, semigroups, monoids, groups, subgroups and normal subgroups; rings, commutative rings, rings with unity, zero divisors, integral domains and fields (definitions and simple examples).
Examined in the 70-mark end-semester paper
- Binary operations and algebraic systems
- Semigroups, monoids and groups
- Normal subgroups and quotient structures
- Rings, integral domains and fields
Unit 4: Graph Theory Fundamentals
7 hoursBasic concepts of graphs, digraphs and their properties, matrix representation, subgraphs and quotient graphs, isomorphic graphs, and representing algebraic expressions by Venn diagrams and binary trees.
Examined in the 70-mark end-semester paper
- Graphs, subgraphs and degree
- Digraphs and their properties
- Matrix representations of graphs
- Graph isomorphism and planar graphs
Unit 5: Trees and Minimal Spanning Trees
7 hoursBinary and undirected trees, spanning trees, weighted graphs and minimal spanning trees by Prim's and Kruskal's algorithms, worked step by step.
Examined in the 70-mark end-semester paper
- Trees and their properties
- Spanning trees and minimal spanning trees
- Prim's and Kruskal's algorithms
Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).