Set Theoretic Operation (part 2)

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-soft-computing/artificial-intelligence-fuzzy-sets/definitions-and-operations/asset-set-theoretic-operation-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), शब्द-भंडार, वर्ण-विचार, हिन्दी की ध्वनि और स्वनिम व्यवस्था, प्राचीन और मध्यकालीन भारतीय आर्यभाषाएँ, काव्य के लक्षण, हेतु और प्रयोजन, अशुद्धि-शोधन, शब्द-रचना, शब्द-भेद, हिन्दी की रूप रचना, रूप-रचना, हिन्दी शब्द रचना, हिन्दी साहित्येतिहास दर्शन, भक्तिकालीन काव्यधाराएँ, भारतीय काव्यशास्त्र की परंपरा, भारतीय नवजागरण और स्वाधीनता आंदोलन, अन्य गद्य विधाएँ एवं प्रवासी साहित्य, निर्धारित उपन्यासों का तुलनात्मक अध्ययन, गोदान, हिन्दी कहानी का विकास, स्वातंत्र्योत्तर और नयी कहानी, हिन्दी निबंध का विकास, शुक्लोत्तर निबंध, द्विवेदी और शुक्ल युग के निबंध, हिन्दी की संवैधानिक स्थिति, आधुनिक भारतीय आर्यभाषाएँ और हिन्दी का उद्भव, हिन्दी भाषा प्रयोग के विविध रूप, रीतिकाल, जीवनी, द्विवेदी युग और छायावाद, रीति, वक्रोक्ति और औचित्य सिद्धान्त, शब्दशक्ति और ध्वनि सिद्धान्त, रस सिद्धान्त और साधारणीकरण, उत्तर आधुनिकतावाद, लोहिया दर्शन, हिन्दी उपन्यास का विकास, हिन्दी नवजागरण, अंबेडकर दर्शन, आदिकाल, प्रयोगवाद और नयी कविता, छायावादी काव्य: प्रसाद और निराला, प्रगतिवाद से समकालीन कविता, निर्गुण भक्ति काव्य, द्विवेदीयुगीन काव्य, रीतिकालीन काव्य, आरंभिक हिन्दी उपन्यास, स्वातंत्र्योत्तर उपन्यास, आत्मकथा, स्वाधीनता-पूर्व प्रेमचंदोत्तर उपन्यास, निर्धारित कहानियों का तुलनात्मक अध्ययन, साठोत्तरी नाटक, प्रसाद और प्रसादोत्तर युग के नाटक, भारतेन्दु युगीन नाटक, स्वातंत्र्योत्तर नाटक, भारतेन्दु युगीन निबंध, संस्मरण और रेखाचित्र, व्यंग्य, एक साहित्यिक की डायरी, संस्कृति के चार अध्याय, सगुण भक्ति काव्य, हिन्दी नाटक, एकांकी और रंगमंच, आधुनिक गद्य और हिन्दी नवजागरण, अलंकार सिद्धान्त, हिन्दी आलोचना का विकास, भक्ति आंदोलन, कल्पना, बिम्ब, प्रतीक, मिथक और फंतासी, नयी कविता का विस्तार और साठोत्तरी कविता, उत्तर-छायावादी और प्रगतिवादी काव्य, काव्यगुण और काव्यदोष, प्लेटो, अरस्तू और पाश्चात्य परंपरा, मार्क्सवाद, स्वच्छन्दतावादी काव्यशास्त्र, आधुनिक पाश्चात्य आलोचना, भाषा और भाषा परिवार, देवनागरी लिपि
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture provides a comprehensive exploration of fuzzy set operations, specifically centering on the Disjunctive Sum, also known as the Disjoint Sum or EX OR operation. The instructor begins by defining the standard disjoint sum using set theory notation involving intersections and unions of complements. The lesson progresses to deriving the membership function for this operation using the min and max operators. A numerical example is worked through step-by-step to demonstrate the calculation. The lecture then distinguishes this from an alternative definition of disjoint sum based on absolute difference, followed by definitions for simple difference and bounded difference. Finally, a brief question regarding alpha-cuts is presented to conclude the session.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The session opens with a slide titled "Disjunctive Sum (EX OR) / Disjoint Sum". The instructor defines the disjoint sum of two fuzzy sets A and B as $(A \oplus B) = (A \cap B^c) \cup (A^c \cap B)$. The slide explicitly states the membership functions for the complements: $A^c$ corresponds to $1 - \mu_A(x)$ and $B^c$ corresponds to $1 - \mu_B(x)$. The instructor explains that the intersection operation in fuzzy logic is typically defined by the minimum function. Consequently, the membership function for the first term $(A \cap B^c)$ is derived as $\min(\mu_A(x), 1 - \mu_B(x))$, which is labeled as P. Similarly, the second term $(A^c \cap B)$ has a membership function of $\min(1 - \mu_A(x), \mu_B(x))$, labeled as Q. The instructor underlines these components on the slide to emphasize the structure of the formula.

  2. 2:00 – 5:00 02:00-05:00

    The instructor transitions to a concrete example to illustrate the calculation. Two fuzzy sets are defined: $A = \{(x_1, 0.2), (x_2, 0.7), (x_3, 1), (x_4, 0)\}$ and $B = \{(x_1, 0.5), (x_2, 0.3), (x_3, 1), (x_4, 0.1)\}$. The goal is to find the simple disjoint sum. The solution first calculates the complements $A^c$ and $B^c$ by subtracting each membership value from 1. For instance, $A^c$ becomes $\{(x_1, 0.8), (x_2, 0.3), (x_3, 0), (x_4, 1)\}$. The instructor then calculates the first part of the disjoint sum, $\mu_{A \cap B^c}(x)$, using the formula $\min(\mu_A(x), 1 - \mu_B(x))$. Handwritten notes appear on the screen showing the calculation "min(0.2, 0.5)" for the first element, resulting in 0.2. For the second element, the calculation is "min(0.7, 0.7)", resulting in 0.7.

  3. 5:00 – 10:00 05:00-10:00

    The calculation continues with the second part of the disjoint sum, $\mu_{A^c \cap B}(x)$, which is $\min(1 - \mu_A(x), \mu_B(x))$. The instructor computes these values for all elements. The final Disjunctive Sum $\mu_{A \oplus B}(x)$ is obtained by taking the maximum of the two intermediate results P and Q. The final set is shown as $\{(x_1, 0.5), (x_2, 0.7), (x_3, 0), (x_4, 0.1)\}$. The lecture then introduces a different definition for Disjoint Sum denoted as $A \Delta B$, defined by the membership function $\mu_{A \Delta B}(x) = |\mu_A(x) - \mu_B(x)|$. The same example is solved using this absolute difference formula, yielding $\{(x_1, 0.3), (x_2, 0.4), (x_3, 0), (x_4, 0.1)\}$. Finally, the instructor defines Simple Difference as $A - B = A \cap B^c$ and Bounded Difference as $\mu_{A \ominus B}(x) = \max\{0, \mu_A(x) - \mu_B(x)\}$, providing brief examples for each.

  4. 10:00 – 10:15 10:00-10:15

    The video concludes with a multiple-choice question regarding alpha-cuts of a fuzzy set. The question asks for the relationship between $A\alpha_1$ and $A\alpha_2$ given that $\alpha_1 < \alpha_2$. The options provided are (a) $A\alpha_1 \supseteq A\alpha_2$, (b) $A\alpha_1 \supset A\alpha_2$, (c) $A\alpha_1 \subseteq A\alpha_2$, and (d) $A\alpha_1 \subset A\alpha_2$. The correct answer is identified as (a), indicating that a lower alpha-cut contains the higher alpha-cut.

The lecture systematically builds understanding of fuzzy set operations by first establishing the standard Disjunctive Sum through set-theoretic definitions and membership function derivations. By working through a detailed numerical example, the instructor clarifies how the min and max operators are applied to calculate the final membership values. The lesson effectively contrasts this standard definition with the absolute difference definition, highlighting that "Disjoint Sum" can refer to different operations depending on the context. The introduction of Simple and Bounded Differences further expands the toolkit for manipulating fuzzy sets, showing how subtraction and bounded arithmetic are handled in fuzzy logic. The final question on alpha-cuts reinforces the hierarchical nature of fuzzy sets, where lower thresholds include more elements than higher thresholds.

Loading lesson…