Symmetric Relation

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/mathematics/relations/symmetric-anti-symmetric-asymmetric-relation-and-properties/asset-symmetric-relation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, Artificial Intelligence, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks, प्रेज़ेंटेशन (MS PowerPoint) / Presentation Software (MS PowerPoint)
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory, Number System & Place Value, Factors, Multiples, Divisibility, HCF & LCM, Mensuration — Perimeter, Area, Surface Area, Volume, Data Handling, Graphs & Probability, Coordinates & Graphs, Higher Mathematics — Trigonometry, Quadratics, Polynomials, Progressions, Statistics, Logarithms, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing, Marketing and Consumer Studies
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a comprehensive lecture on symmetric relations within the context of discrete mathematics. The instructor begins by formally defining a symmetric relation: a relation R on a set A is symmetric if for every pair (a, b) in R, the pair (b, a) is also in R. He uses a visual 3x3 matrix to demonstrate this concept, showing how elements must be mirrored across the main diagonal. The lecture then transitions to a practical application where the instructor evaluates a series of specific relations on the set A = {1, 2, 3} to determine their symmetry properties. He systematically fills out a table, marking relations as symmetric or not based on the definition. Finally, the instructor derives the formula for the total number of symmetric relations on a set of size n, which is $2^{n(n+1)/2}$, and discusses related properties involving inverses, unions, intersections, and complements.

Chapters

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

    The instructor introduces the definition of a symmetric relation, stating that if (a, b) is in R, then (b, a) must also be in R. He draws a 3x3 grid representing a set A = {1, 2, 3} to visualize the concept. He explains that for a relation to be symmetric, the matrix representation must be symmetric across the main diagonal. He circles pairs like (1, 2) and (2, 1) to illustrate that if one exists, the other must exist. He also highlights diagonal elements like (1, 1), (2, 2), and (3, 3), noting that they are their own reverses and do not require a pair. This visual aid helps clarify the condition for symmetry. He emphasizes that the condition applies to all elements in the set A. He uses red ink to draw the matrix and circle the elements, making the visual distinction clear for the students.

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

    The lecture moves to a problem-solving session using a table with the set A = {1, 2, 3}. The instructor evaluates seven different relations to check for symmetry. He marks the Cartesian product AxA as symmetric because it contains all possible pairs. The empty set is also marked symmetric. He evaluates specific sets like {(1,1), (2,2), (3,3)} as symmetric. Conversely, he marks {(1,2), (2,3), (1,3)} as not symmetric because the reverse pairs are missing. He derives the formula for the total number of symmetric relations, explaining that diagonal elements can be chosen in $2^n$ ways and off-diagonal pairs in $2^{(n^2-n)/2}$ ways, leading to the total $2^{n(n+1)/2}$. He writes this formula on the board and explains the logic behind the exponent. He also discusses the specific case of n=2 to verify the formula.

  3. 5:00 – 8:30 05:00-08:30

    The instructor completes the analysis of the relations in the table, marking the remaining entries. He summarizes key facts: the smallest symmetric relation is the empty set, and the largest is the Cartesian product AxA. He then addresses theoretical properties. He confirms that if a relation R is symmetric, then $R = R^{-1}$. He validates that the union and intersection of two symmetric relations are always symmetric. However, he refutes the idea that supersets or subsets of a symmetric relation are always symmetric, marking it as false. Finally, he confirms that the complement of a symmetric relation is always symmetric, using a 2x2 example to reinforce the counting logic. He writes True and False next to the statements to clarify the properties. He ensures students understand that while operations like union preserve symmetry, inclusion does not.

The video effectively bridges the gap between the abstract definition of symmetric relations and their practical identification and counting. By starting with a clear definition and a visual matrix representation, the instructor establishes a strong conceptual foundation. The progression to a tabular analysis of specific examples allows students to apply the definition directly, distinguishing between symmetric and non-symmetric cases. The derivation of the counting formula $2^{n(n+1)/2}$ is a crucial takeaway, providing a method to calculate the total number of such relations for any set size. The final section on properties, such as the behavior of unions, intersections, and complements, rounds out the topic by connecting symmetric relations to broader set theory concepts. This structured approach ensures students understand not just what a symmetric relation is, but how to identify it, count it, and manipulate it within mathematical proofs. The use of specific examples like A={1,2,3} and A={a,b} makes the abstract concepts concrete and easier to grasp for exam preparation.

Loading lesson…