DMGT (Discrete Mathematics) – RTMNU Combined Notes + Important Questions
=====================================
UNIT 1: SET THEORY, RELATIONS & FUNCTIONS
=====================================
--- Notes ---
Sets:
- Set, Types of sets, Subset, Power set, Universal set.
- Operations: Union, Intersection, Difference, Complement.
- Venn Diagrams & Cartesian Product.
Relations:
- Relation as subset of A × B.
- Types: Reflexive, Symmetric, Transitive, Antisymmetric.
- Equivalence Relation, Composite Relation, Transitive Closure.
- Poset & Hasse Diagram.
Functions:
- Function, Domain, Codomain, Range.
- One-One, Onto, Bijective, Identity Function.
- Composition of Functions, Characteristic Function.
--- Important Questions ---
1. Solve Venn diagram problems.
2. Check relation properties.
3. Draw Hasse diagram for a given Poset.
4. Function composition problems.
=====================================
UNIT 2: FUZZY SET & FUZZY LOGIC
=====================================
--- Notes ---
Fuzzy Sets:
- Membership values between 0 and 1.
- Crisp sets have 0/1 membership.
Operations:
- Union: max(a,b)
- Intersection: min(a,b)
- Complement: 1 − µ(x)
Fuzzy Logic:
- Classical logic vs fuzzy logic.
- Membership functions.
--- Important Questions ---
1. Difference between fuzzy & crisp sets.
2. Perform fuzzy operations.
3. Explain membership functions.
=====================================
UNIT 3: GROUP THEORY & RING THEORY
=====================================
--- Notes ---
Group Theory:
- Binary Operation.
- Groupoid, Semigroup, Monoid, Group.
- Subgroup, Normal Subgroup.
Ring Theory:
- Ring, Commutative Ring, Ring with Unity.
- Zero Divisor, Integral Domain, Field.
--- Important Questions ---
1. Verify (Z, +) is a group.
2. Define ring, integral domain, field with examples.
3. Check if a subset is a subgroup.
=====================================
UNIT 4: GRAPH THEORY
=====================================
--- Notes ---
- Graph, Digraph, Weighted Graph.
- Path, Circuit, Degree of Vertex.
- Euler Path/Circuit, Hamilton Path.
- Trees, Binary Trees, Spanning Trees.
- Prim’s & Kruskal’s Algorithms.
--- Important Questions ---
1. Apply Prim’s algorithm to a given graph.
2. Apply Kruskal’s algorithm.
3. Check Euler or Hamilton path.
4. Draw spanning tree.
=====================================
UNIT 5: COMBINATORICS
=====================================
--- Notes ---
- Permutations & Combinations.
- Pigeonhole Principle.
- Recurrence Relations.
- Generating Functions.
--- Important Questions ---
1. Compute P(n,r) & C(n,r).
2. Apply pigeonhole principle.
3. Solve T(n)=T(n-1)+3.
4. Distribute objects into boxes.
=====================================
END OF DOCUMENT
=====================================