What is SET
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, 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, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video provides a foundational lecture on the mathematical concept of a "Set" within the context of discrete structures. The instructor begins by defining a set as a fundamental building block for all discrete structures, used to group objects together. A formal definition is presented on screen: "An unordered, well-defined, collection of distinct objects (Called elements or members of a set) of same type". The instructor emphasizes that the "type" is determined by the person defining the set. Several examples are provided to illustrate this, including sets of even numbers (A = {0, 2, 4, 6, ---}), odd numbers (B = {1, 3, 5, ---}), and natural numbers (C = {x | x ∈ Natural number}). The lecture then transitions to the notation used for sets, explaining that sets are generally denoted by capital letters while their elements are denoted by lowercase letters. Visual aids, such as a collection of geometric shapes and jewelry sets, are used to reinforce the concept of grouping. The instructor introduces the membership symbols, explaining that "x ∈ A" means x is a member of A, while "x ∉ A" means x is not a member. Finally, the concept of "Cardinality of a set" is introduced, defined as the number of elements present in a set, denoted by |A|. An example calculation is shown where the set A = {0, 2, 4, 6} has a cardinality of 4.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with the title "What is a SET" and defines sets as fundamental discrete structures. The instructor presents the formal definition: "An unordered, well-defined, collection of distinct objects... of same type". He underlines key terms like "discrete structures", "group objects together", "unordered, well-defined", and "distinct". Examples A, B, and C are listed on the slide to show different ways to define sets, such as listing elements or using set-builder notation. Specifically, A = {0, 2, 4, 6, ---}, B = {1, 3, 5, ---}, and C = {x | x ∈ Natural number}. He also writes "A = {1, 1, 1, 1}" and crosses it out to emphasize the distinctness rule.
2:00 – 5:00 02:00-05:00
The lecture moves to notation and visual representations. The instructor explains that sets are denoted by capital letters and elements by lowercase letters. Visual examples include a bag of colored shapes and sets of jewelry to illustrate grouping. The membership symbols are introduced: "x ∈ A" for membership and "x ∉ A" for non-membership. The instructor underlines these symbols and the text "Lower case letters are generally used to denote the elements of the set". He also writes "a = {1, 1, 1, 1}" and crosses it out to demonstrate the rule of distinctness. The slide text reads "A Set is generally denoted usually by capital letter. The objects of a set called the elements, or members of the set." and "A set is said to contain its elements."
5:00 – 5:56 05:00-05:56
The final section covers "Cardinality of a set". The definition is given as "the number of elements present in a Set, denoted like |A|". The instructor provides a concrete example: "For e.g. A = {0, 2, 4, 6}, |A| = 4". He writes "|A| = 4" on the screen to reinforce the notation and calculation. The instructor underlines the definition text to highlight the key phrase "number of elements present in a Set".
The video systematically builds the concept of a set from definition to notation to measurement. It starts with the theoretical definition emphasizing distinctness and orderlessness, moves to practical notation rules and visual grouping examples, and concludes with the quantitative measure of a set's size through cardinality. The instructor uses red underlines and handwritten notes to emphasize critical concepts throughout the lecture. This progression ensures students understand both the abstract properties and the practical application of sets in discrete mathematics.

